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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/xor2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:08:41,326 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:08:41,328 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:08:41,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:08:41,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:08:41,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:08:41,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:08:41,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:08:41,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:08:41,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:08:41,348 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:08:41,348 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:08:41,349 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:08:41,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:08:41,351 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:08:41,352 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:08:41,353 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:08:41,355 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:08:41,357 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:08:41,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:08:41,360 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:08:41,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:08:41,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:08:41,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:08:41,364 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:08:41,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:08:41,366 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:08:41,367 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:08:41,368 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:08:41,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:08:41,370 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:08:41,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:08:41,371 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:08:41,371 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:08:41,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:08:41,373 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:08:41,373 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-14 17:08:41,388 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:08:41,388 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:08:41,389 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:08:41,389 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:08:41,390 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:08:41,390 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:08:41,390 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:08:41,391 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:08:41,391 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:08:41,391 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:08:41,391 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:08:41,391 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:08:41,392 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:08:41,392 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:08:41,392 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:08:41,392 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:08:41,392 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:08:41,393 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:08:41,393 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:08:41,393 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:08:41,393 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:08:41,394 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:08:41,394 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:08:41,394 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:08:41,394 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:08:41,394 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:08:41,395 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:08:41,395 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:08:41,395 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:08:41,395 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:08:41,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:08:41,452 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:08:41,456 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:08:41,458 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:08:41,458 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:08:41,459 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/xor2_true-unreach-call.i [2018-11-14 17:08:41,520 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4dc3531/7137c5ea9b7f4db8933bbc456cf996f5/FLAG754682f9d [2018-11-14 17:08:41,982 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:08:41,983 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/xor2_true-unreach-call.i [2018-11-14 17:08:41,989 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4dc3531/7137c5ea9b7f4db8933bbc456cf996f5/FLAG754682f9d [2018-11-14 17:08:42,004 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4dc3531/7137c5ea9b7f4db8933bbc456cf996f5 [2018-11-14 17:08:42,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:08:42,016 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:08:42,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:08:42,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:08:42,021 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:08:42,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:08:42" (1/1) ... [2018-11-14 17:08:42,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2097ee75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42, skipping insertion in model container [2018-11-14 17:08:42,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:08:42" (1/1) ... [2018-11-14 17:08:42,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:08:42,060 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:08:42,316 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:08:42,327 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:08:42,355 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:08:42,377 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:08:42,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42 WrapperNode [2018-11-14 17:08:42,378 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:08:42,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:08:42,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:08:42,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:08:42,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42" (1/1) ... [2018-11-14 17:08:42,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42" (1/1) ... [2018-11-14 17:08:42,407 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42" (1/1) ... [2018-11-14 17:08:42,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42" (1/1) ... [2018-11-14 17:08:42,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42" (1/1) ... [2018-11-14 17:08:42,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42" (1/1) ... [2018-11-14 17:08:42,435 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42" (1/1) ... [2018-11-14 17:08:42,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:08:42,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:08:42,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:08:42,438 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:08:42,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42" (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-14 17:08:42,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:08:42,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:08:42,609 INFO L138 BoogieDeclarations]: Found implementation of procedure xor [2018-11-14 17:08:42,609 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:08:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:08:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:08:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure xor [2018-11-14 17:08:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:08:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:08:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:08:42,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:08:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:08:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:08:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:08:42,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:08:43,435 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:08:43,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:08:43 BoogieIcfgContainer [2018-11-14 17:08:43,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:08:43,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:08:43,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:08:43,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:08:43,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:08:42" (1/3) ... [2018-11-14 17:08:43,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748aa518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:08:43, skipping insertion in model container [2018-11-14 17:08:43,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:08:42" (2/3) ... [2018-11-14 17:08:43,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748aa518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:08:43, skipping insertion in model container [2018-11-14 17:08:43,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:08:43" (3/3) ... [2018-11-14 17:08:43,444 INFO L112 eAbstractionObserver]: Analyzing ICFG xor2_true-unreach-call.i [2018-11-14 17:08:43,452 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:08:43,460 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:08:43,478 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:08:43,516 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:08:43,517 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:08:43,517 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:08:43,518 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:08:43,518 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:08:43,518 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:08:43,519 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:08:43,519 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:08:43,519 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:08:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:08:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:08:43,546 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:43,547 INFO L375 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-14 17:08:43,549 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:43,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:43,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1575634353, now seen corresponding path program 1 times [2018-11-14 17:08:43,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:43,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:43,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:43,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:43,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:43,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:08:43,783 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-14 17:08:43,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:08:43,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #69#return; {37#true} is VALID [2018-11-14 17:08:43,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret13 := main(); {37#true} is VALID [2018-11-14 17:08:43,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {37#true} is VALID [2018-11-14 17:08:43,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:08:43,785 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:08:43,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 17:08:43,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:08:43,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 17:08:43,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:08:43,789 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#true} {38#false} #73#return; {38#false} is VALID [2018-11-14 17:08:43,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {38#false} is VALID [2018-11-14 17:08:43,790 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:08:43,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 17:08:43,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:08:43,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 17:08:43,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:08:43,791 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#true} {38#false} #75#return; {38#false} is VALID [2018-11-14 17:08:43,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {38#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {38#false} is VALID [2018-11-14 17:08:43,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-14 17:08:43,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {38#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {38#false} is VALID [2018-11-14 17:08:43,792 INFO L256 TraceCheckUtils]: 23: Hoare triple {38#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {37#true} is VALID [2018-11-14 17:08:43,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {37#true} is VALID [2018-11-14 17:08:43,793 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-14 17:08:43,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {37#true} is VALID [2018-11-14 17:08:43,793 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:08:43,794 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#true} {38#false} #77#return; {38#false} is VALID [2018-11-14 17:08:43,794 INFO L273 TraceCheckUtils]: 29: Hoare triple {38#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {38#false} is VALID [2018-11-14 17:08:43,794 INFO L273 TraceCheckUtils]: 30: Hoare triple {38#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {38#false} is VALID [2018-11-14 17:08:43,795 INFO L273 TraceCheckUtils]: 31: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:08:43,801 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-14 17:08:43,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:08:43,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:08:43,810 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:08:43,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:43,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:08:43,992 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-14 17:08:43,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:08:44,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:08:44,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:08:44,005 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:08:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:44,169 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-14 17:08:44,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:08:44,169 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 17:08:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:44,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:08:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:08:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:08:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 76 transitions. [2018-11-14 17:08:44,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 76 transitions. [2018-11-14 17:08:44,643 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-14 17:08:44,660 INFO L225 Difference]: With dead ends: 59 [2018-11-14 17:08:44,660 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:08:44,664 INFO L604 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-14 17:08:44,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:08:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:08:44,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:44,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:08:44,714 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:08:44,714 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:08:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:44,721 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:08:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:08:44,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:44,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:44,723 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:08:44,723 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:08:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:44,728 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-14 17:08:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:08:44,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:44,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:44,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:44,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:08:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-14 17:08:44,736 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 32 [2018-11-14 17:08:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:44,736 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-14 17:08:44,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:08:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-14 17:08:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:08:44,739 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:44,739 INFO L375 BasicCegarLoop]: trace histogram [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-14 17:08:44,739 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:44,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:44,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1963798480, now seen corresponding path program 1 times [2018-11-14 17:08:44,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:44,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:44,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:44,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:44,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:44,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {215#true} call ULTIMATE.init(); {215#true} is VALID [2018-11-14 17:08:44,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {215#true} is VALID [2018-11-14 17:08:44,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:08:44,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {215#true} {215#true} #69#return; {215#true} is VALID [2018-11-14 17:08:44,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {215#true} call #t~ret13 := main(); {215#true} is VALID [2018-11-14 17:08:44,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {215#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {217#(= main_~i~1 0)} is VALID [2018-11-14 17:08:44,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~i~1 0)} assume true; {217#(= main_~i~1 0)} is VALID [2018-11-14 17:08:44,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(= main_~i~1 0)} assume !(~i~1 < 1000); {216#false} is VALID [2018-11-14 17:08:44,851 INFO L256 TraceCheckUtils]: 8: Hoare triple {216#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:08:44,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 17:08:44,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:08:44,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {215#true} assume !(~i~0 < 1000); {215#true} is VALID [2018-11-14 17:08:44,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 17:08:44,853 INFO L273 TraceCheckUtils]: 13: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:08:44,854 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {215#true} {216#false} #73#return; {216#false} is VALID [2018-11-14 17:08:44,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {216#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {216#false} is VALID [2018-11-14 17:08:44,854 INFO L256 TraceCheckUtils]: 16: Hoare triple {216#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:08:44,854 INFO L273 TraceCheckUtils]: 17: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 17:08:44,855 INFO L273 TraceCheckUtils]: 18: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:08:44,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {215#true} assume !(~i~0 < 1000); {215#true} is VALID [2018-11-14 17:08:44,855 INFO L273 TraceCheckUtils]: 20: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 17:08:44,856 INFO L273 TraceCheckUtils]: 21: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:08:44,856 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {215#true} {216#false} #75#return; {216#false} is VALID [2018-11-14 17:08:44,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {216#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {216#false} is VALID [2018-11-14 17:08:44,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {216#false} assume true; {216#false} is VALID [2018-11-14 17:08:44,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {216#false} assume !(~i~2 < 999); {216#false} is VALID [2018-11-14 17:08:44,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {216#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {216#false} is VALID [2018-11-14 17:08:44,858 INFO L256 TraceCheckUtils]: 27: Hoare triple {216#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {215#true} is VALID [2018-11-14 17:08:44,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {215#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {215#true} is VALID [2018-11-14 17:08:44,858 INFO L273 TraceCheckUtils]: 29: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:08:44,859 INFO L273 TraceCheckUtils]: 30: Hoare triple {215#true} assume !(~i~0 < 1000); {215#true} is VALID [2018-11-14 17:08:44,859 INFO L273 TraceCheckUtils]: 31: Hoare triple {215#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {215#true} is VALID [2018-11-14 17:08:44,859 INFO L273 TraceCheckUtils]: 32: Hoare triple {215#true} assume true; {215#true} is VALID [2018-11-14 17:08:44,859 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {215#true} {216#false} #77#return; {216#false} is VALID [2018-11-14 17:08:44,860 INFO L273 TraceCheckUtils]: 34: Hoare triple {216#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {216#false} is VALID [2018-11-14 17:08:44,860 INFO L273 TraceCheckUtils]: 35: Hoare triple {216#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {216#false} is VALID [2018-11-14 17:08:44,860 INFO L273 TraceCheckUtils]: 36: Hoare triple {216#false} assume !false; {216#false} is VALID [2018-11-14 17:08:44,863 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:08:44,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:08:44,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:08:44,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:08:44,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:44,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:08:45,014 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:45,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:08:45,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:08:45,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:08:45,016 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-14 17:08:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:45,368 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-14 17:08:45,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:08:45,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-11-14 17:08:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:45,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:08:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:08:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:08:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-14 17:08:45,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-14 17:08:45,654 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-14 17:08:45,657 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:08:45,657 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:08:45,658 INFO L604 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-14 17:08:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:08:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 17:08:45,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:45,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 17:08:45,683 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 17:08:45,684 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 17:08:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:45,688 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:08:45,689 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:08:45,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:45,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:45,690 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 17:08:45,690 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 17:08:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:45,694 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-14 17:08:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-14 17:08:45,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:45,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:45,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:45,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:08:45,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-14 17:08:45,698 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 37 [2018-11-14 17:08:45,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:45,699 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-14 17:08:45,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:08:45,699 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-14 17:08:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:08:45,701 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:45,701 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:08:45,701 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:45,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:45,702 INFO L82 PathProgramCache]: Analyzing trace with hash -600213610, now seen corresponding path program 1 times [2018-11-14 17:08:45,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:45,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:45,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:45,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:45,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:45,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:08:45,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 17:08:45,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:45,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:08:45,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 17:08:45,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {397#true} is VALID [2018-11-14 17:08:45,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:45,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {397#true} is VALID [2018-11-14 17:08:45,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {397#true} is VALID [2018-11-14 17:08:45,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:45,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 1000); {397#true} is VALID [2018-11-14 17:08:45,829 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:08:45,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {399#(= xor_~i~0 1)} is VALID [2018-11-14 17:08:45,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {399#(= xor_~i~0 1)} assume true; {399#(= xor_~i~0 1)} is VALID [2018-11-14 17:08:45,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {399#(= xor_~i~0 1)} assume !(~i~0 < 1000); {398#false} is VALID [2018-11-14 17:08:45,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:08:45,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:08:45,843 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:08:45,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 17:08:45,844 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:08:45,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {397#true} is VALID [2018-11-14 17:08:45,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:45,845 INFO L273 TraceCheckUtils]: 22: Hoare triple {397#true} assume !(~i~0 < 1000); {397#true} is VALID [2018-11-14 17:08:45,845 INFO L273 TraceCheckUtils]: 23: Hoare triple {397#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 17:08:45,846 INFO L273 TraceCheckUtils]: 24: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:45,846 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {397#true} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:08:45,846 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {398#false} is VALID [2018-11-14 17:08:45,847 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:08:45,847 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 999); {398#false} is VALID [2018-11-14 17:08:45,847 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {398#false} is VALID [2018-11-14 17:08:45,848 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:08:45,848 INFO L273 TraceCheckUtils]: 31: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {397#true} is VALID [2018-11-14 17:08:45,848 INFO L273 TraceCheckUtils]: 32: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:45,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {397#true} assume !(~i~0 < 1000); {397#true} is VALID [2018-11-14 17:08:45,849 INFO L273 TraceCheckUtils]: 34: Hoare triple {397#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {397#true} is VALID [2018-11-14 17:08:45,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:45,849 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {397#true} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:08:45,850 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {398#false} is VALID [2018-11-14 17:08:45,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 17:08:45,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:08:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:08:45,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:45,853 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-14 17:08:45,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:45,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:46,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {397#true} is VALID [2018-11-14 17:08:46,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {397#true} is VALID [2018-11-14 17:08:46,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:46,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #69#return; {397#true} is VALID [2018-11-14 17:08:46,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2018-11-14 17:08:46,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {397#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {397#true} is VALID [2018-11-14 17:08:46,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:46,086 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {397#true} is VALID [2018-11-14 17:08:46,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {397#true} is VALID [2018-11-14 17:08:46,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#true} assume true; {397#true} is VALID [2018-11-14 17:08:46,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#true} assume !(~i~1 < 1000); {397#true} is VALID [2018-11-14 17:08:46,088 INFO L256 TraceCheckUtils]: 11: Hoare triple {397#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {397#true} is VALID [2018-11-14 17:08:46,102 INFO L273 TraceCheckUtils]: 12: Hoare triple {397#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {439#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:46,107 INFO L273 TraceCheckUtils]: 13: Hoare triple {439#(<= xor_~i~0 1)} assume true; {439#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:46,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {439#(<= xor_~i~0 1)} assume !(~i~0 < 1000); {398#false} is VALID [2018-11-14 17:08:46,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:08:46,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:08:46,111 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {398#false} {397#true} #73#return; {398#false} is VALID [2018-11-14 17:08:46,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {398#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {398#false} is VALID [2018-11-14 17:08:46,111 INFO L256 TraceCheckUtils]: 19: Hoare triple {398#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 17:08:46,112 INFO L273 TraceCheckUtils]: 20: Hoare triple {398#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#false} is VALID [2018-11-14 17:08:46,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:08:46,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {398#false} assume !(~i~0 < 1000); {398#false} is VALID [2018-11-14 17:08:46,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:08:46,113 INFO L273 TraceCheckUtils]: 24: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:08:46,113 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {398#false} {398#false} #75#return; {398#false} is VALID [2018-11-14 17:08:46,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {398#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {398#false} is VALID [2018-11-14 17:08:46,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:08:46,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {398#false} assume !(~i~2 < 999); {398#false} is VALID [2018-11-14 17:08:46,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {398#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {398#false} is VALID [2018-11-14 17:08:46,114 INFO L256 TraceCheckUtils]: 30: Hoare triple {398#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {398#false} is VALID [2018-11-14 17:08:46,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {398#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {398#false} is VALID [2018-11-14 17:08:46,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:08:46,115 INFO L273 TraceCheckUtils]: 33: Hoare triple {398#false} assume !(~i~0 < 1000); {398#false} is VALID [2018-11-14 17:08:46,116 INFO L273 TraceCheckUtils]: 34: Hoare triple {398#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {398#false} is VALID [2018-11-14 17:08:46,116 INFO L273 TraceCheckUtils]: 35: Hoare triple {398#false} assume true; {398#false} is VALID [2018-11-14 17:08:46,116 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {398#false} {398#false} #77#return; {398#false} is VALID [2018-11-14 17:08:46,117 INFO L273 TraceCheckUtils]: 37: Hoare triple {398#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {398#false} is VALID [2018-11-14 17:08:46,117 INFO L273 TraceCheckUtils]: 38: Hoare triple {398#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {398#false} is VALID [2018-11-14 17:08:46,117 INFO L273 TraceCheckUtils]: 39: Hoare triple {398#false} assume !false; {398#false} is VALID [2018-11-14 17:08:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 17:08:46,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:08:46,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2018-11-14 17:08:46,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:08:46,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:46,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:08:46,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:46,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:08:46,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:08:46,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:08:46,569 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2018-11-14 17:08:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:46,775 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-11-14 17:08:46,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:08:46,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-11-14 17:08:46,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:08:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:08:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:08:46,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:08:46,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 17:08:46,915 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-14 17:08:46,918 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:08:46,918 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 17:08:46,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 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-14 17:08:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 17:08:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-14 17:08:46,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:46,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-14 17:08:46,932 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-14 17:08:46,933 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-14 17:08:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:46,936 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:08:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:08:46,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:46,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:46,937 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-14 17:08:46,937 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-14 17:08:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:46,940 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-14 17:08:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-14 17:08:46,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:46,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:46,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:46,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:08:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-14 17:08:46,944 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 40 [2018-11-14 17:08:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:46,944 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-14 17:08:46,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:08:46,945 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 17:08:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 17:08:46,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:46,947 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:08:46,947 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:46,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1851573025, now seen corresponding path program 1 times [2018-11-14 17:08:46,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:46,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:46,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:46,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:46,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:47,061 INFO L256 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2018-11-14 17:08:47,062 INFO L273 TraceCheckUtils]: 1: Hoare triple {705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {705#true} is VALID [2018-11-14 17:08:47,062 INFO L273 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,062 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #69#return; {705#true} is VALID [2018-11-14 17:08:47,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret13 := main(); {705#true} is VALID [2018-11-14 17:08:47,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {705#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {705#true} is VALID [2018-11-14 17:08:47,063 INFO L273 TraceCheckUtils]: 6: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {705#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {705#true} is VALID [2018-11-14 17:08:47,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {705#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {705#true} is VALID [2018-11-14 17:08:47,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {705#true} assume !(~i~1 < 1000); {705#true} is VALID [2018-11-14 17:08:47,065 INFO L256 TraceCheckUtils]: 11: Hoare triple {705#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:08:47,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 17:08:47,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {705#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 17:08:47,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 17:08:47,067 INFO L273 TraceCheckUtils]: 16: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {705#true} assume !(~i~0 < 1000); {705#true} is VALID [2018-11-14 17:08:47,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 17:08:47,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,068 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {705#true} {705#true} #73#return; {705#true} is VALID [2018-11-14 17:08:47,068 INFO L273 TraceCheckUtils]: 21: Hoare triple {705#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {705#true} is VALID [2018-11-14 17:08:47,068 INFO L256 TraceCheckUtils]: 22: Hoare triple {705#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:08:47,069 INFO L273 TraceCheckUtils]: 23: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 17:08:47,069 INFO L273 TraceCheckUtils]: 24: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,069 INFO L273 TraceCheckUtils]: 25: Hoare triple {705#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 17:08:47,070 INFO L273 TraceCheckUtils]: 26: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 17:08:47,070 INFO L273 TraceCheckUtils]: 27: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,070 INFO L273 TraceCheckUtils]: 28: Hoare triple {705#true} assume !(~i~0 < 1000); {705#true} is VALID [2018-11-14 17:08:47,070 INFO L273 TraceCheckUtils]: 29: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 17:08:47,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,071 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {705#true} {705#true} #75#return; {705#true} is VALID [2018-11-14 17:08:47,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {705#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {707#(= main_~i~2 0)} is VALID [2018-11-14 17:08:47,075 INFO L273 TraceCheckUtils]: 33: Hoare triple {707#(= main_~i~2 0)} assume true; {707#(= main_~i~2 0)} is VALID [2018-11-14 17:08:47,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {707#(= main_~i~2 0)} assume !(~i~2 < 999); {706#false} is VALID [2018-11-14 17:08:47,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {706#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {706#false} is VALID [2018-11-14 17:08:47,076 INFO L256 TraceCheckUtils]: 36: Hoare triple {706#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {705#true} is VALID [2018-11-14 17:08:47,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {705#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {705#true} is VALID [2018-11-14 17:08:47,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,077 INFO L273 TraceCheckUtils]: 39: Hoare triple {705#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {705#true} is VALID [2018-11-14 17:08:47,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {705#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {705#true} is VALID [2018-11-14 17:08:47,077 INFO L273 TraceCheckUtils]: 41: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,078 INFO L273 TraceCheckUtils]: 42: Hoare triple {705#true} assume !(~i~0 < 1000); {705#true} is VALID [2018-11-14 17:08:47,078 INFO L273 TraceCheckUtils]: 43: Hoare triple {705#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {705#true} is VALID [2018-11-14 17:08:47,078 INFO L273 TraceCheckUtils]: 44: Hoare triple {705#true} assume true; {705#true} is VALID [2018-11-14 17:08:47,078 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {705#true} {706#false} #77#return; {706#false} is VALID [2018-11-14 17:08:47,079 INFO L273 TraceCheckUtils]: 46: Hoare triple {706#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {706#false} is VALID [2018-11-14 17:08:47,079 INFO L273 TraceCheckUtils]: 47: Hoare triple {706#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {706#false} is VALID [2018-11-14 17:08:47,079 INFO L273 TraceCheckUtils]: 48: Hoare triple {706#false} assume !false; {706#false} is VALID [2018-11-14 17:08:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:08:47,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:08:47,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:08:47,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:08:47,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:47,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:08:47,154 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:47,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:08:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:08:47,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:08:47,155 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-14 17:08:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:47,243 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-14 17:08:47,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:08:47,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-14 17:08:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:08:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:08:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:08:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-14 17:08:47,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-14 17:08:47,370 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:47,372 INFO L225 Difference]: With dead ends: 51 [2018-11-14 17:08:47,372 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:08:47,373 INFO L604 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-14 17:08:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:08:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-14 17:08:47,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:47,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-14 17:08:47,385 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-14 17:08:47,385 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-14 17:08:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:47,387 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:08:47,388 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:08:47,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:47,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:47,389 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-14 17:08:47,389 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-14 17:08:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:47,392 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-14 17:08:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-14 17:08:47,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:47,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:47,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:47,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:08:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-14 17:08:47,396 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 49 [2018-11-14 17:08:47,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:47,396 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-14 17:08:47,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:08:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-14 17:08:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-14 17:08:47,398 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:47,398 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:08:47,399 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:47,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:47,399 INFO L82 PathProgramCache]: Analyzing trace with hash -476474227, now seen corresponding path program 1 times [2018-11-14 17:08:47,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:47,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:47,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:47,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:47,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:08:47,512 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 17:08:47,512 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:08:47,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 17:08:47,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {902#(= main_~i~1 0)} is VALID [2018-11-14 17:08:47,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {902#(= main_~i~1 0)} assume true; {902#(= main_~i~1 0)} is VALID [2018-11-14 17:08:47,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {902#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {902#(= main_~i~1 0)} is VALID [2018-11-14 17:08:47,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:47,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:47,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 1000); {901#false} is VALID [2018-11-14 17:08:47,522 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:08:47,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 17:08:47,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {900#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 17:08:47,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 17:08:47,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,524 INFO L273 TraceCheckUtils]: 17: Hoare triple {900#true} assume !(~i~0 < 1000); {900#true} is VALID [2018-11-14 17:08:47,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 17:08:47,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,527 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {900#true} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:08:47,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 17:08:47,527 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:08:47,528 INFO L273 TraceCheckUtils]: 23: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 17:08:47,528 INFO L273 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,528 INFO L273 TraceCheckUtils]: 25: Hoare triple {900#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 17:08:47,528 INFO L273 TraceCheckUtils]: 26: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 17:08:47,529 INFO L273 TraceCheckUtils]: 27: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,529 INFO L273 TraceCheckUtils]: 28: Hoare triple {900#true} assume !(~i~0 < 1000); {900#true} is VALID [2018-11-14 17:08:47,529 INFO L273 TraceCheckUtils]: 29: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 17:08:47,529 INFO L273 TraceCheckUtils]: 30: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,529 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {900#true} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:08:47,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {901#false} is VALID [2018-11-14 17:08:47,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,530 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {901#false} is VALID [2018-11-14 17:08:47,531 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {901#false} is VALID [2018-11-14 17:08:47,531 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,531 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 999); {901#false} is VALID [2018-11-14 17:08:47,531 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {901#false} is VALID [2018-11-14 17:08:47,531 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {900#true} is VALID [2018-11-14 17:08:47,532 INFO L273 TraceCheckUtils]: 40: Hoare triple {900#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {900#true} is VALID [2018-11-14 17:08:47,532 INFO L273 TraceCheckUtils]: 41: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,532 INFO L273 TraceCheckUtils]: 42: Hoare triple {900#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {900#true} is VALID [2018-11-14 17:08:47,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {900#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {900#true} is VALID [2018-11-14 17:08:47,533 INFO L273 TraceCheckUtils]: 44: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,533 INFO L273 TraceCheckUtils]: 45: Hoare triple {900#true} assume !(~i~0 < 1000); {900#true} is VALID [2018-11-14 17:08:47,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {900#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {900#true} is VALID [2018-11-14 17:08:47,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,533 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {900#true} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:08:47,534 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {901#false} is VALID [2018-11-14 17:08:47,534 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 17:08:47,534 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:08:47,538 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:08:47,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:47,538 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-14 17:08:47,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:47,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:47,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2018-11-14 17:08:47,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {900#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {900#true} is VALID [2018-11-14 17:08:47,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2018-11-14 17:08:47,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #69#return; {900#true} is VALID [2018-11-14 17:08:47,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret13 := main(); {900#true} is VALID [2018-11-14 17:08:47,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {900#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {922#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:47,983 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#(<= main_~i~1 0)} assume true; {922#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:47,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {922#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {922#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:47,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {922#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:47,985 INFO L273 TraceCheckUtils]: 9: Hoare triple {903#(<= main_~i~1 1)} assume true; {903#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:47,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {903#(<= main_~i~1 1)} assume !(~i~1 < 1000); {901#false} is VALID [2018-11-14 17:08:47,986 INFO L256 TraceCheckUtils]: 11: Hoare triple {901#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:08:47,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {901#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 17:08:47,987 INFO L273 TraceCheckUtils]: 13: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,987 INFO L273 TraceCheckUtils]: 14: Hoare triple {901#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 17:08:47,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 17:08:47,988 INFO L273 TraceCheckUtils]: 16: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {901#false} assume !(~i~0 < 1000); {901#false} is VALID [2018-11-14 17:08:47,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 17:08:47,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,989 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {901#false} {901#false} #73#return; {901#false} is VALID [2018-11-14 17:08:47,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {901#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {901#false} is VALID [2018-11-14 17:08:47,989 INFO L256 TraceCheckUtils]: 22: Hoare triple {901#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:08:47,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {901#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 17:08:47,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {901#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 17:08:47,991 INFO L273 TraceCheckUtils]: 26: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 17:08:47,991 INFO L273 TraceCheckUtils]: 27: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,991 INFO L273 TraceCheckUtils]: 28: Hoare triple {901#false} assume !(~i~0 < 1000); {901#false} is VALID [2018-11-14 17:08:47,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 17:08:47,991 INFO L273 TraceCheckUtils]: 30: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,992 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {901#false} {901#false} #75#return; {901#false} is VALID [2018-11-14 17:08:47,992 INFO L273 TraceCheckUtils]: 32: Hoare triple {901#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {901#false} is VALID [2018-11-14 17:08:47,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,992 INFO L273 TraceCheckUtils]: 34: Hoare triple {901#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {901#false} is VALID [2018-11-14 17:08:47,993 INFO L273 TraceCheckUtils]: 35: Hoare triple {901#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {901#false} is VALID [2018-11-14 17:08:47,993 INFO L273 TraceCheckUtils]: 36: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,993 INFO L273 TraceCheckUtils]: 37: Hoare triple {901#false} assume !(~i~2 < 999); {901#false} is VALID [2018-11-14 17:08:47,993 INFO L273 TraceCheckUtils]: 38: Hoare triple {901#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {901#false} is VALID [2018-11-14 17:08:47,994 INFO L256 TraceCheckUtils]: 39: Hoare triple {901#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {901#false} is VALID [2018-11-14 17:08:47,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {901#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {901#false} is VALID [2018-11-14 17:08:47,994 INFO L273 TraceCheckUtils]: 41: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {901#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {901#false} is VALID [2018-11-14 17:08:47,995 INFO L273 TraceCheckUtils]: 43: Hoare triple {901#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {901#false} is VALID [2018-11-14 17:08:47,995 INFO L273 TraceCheckUtils]: 44: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,995 INFO L273 TraceCheckUtils]: 45: Hoare triple {901#false} assume !(~i~0 < 1000); {901#false} is VALID [2018-11-14 17:08:47,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {901#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {901#false} is VALID [2018-11-14 17:08:47,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {901#false} assume true; {901#false} is VALID [2018-11-14 17:08:47,996 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {901#false} {901#false} #77#return; {901#false} is VALID [2018-11-14 17:08:47,996 INFO L273 TraceCheckUtils]: 49: Hoare triple {901#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {901#false} is VALID [2018-11-14 17:08:47,996 INFO L273 TraceCheckUtils]: 50: Hoare triple {901#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {901#false} is VALID [2018-11-14 17:08:47,997 INFO L273 TraceCheckUtils]: 51: Hoare triple {901#false} assume !false; {901#false} is VALID [2018-11-14 17:08:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:08:48,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:48,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 17:08:48,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:08:48,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:48,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:08:48,101 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-14 17:08:48,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:08:48,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:08:48,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:08:48,102 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 5 states. [2018-11-14 17:08:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:48,305 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2018-11-14 17:08:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:08:48,305 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-11-14 17:08:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:08:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:08:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:08:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-14 17:08:48,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-14 17:08:48,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:48,516 INFO L225 Difference]: With dead ends: 63 [2018-11-14 17:08:48,516 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:08:48,517 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-14 17:08:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:08:48,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-14 17:08:48,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:48,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 38 states. [2018-11-14 17:08:48,531 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 38 states. [2018-11-14 17:08:48,531 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 38 states. [2018-11-14 17:08:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:48,534 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:08:48,534 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:08:48,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:48,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:48,535 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 39 states. [2018-11-14 17:08:48,536 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 39 states. [2018-11-14 17:08:48,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:48,538 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-14 17:08:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-14 17:08:48,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:48,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:48,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:48,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 17:08:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-14 17:08:48,542 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 52 [2018-11-14 17:08:48,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:48,543 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-14 17:08:48,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:08:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-14 17:08:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:08:48,544 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:48,545 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 2, 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-14 17:08:48,545 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:48,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:48,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1438119929, now seen corresponding path program 2 times [2018-11-14 17:08:48,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:48,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:48,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:48,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:48,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:48,722 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:08:48,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 17:08:48,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:08:48,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 17:08:48,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1279#(= main_~i~1 0)} is VALID [2018-11-14 17:08:48,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {1279#(= main_~i~1 0)} assume true; {1279#(= main_~i~1 0)} is VALID [2018-11-14 17:08:48,728 INFO L273 TraceCheckUtils]: 7: Hoare triple {1279#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1279#(= main_~i~1 0)} is VALID [2018-11-14 17:08:48,728 INFO L273 TraceCheckUtils]: 8: Hoare triple {1279#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:48,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:48,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:48,742 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:48,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:48,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 1000); {1278#false} is VALID [2018-11-14 17:08:48,744 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:08:48,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 17:08:48,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {1277#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 17:08:48,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 17:08:48,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {1277#true} assume !(~i~0 < 1000); {1277#true} is VALID [2018-11-14 17:08:48,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 17:08:48,746 INFO L273 TraceCheckUtils]: 22: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,746 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1277#true} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:08:48,747 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 17:08:48,747 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:08:48,747 INFO L273 TraceCheckUtils]: 26: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 17:08:48,748 INFO L273 TraceCheckUtils]: 27: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,748 INFO L273 TraceCheckUtils]: 28: Hoare triple {1277#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 17:08:48,748 INFO L273 TraceCheckUtils]: 29: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 17:08:48,748 INFO L273 TraceCheckUtils]: 30: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,748 INFO L273 TraceCheckUtils]: 31: Hoare triple {1277#true} assume !(~i~0 < 1000); {1277#true} is VALID [2018-11-14 17:08:48,749 INFO L273 TraceCheckUtils]: 32: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 17:08:48,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,749 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1277#true} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:08:48,749 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1278#false} is VALID [2018-11-14 17:08:48,749 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,750 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1278#false} is VALID [2018-11-14 17:08:48,750 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1278#false} is VALID [2018-11-14 17:08:48,750 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,750 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 999); {1278#false} is VALID [2018-11-14 17:08:48,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {1278#false} is VALID [2018-11-14 17:08:48,750 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1277#true} is VALID [2018-11-14 17:08:48,751 INFO L273 TraceCheckUtils]: 43: Hoare triple {1277#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1277#true} is VALID [2018-11-14 17:08:48,751 INFO L273 TraceCheckUtils]: 44: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,751 INFO L273 TraceCheckUtils]: 45: Hoare triple {1277#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1277#true} is VALID [2018-11-14 17:08:48,751 INFO L273 TraceCheckUtils]: 46: Hoare triple {1277#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1277#true} is VALID [2018-11-14 17:08:48,751 INFO L273 TraceCheckUtils]: 47: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,752 INFO L273 TraceCheckUtils]: 48: Hoare triple {1277#true} assume !(~i~0 < 1000); {1277#true} is VALID [2018-11-14 17:08:48,752 INFO L273 TraceCheckUtils]: 49: Hoare triple {1277#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1277#true} is VALID [2018-11-14 17:08:48,752 INFO L273 TraceCheckUtils]: 50: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,752 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1277#true} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:08:48,752 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1278#false} is VALID [2018-11-14 17:08:48,752 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 17:08:48,753 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:08:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:08:48,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:48,756 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-14 17:08:48,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:08:48,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:08:48,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:48,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:48,953 INFO L256 TraceCheckUtils]: 0: Hoare triple {1277#true} call ULTIMATE.init(); {1277#true} is VALID [2018-11-14 17:08:48,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {1277#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1277#true} is VALID [2018-11-14 17:08:48,954 INFO L273 TraceCheckUtils]: 2: Hoare triple {1277#true} assume true; {1277#true} is VALID [2018-11-14 17:08:48,954 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1277#true} {1277#true} #69#return; {1277#true} is VALID [2018-11-14 17:08:48,955 INFO L256 TraceCheckUtils]: 4: Hoare triple {1277#true} call #t~ret13 := main(); {1277#true} is VALID [2018-11-14 17:08:48,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {1277#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:48,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {1300#(<= main_~i~1 0)} assume true; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:48,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {1300#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1300#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:48,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {1300#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:48,965 INFO L273 TraceCheckUtils]: 9: Hoare triple {1280#(<= main_~i~1 1)} assume true; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:48,965 INFO L273 TraceCheckUtils]: 10: Hoare triple {1280#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1280#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:48,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {1280#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:48,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {1281#(<= main_~i~1 2)} assume true; {1281#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:48,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {1281#(<= main_~i~1 2)} assume !(~i~1 < 1000); {1278#false} is VALID [2018-11-14 17:08:48,967 INFO L256 TraceCheckUtils]: 14: Hoare triple {1278#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:08:48,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {1278#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 17:08:48,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {1278#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 17:08:48,968 INFO L273 TraceCheckUtils]: 18: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 17:08:48,968 INFO L273 TraceCheckUtils]: 19: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,969 INFO L273 TraceCheckUtils]: 20: Hoare triple {1278#false} assume !(~i~0 < 1000); {1278#false} is VALID [2018-11-14 17:08:48,969 INFO L273 TraceCheckUtils]: 21: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 17:08:48,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,970 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1278#false} {1278#false} #73#return; {1278#false} is VALID [2018-11-14 17:08:48,970 INFO L273 TraceCheckUtils]: 24: Hoare triple {1278#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1278#false} is VALID [2018-11-14 17:08:48,971 INFO L256 TraceCheckUtils]: 25: Hoare triple {1278#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:08:48,971 INFO L273 TraceCheckUtils]: 26: Hoare triple {1278#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 17:08:48,971 INFO L273 TraceCheckUtils]: 27: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,972 INFO L273 TraceCheckUtils]: 28: Hoare triple {1278#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 17:08:48,972 INFO L273 TraceCheckUtils]: 29: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 17:08:48,972 INFO L273 TraceCheckUtils]: 30: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,973 INFO L273 TraceCheckUtils]: 31: Hoare triple {1278#false} assume !(~i~0 < 1000); {1278#false} is VALID [2018-11-14 17:08:48,973 INFO L273 TraceCheckUtils]: 32: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 17:08:48,973 INFO L273 TraceCheckUtils]: 33: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,973 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1278#false} {1278#false} #75#return; {1278#false} is VALID [2018-11-14 17:08:48,974 INFO L273 TraceCheckUtils]: 35: Hoare triple {1278#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1278#false} is VALID [2018-11-14 17:08:48,974 INFO L273 TraceCheckUtils]: 36: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,974 INFO L273 TraceCheckUtils]: 37: Hoare triple {1278#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1278#false} is VALID [2018-11-14 17:08:48,974 INFO L273 TraceCheckUtils]: 38: Hoare triple {1278#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1278#false} is VALID [2018-11-14 17:08:48,975 INFO L273 TraceCheckUtils]: 39: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,975 INFO L273 TraceCheckUtils]: 40: Hoare triple {1278#false} assume !(~i~2 < 999); {1278#false} is VALID [2018-11-14 17:08:48,975 INFO L273 TraceCheckUtils]: 41: Hoare triple {1278#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {1278#false} is VALID [2018-11-14 17:08:48,975 INFO L256 TraceCheckUtils]: 42: Hoare triple {1278#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1278#false} is VALID [2018-11-14 17:08:48,976 INFO L273 TraceCheckUtils]: 43: Hoare triple {1278#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1278#false} is VALID [2018-11-14 17:08:48,976 INFO L273 TraceCheckUtils]: 44: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,976 INFO L273 TraceCheckUtils]: 45: Hoare triple {1278#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1278#false} is VALID [2018-11-14 17:08:48,976 INFO L273 TraceCheckUtils]: 46: Hoare triple {1278#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1278#false} is VALID [2018-11-14 17:08:48,976 INFO L273 TraceCheckUtils]: 47: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,977 INFO L273 TraceCheckUtils]: 48: Hoare triple {1278#false} assume !(~i~0 < 1000); {1278#false} is VALID [2018-11-14 17:08:48,977 INFO L273 TraceCheckUtils]: 49: Hoare triple {1278#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1278#false} is VALID [2018-11-14 17:08:48,977 INFO L273 TraceCheckUtils]: 50: Hoare triple {1278#false} assume true; {1278#false} is VALID [2018-11-14 17:08:48,977 INFO L268 TraceCheckUtils]: 51: Hoare quadruple {1278#false} {1278#false} #77#return; {1278#false} is VALID [2018-11-14 17:08:48,978 INFO L273 TraceCheckUtils]: 52: Hoare triple {1278#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1278#false} is VALID [2018-11-14 17:08:48,978 INFO L273 TraceCheckUtils]: 53: Hoare triple {1278#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1278#false} is VALID [2018-11-14 17:08:48,978 INFO L273 TraceCheckUtils]: 54: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2018-11-14 17:08:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:08:49,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:49,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 17:08:49,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:08:49,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:49,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:08:49,059 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-14 17:08:49,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:08:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:08:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:08:49,061 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 6 states. [2018-11-14 17:08:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:49,206 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-14 17:08:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:08:49,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-11-14 17:08:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:08:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:08:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:08:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2018-11-14 17:08:49,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2018-11-14 17:08:49,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:49,381 INFO L225 Difference]: With dead ends: 66 [2018-11-14 17:08:49,381 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:08:49,382 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 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-14 17:08:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:08:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-14 17:08:49,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:49,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-14 17:08:49,401 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-14 17:08:49,401 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-14 17:08:49,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:49,404 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:08:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:08:49,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:49,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:49,405 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-14 17:08:49,405 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-14 17:08:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:49,408 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:08:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:08:49,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:49,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:49,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:49,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:08:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-14 17:08:49,412 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 55 [2018-11-14 17:08:49,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:49,412 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-14 17:08:49,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:08:49,412 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-14 17:08:49,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:08:49,413 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:49,413 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:08:49,414 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:49,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:49,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1901603405, now seen corresponding path program 3 times [2018-11-14 17:08:49,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:49,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:49,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:49,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:49,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:49,536 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:08:49,536 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 17:08:49,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:08:49,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 17:08:49,538 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1680#(= main_~i~1 0)} is VALID [2018-11-14 17:08:49,538 INFO L273 TraceCheckUtils]: 6: Hoare triple {1680#(= main_~i~1 0)} assume true; {1680#(= main_~i~1 0)} is VALID [2018-11-14 17:08:49,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {1680#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1680#(= main_~i~1 0)} is VALID [2018-11-14 17:08:49,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {1680#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:49,540 INFO L273 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~i~1 1)} assume true; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:49,540 INFO L273 TraceCheckUtils]: 10: Hoare triple {1681#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1681#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:49,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {1681#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:49,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~i~1 2)} assume true; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:49,542 INFO L273 TraceCheckUtils]: 13: Hoare triple {1682#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1682#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:49,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {1682#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:49,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {1683#(<= main_~i~1 3)} assume true; {1683#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:49,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {1683#(<= main_~i~1 3)} assume !(~i~1 < 1000); {1679#false} is VALID [2018-11-14 17:08:49,545 INFO L256 TraceCheckUtils]: 17: Hoare triple {1679#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:08:49,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:08:49,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:08:49,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:08:49,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,547 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 1000); {1678#true} is VALID [2018-11-14 17:08:49,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:08:49,547 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,548 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1679#false} #73#return; {1679#false} is VALID [2018-11-14 17:08:49,548 INFO L273 TraceCheckUtils]: 27: Hoare triple {1679#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1679#false} is VALID [2018-11-14 17:08:49,549 INFO L256 TraceCheckUtils]: 28: Hoare triple {1679#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:08:49,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:08:49,549 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:08:49,550 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:08:49,550 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,550 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 1000); {1678#true} is VALID [2018-11-14 17:08:49,550 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:08:49,551 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,551 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1679#false} #75#return; {1679#false} is VALID [2018-11-14 17:08:49,551 INFO L273 TraceCheckUtils]: 38: Hoare triple {1679#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1679#false} is VALID [2018-11-14 17:08:49,551 INFO L273 TraceCheckUtils]: 39: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:08:49,552 INFO L273 TraceCheckUtils]: 40: Hoare triple {1679#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1679#false} is VALID [2018-11-14 17:08:49,552 INFO L273 TraceCheckUtils]: 41: Hoare triple {1679#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1679#false} is VALID [2018-11-14 17:08:49,552 INFO L273 TraceCheckUtils]: 42: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:08:49,552 INFO L273 TraceCheckUtils]: 43: Hoare triple {1679#false} assume !(~i~2 < 999); {1679#false} is VALID [2018-11-14 17:08:49,552 INFO L273 TraceCheckUtils]: 44: Hoare triple {1679#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {1679#false} is VALID [2018-11-14 17:08:49,553 INFO L256 TraceCheckUtils]: 45: Hoare triple {1679#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:08:49,553 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:08:49,553 INFO L273 TraceCheckUtils]: 47: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,553 INFO L273 TraceCheckUtils]: 48: Hoare triple {1678#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:08:49,554 INFO L273 TraceCheckUtils]: 49: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:08:49,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,554 INFO L273 TraceCheckUtils]: 51: Hoare triple {1678#true} assume !(~i~0 < 1000); {1678#true} is VALID [2018-11-14 17:08:49,554 INFO L273 TraceCheckUtils]: 52: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:08:49,554 INFO L273 TraceCheckUtils]: 53: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:49,555 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1678#true} {1679#false} #77#return; {1679#false} is VALID [2018-11-14 17:08:49,555 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1679#false} is VALID [2018-11-14 17:08:49,555 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 17:08:49,555 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:08:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-14 17:08:49,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:49,559 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-14 17:08:49,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:08:49,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:08:49,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:49,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:50,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {1678#true} call ULTIMATE.init(); {1678#true} is VALID [2018-11-14 17:08:50,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {1678#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1678#true} is VALID [2018-11-14 17:08:50,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1678#true} {1678#true} #69#return; {1678#true} is VALID [2018-11-14 17:08:50,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {1678#true} call #t~ret13 := main(); {1678#true} is VALID [2018-11-14 17:08:50,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {1678#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {1678#true} is VALID [2018-11-14 17:08:50,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,354 INFO L273 TraceCheckUtils]: 7: Hoare triple {1678#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 17:08:50,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 17:08:50,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {1678#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 17:08:50,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 17:08:50,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,356 INFO L273 TraceCheckUtils]: 13: Hoare triple {1678#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {1678#true} is VALID [2018-11-14 17:08:50,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {1678#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {1678#true} is VALID [2018-11-14 17:08:50,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,356 INFO L273 TraceCheckUtils]: 16: Hoare triple {1678#true} assume !(~i~1 < 1000); {1678#true} is VALID [2018-11-14 17:08:50,357 INFO L256 TraceCheckUtils]: 17: Hoare triple {1678#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:08:50,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:08:50,357 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:08:50,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:08:50,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {1678#true} assume !(~i~0 < 1000); {1678#true} is VALID [2018-11-14 17:08:50,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:08:50,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,358 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1678#true} {1678#true} #73#return; {1678#true} is VALID [2018-11-14 17:08:50,358 INFO L273 TraceCheckUtils]: 27: Hoare triple {1678#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {1678#true} is VALID [2018-11-14 17:08:50,358 INFO L256 TraceCheckUtils]: 28: Hoare triple {1678#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:08:50,358 INFO L273 TraceCheckUtils]: 29: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1678#true} is VALID [2018-11-14 17:08:50,358 INFO L273 TraceCheckUtils]: 30: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,359 INFO L273 TraceCheckUtils]: 31: Hoare triple {1678#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1678#true} is VALID [2018-11-14 17:08:50,359 INFO L273 TraceCheckUtils]: 32: Hoare triple {1678#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1678#true} is VALID [2018-11-14 17:08:50,359 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,359 INFO L273 TraceCheckUtils]: 34: Hoare triple {1678#true} assume !(~i~0 < 1000); {1678#true} is VALID [2018-11-14 17:08:50,359 INFO L273 TraceCheckUtils]: 35: Hoare triple {1678#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1678#true} is VALID [2018-11-14 17:08:50,359 INFO L273 TraceCheckUtils]: 36: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,360 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1678#true} {1678#true} #75#return; {1678#true} is VALID [2018-11-14 17:08:50,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {1678#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {1678#true} is VALID [2018-11-14 17:08:50,360 INFO L273 TraceCheckUtils]: 39: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,360 INFO L273 TraceCheckUtils]: 40: Hoare triple {1678#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {1678#true} is VALID [2018-11-14 17:08:50,360 INFO L273 TraceCheckUtils]: 41: Hoare triple {1678#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {1678#true} is VALID [2018-11-14 17:08:50,361 INFO L273 TraceCheckUtils]: 42: Hoare triple {1678#true} assume true; {1678#true} is VALID [2018-11-14 17:08:50,361 INFO L273 TraceCheckUtils]: 43: Hoare triple {1678#true} assume !(~i~2 < 999); {1678#true} is VALID [2018-11-14 17:08:50,361 INFO L273 TraceCheckUtils]: 44: Hoare triple {1678#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {1678#true} is VALID [2018-11-14 17:08:50,361 INFO L256 TraceCheckUtils]: 45: Hoare triple {1678#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {1678#true} is VALID [2018-11-14 17:08:50,379 INFO L273 TraceCheckUtils]: 46: Hoare triple {1678#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {1825#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:50,396 INFO L273 TraceCheckUtils]: 47: Hoare triple {1825#(<= xor_~i~0 1)} assume true; {1825#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:50,405 INFO L273 TraceCheckUtils]: 48: Hoare triple {1825#(<= xor_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {1825#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:50,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {1825#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {1835#(<= xor_~i~0 2)} is VALID [2018-11-14 17:08:50,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {1835#(<= xor_~i~0 2)} assume true; {1835#(<= xor_~i~0 2)} is VALID [2018-11-14 17:08:50,421 INFO L273 TraceCheckUtils]: 51: Hoare triple {1835#(<= xor_~i~0 2)} assume !(~i~0 < 1000); {1679#false} is VALID [2018-11-14 17:08:50,421 INFO L273 TraceCheckUtils]: 52: Hoare triple {1679#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {1679#false} is VALID [2018-11-14 17:08:50,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {1679#false} assume true; {1679#false} is VALID [2018-11-14 17:08:50,422 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {1679#false} {1678#true} #77#return; {1679#false} is VALID [2018-11-14 17:08:50,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {1679#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {1679#false} is VALID [2018-11-14 17:08:50,422 INFO L273 TraceCheckUtils]: 56: Hoare triple {1679#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {1679#false} is VALID [2018-11-14 17:08:50,422 INFO L273 TraceCheckUtils]: 57: Hoare triple {1679#false} assume !false; {1679#false} is VALID [2018-11-14 17:08:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-14 17:08:50,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:50,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-14 17:08:50,447 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:08:50,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:50,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:08:50,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:50,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:08:50,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:08:50,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:08:50,612 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-14 17:08:51,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:51,001 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-11-14 17:08:51,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:08:51,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-14 17:08:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:08:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:08:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:08:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2018-11-14 17:08:51,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2018-11-14 17:08:51,120 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-14 17:08:51,123 INFO L225 Difference]: With dead ends: 73 [2018-11-14 17:08:51,123 INFO L226 Difference]: Without dead ends: 49 [2018-11-14 17:08:51,124 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 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-14 17:08:51,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-14 17:08:51,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-14 17:08:51,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:51,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 47 states. [2018-11-14 17:08:51,151 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 47 states. [2018-11-14 17:08:51,151 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 47 states. [2018-11-14 17:08:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:51,154 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:08:51,154 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:08:51,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:51,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:51,155 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 49 states. [2018-11-14 17:08:51,155 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 49 states. [2018-11-14 17:08:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:51,157 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-14 17:08:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-14 17:08:51,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:51,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:51,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:51,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 17:08:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-14 17:08:51,161 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 58 [2018-11-14 17:08:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:51,161 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-14 17:08:51,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:08:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-14 17:08:51,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 17:08:51,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:51,163 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:08:51,163 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:51,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:51,163 INFO L82 PathProgramCache]: Analyzing trace with hash -922884994, now seen corresponding path program 4 times [2018-11-14 17:08:51,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:51,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:51,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:51,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:51,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:51,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:08:51,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 17:08:51,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:08:51,320 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 17:08:51,321 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2123#(= main_~i~1 0)} is VALID [2018-11-14 17:08:51,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {2123#(= main_~i~1 0)} assume true; {2123#(= main_~i~1 0)} is VALID [2018-11-14 17:08:51,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {2123#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2123#(= main_~i~1 0)} is VALID [2018-11-14 17:08:51,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {2123#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:51,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:51,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:51,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:51,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:51,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:51,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {2125#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:51,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:51,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:51,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:51,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:51,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 1000); {2122#false} is VALID [2018-11-14 17:08:51,328 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:08:51,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 17:08:51,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {2121#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:08:51,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:08:51,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,330 INFO L273 TraceCheckUtils]: 26: Hoare triple {2121#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:08:51,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:08:51,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,331 INFO L273 TraceCheckUtils]: 29: Hoare triple {2121#true} assume !(~i~0 < 1000); {2121#true} is VALID [2018-11-14 17:08:51,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 17:08:51,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,331 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2121#true} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 17:08:51,331 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 17:08:51,332 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:08:51,332 INFO L273 TraceCheckUtils]: 35: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 17:08:51,332 INFO L273 TraceCheckUtils]: 36: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,332 INFO L273 TraceCheckUtils]: 37: Hoare triple {2121#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:08:51,332 INFO L273 TraceCheckUtils]: 38: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:08:51,332 INFO L273 TraceCheckUtils]: 39: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,333 INFO L273 TraceCheckUtils]: 40: Hoare triple {2121#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:08:51,333 INFO L273 TraceCheckUtils]: 41: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:08:51,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,333 INFO L273 TraceCheckUtils]: 43: Hoare triple {2121#true} assume !(~i~0 < 1000); {2121#true} is VALID [2018-11-14 17:08:51,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 17:08:51,334 INFO L273 TraceCheckUtils]: 45: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,334 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2121#true} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:08:51,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2122#false} is VALID [2018-11-14 17:08:51,334 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,335 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2122#false} is VALID [2018-11-14 17:08:51,335 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2122#false} is VALID [2018-11-14 17:08:51,335 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,335 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 999); {2122#false} is VALID [2018-11-14 17:08:51,336 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {2122#false} is VALID [2018-11-14 17:08:51,336 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2121#true} is VALID [2018-11-14 17:08:51,336 INFO L273 TraceCheckUtils]: 55: Hoare triple {2121#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2121#true} is VALID [2018-11-14 17:08:51,336 INFO L273 TraceCheckUtils]: 56: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,336 INFO L273 TraceCheckUtils]: 57: Hoare triple {2121#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:08:51,337 INFO L273 TraceCheckUtils]: 58: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:08:51,337 INFO L273 TraceCheckUtils]: 59: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,337 INFO L273 TraceCheckUtils]: 60: Hoare triple {2121#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2121#true} is VALID [2018-11-14 17:08:51,337 INFO L273 TraceCheckUtils]: 61: Hoare triple {2121#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2121#true} is VALID [2018-11-14 17:08:51,337 INFO L273 TraceCheckUtils]: 62: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,338 INFO L273 TraceCheckUtils]: 63: Hoare triple {2121#true} assume !(~i~0 < 1000); {2121#true} is VALID [2018-11-14 17:08:51,338 INFO L273 TraceCheckUtils]: 64: Hoare triple {2121#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2121#true} is VALID [2018-11-14 17:08:51,338 INFO L273 TraceCheckUtils]: 65: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,338 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2121#true} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:08:51,339 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2122#false} is VALID [2018-11-14 17:08:51,339 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 17:08:51,339 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:08:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 17:08:51,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:51,359 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-14 17:08:51,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:08:51,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:08:51,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:51,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:51,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {2121#true} call ULTIMATE.init(); {2121#true} is VALID [2018-11-14 17:08:51,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {2121#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2121#true} is VALID [2018-11-14 17:08:51,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {2121#true} assume true; {2121#true} is VALID [2018-11-14 17:08:51,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2121#true} {2121#true} #69#return; {2121#true} is VALID [2018-11-14 17:08:51,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {2121#true} call #t~ret13 := main(); {2121#true} is VALID [2018-11-14 17:08:51,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {2121#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:51,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {2146#(<= main_~i~1 0)} assume true; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:51,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {2146#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2146#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:51,658 INFO L273 TraceCheckUtils]: 8: Hoare triple {2146#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:51,659 INFO L273 TraceCheckUtils]: 9: Hoare triple {2124#(<= main_~i~1 1)} assume true; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:51,659 INFO L273 TraceCheckUtils]: 10: Hoare triple {2124#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2124#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:51,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {2124#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:51,661 INFO L273 TraceCheckUtils]: 12: Hoare triple {2125#(<= main_~i~1 2)} assume true; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:51,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {2125#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2125#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:51,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {2125#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:51,665 INFO L273 TraceCheckUtils]: 15: Hoare triple {2126#(<= main_~i~1 3)} assume true; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:51,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {2126#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2126#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:51,667 INFO L273 TraceCheckUtils]: 17: Hoare triple {2126#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:51,667 INFO L273 TraceCheckUtils]: 18: Hoare triple {2127#(<= main_~i~1 4)} assume true; {2127#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:51,669 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(<= main_~i~1 4)} assume !(~i~1 < 1000); {2122#false} is VALID [2018-11-14 17:08:51,669 INFO L256 TraceCheckUtils]: 20: Hoare triple {2122#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:08:51,669 INFO L273 TraceCheckUtils]: 21: Hoare triple {2122#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 17:08:51,669 INFO L273 TraceCheckUtils]: 22: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {2122#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:08:51,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:08:51,669 INFO L273 TraceCheckUtils]: 25: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {2122#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:08:51,670 INFO L273 TraceCheckUtils]: 27: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:08:51,670 INFO L273 TraceCheckUtils]: 28: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {2122#false} assume !(~i~0 < 1000); {2122#false} is VALID [2018-11-14 17:08:51,670 INFO L273 TraceCheckUtils]: 30: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 17:08:51,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,670 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2122#false} {2122#false} #73#return; {2122#false} is VALID [2018-11-14 17:08:51,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {2122#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2122#false} is VALID [2018-11-14 17:08:51,671 INFO L256 TraceCheckUtils]: 34: Hoare triple {2122#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:08:51,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {2122#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 17:08:51,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {2122#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:08:51,671 INFO L273 TraceCheckUtils]: 38: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:08:51,671 INFO L273 TraceCheckUtils]: 39: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {2122#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:08:51,671 INFO L273 TraceCheckUtils]: 41: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:08:51,672 INFO L273 TraceCheckUtils]: 42: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,672 INFO L273 TraceCheckUtils]: 43: Hoare triple {2122#false} assume !(~i~0 < 1000); {2122#false} is VALID [2018-11-14 17:08:51,672 INFO L273 TraceCheckUtils]: 44: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 17:08:51,672 INFO L273 TraceCheckUtils]: 45: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,672 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2122#false} {2122#false} #75#return; {2122#false} is VALID [2018-11-14 17:08:51,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {2122#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2122#false} is VALID [2018-11-14 17:08:51,672 INFO L273 TraceCheckUtils]: 48: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,673 INFO L273 TraceCheckUtils]: 49: Hoare triple {2122#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2122#false} is VALID [2018-11-14 17:08:51,673 INFO L273 TraceCheckUtils]: 50: Hoare triple {2122#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2122#false} is VALID [2018-11-14 17:08:51,673 INFO L273 TraceCheckUtils]: 51: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,673 INFO L273 TraceCheckUtils]: 52: Hoare triple {2122#false} assume !(~i~2 < 999); {2122#false} is VALID [2018-11-14 17:08:51,673 INFO L273 TraceCheckUtils]: 53: Hoare triple {2122#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {2122#false} is VALID [2018-11-14 17:08:51,673 INFO L256 TraceCheckUtils]: 54: Hoare triple {2122#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2122#false} is VALID [2018-11-14 17:08:51,673 INFO L273 TraceCheckUtils]: 55: Hoare triple {2122#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2122#false} is VALID [2018-11-14 17:08:51,673 INFO L273 TraceCheckUtils]: 56: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,674 INFO L273 TraceCheckUtils]: 57: Hoare triple {2122#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:08:51,674 INFO L273 TraceCheckUtils]: 58: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:08:51,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {2122#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2122#false} is VALID [2018-11-14 17:08:51,674 INFO L273 TraceCheckUtils]: 61: Hoare triple {2122#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2122#false} is VALID [2018-11-14 17:08:51,675 INFO L273 TraceCheckUtils]: 62: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,675 INFO L273 TraceCheckUtils]: 63: Hoare triple {2122#false} assume !(~i~0 < 1000); {2122#false} is VALID [2018-11-14 17:08:51,675 INFO L273 TraceCheckUtils]: 64: Hoare triple {2122#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2122#false} is VALID [2018-11-14 17:08:51,675 INFO L273 TraceCheckUtils]: 65: Hoare triple {2122#false} assume true; {2122#false} is VALID [2018-11-14 17:08:51,676 INFO L268 TraceCheckUtils]: 66: Hoare quadruple {2122#false} {2122#false} #77#return; {2122#false} is VALID [2018-11-14 17:08:51,676 INFO L273 TraceCheckUtils]: 67: Hoare triple {2122#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2122#false} is VALID [2018-11-14 17:08:51,676 INFO L273 TraceCheckUtils]: 68: Hoare triple {2122#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2122#false} is VALID [2018-11-14 17:08:51,676 INFO L273 TraceCheckUtils]: 69: Hoare triple {2122#false} assume !false; {2122#false} is VALID [2018-11-14 17:08:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 17:08:51,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:51,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 17:08:51,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 17:08:51,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:51,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:08:51,825 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-14 17:08:51,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:08:51,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:08:51,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:08:51,826 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 8 states. [2018-11-14 17:08:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:52,060 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2018-11-14 17:08:52,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:08:52,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2018-11-14 17:08:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:08:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 17:08:52,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:08:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2018-11-14 17:08:52,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2018-11-14 17:08:52,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:52,293 INFO L225 Difference]: With dead ends: 78 [2018-11-14 17:08:52,294 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:08:52,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:08:52,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:08:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-14 17:08:52,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:52,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2018-11-14 17:08:52,337 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2018-11-14 17:08:52,337 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2018-11-14 17:08:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:52,341 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 17:08:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:08:52,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:52,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:52,342 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2018-11-14 17:08:52,342 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2018-11-14 17:08:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:52,344 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-14 17:08:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-14 17:08:52,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:52,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:52,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:52,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 17:08:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-14 17:08:52,347 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 70 [2018-11-14 17:08:52,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:52,348 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-14 17:08:52,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:08:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-14 17:08:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 17:08:52,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:52,349 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:08:52,349 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:52,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:52,349 INFO L82 PathProgramCache]: Analyzing trace with hash 222834040, now seen corresponding path program 5 times [2018-11-14 17:08:52,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:52,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:52,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:52,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:52,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:52,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 17:08:52,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2615#true} is VALID [2018-11-14 17:08:52,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 17:08:52,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 17:08:52,565 INFO L273 TraceCheckUtils]: 5: Hoare triple {2615#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2617#(= main_~i~1 0)} is VALID [2018-11-14 17:08:52,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {2617#(= main_~i~1 0)} assume true; {2617#(= main_~i~1 0)} is VALID [2018-11-14 17:08:52,566 INFO L273 TraceCheckUtils]: 7: Hoare triple {2617#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2617#(= main_~i~1 0)} is VALID [2018-11-14 17:08:52,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {2617#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:52,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {2618#(<= main_~i~1 1)} assume true; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:52,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {2618#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2618#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:52,568 INFO L273 TraceCheckUtils]: 11: Hoare triple {2618#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:52,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {2619#(<= main_~i~1 2)} assume true; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:52,568 INFO L273 TraceCheckUtils]: 13: Hoare triple {2619#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2619#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:52,569 INFO L273 TraceCheckUtils]: 14: Hoare triple {2619#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:52,570 INFO L273 TraceCheckUtils]: 15: Hoare triple {2620#(<= main_~i~1 3)} assume true; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:52,570 INFO L273 TraceCheckUtils]: 16: Hoare triple {2620#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2620#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:52,571 INFO L273 TraceCheckUtils]: 17: Hoare triple {2620#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:52,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {2621#(<= main_~i~1 4)} assume true; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:52,572 INFO L273 TraceCheckUtils]: 19: Hoare triple {2621#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2621#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:52,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {2621#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2622#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:52,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {2622#(<= main_~i~1 5)} assume true; {2622#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:52,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {2622#(<= main_~i~1 5)} assume !(~i~1 < 1000); {2616#false} is VALID [2018-11-14 17:08:52,574 INFO L256 TraceCheckUtils]: 23: Hoare triple {2616#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:08:52,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 17:08:52,575 INFO L273 TraceCheckUtils]: 25: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,575 INFO L273 TraceCheckUtils]: 26: Hoare triple {2615#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:08:52,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:08:52,576 INFO L273 TraceCheckUtils]: 28: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,576 INFO L273 TraceCheckUtils]: 29: Hoare triple {2615#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:08:52,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:08:52,576 INFO L273 TraceCheckUtils]: 31: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,576 INFO L273 TraceCheckUtils]: 32: Hoare triple {2615#true} assume !(~i~0 < 1000); {2615#true} is VALID [2018-11-14 17:08:52,577 INFO L273 TraceCheckUtils]: 33: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 17:08:52,577 INFO L273 TraceCheckUtils]: 34: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,577 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2615#true} {2616#false} #73#return; {2616#false} is VALID [2018-11-14 17:08:52,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {2616#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2616#false} is VALID [2018-11-14 17:08:52,578 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:08:52,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 17:08:52,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {2615#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:08:52,578 INFO L273 TraceCheckUtils]: 41: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:08:52,579 INFO L273 TraceCheckUtils]: 42: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,579 INFO L273 TraceCheckUtils]: 43: Hoare triple {2615#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:08:52,579 INFO L273 TraceCheckUtils]: 44: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:08:52,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,579 INFO L273 TraceCheckUtils]: 46: Hoare triple {2615#true} assume !(~i~0 < 1000); {2615#true} is VALID [2018-11-14 17:08:52,579 INFO L273 TraceCheckUtils]: 47: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 17:08:52,580 INFO L273 TraceCheckUtils]: 48: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,580 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2615#true} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 17:08:52,580 INFO L273 TraceCheckUtils]: 50: Hoare triple {2616#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2616#false} is VALID [2018-11-14 17:08:52,580 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,580 INFO L273 TraceCheckUtils]: 52: Hoare triple {2616#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2616#false} is VALID [2018-11-14 17:08:52,580 INFO L273 TraceCheckUtils]: 53: Hoare triple {2616#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2616#false} is VALID [2018-11-14 17:08:52,580 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,580 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 999); {2616#false} is VALID [2018-11-14 17:08:52,581 INFO L273 TraceCheckUtils]: 56: Hoare triple {2616#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {2616#false} is VALID [2018-11-14 17:08:52,581 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:08:52,581 INFO L273 TraceCheckUtils]: 58: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2615#true} is VALID [2018-11-14 17:08:52,581 INFO L273 TraceCheckUtils]: 59: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,581 INFO L273 TraceCheckUtils]: 60: Hoare triple {2615#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:08:52,581 INFO L273 TraceCheckUtils]: 61: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:08:52,581 INFO L273 TraceCheckUtils]: 62: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,581 INFO L273 TraceCheckUtils]: 63: Hoare triple {2615#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2615#true} is VALID [2018-11-14 17:08:52,582 INFO L273 TraceCheckUtils]: 64: Hoare triple {2615#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2615#true} is VALID [2018-11-14 17:08:52,582 INFO L273 TraceCheckUtils]: 65: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,582 INFO L273 TraceCheckUtils]: 66: Hoare triple {2615#true} assume !(~i~0 < 1000); {2615#true} is VALID [2018-11-14 17:08:52,582 INFO L273 TraceCheckUtils]: 67: Hoare triple {2615#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2615#true} is VALID [2018-11-14 17:08:52,582 INFO L273 TraceCheckUtils]: 68: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,582 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2615#true} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 17:08:52,582 INFO L273 TraceCheckUtils]: 70: Hoare triple {2616#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2616#false} is VALID [2018-11-14 17:08:52,582 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 17:08:52,583 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 17:08:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-14 17:08:52,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:52,585 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-14 17:08:52,596 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:08:52,644 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 17:08:52,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:52,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:52,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {2615#true} call ULTIMATE.init(); {2615#true} is VALID [2018-11-14 17:08:52,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {2615#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2615#true} is VALID [2018-11-14 17:08:52,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2615#true} {2615#true} #69#return; {2615#true} is VALID [2018-11-14 17:08:52,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {2615#true} call #t~ret13 := main(); {2615#true} is VALID [2018-11-14 17:08:52,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {2615#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {2615#true} is VALID [2018-11-14 17:08:52,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {2615#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:08:52,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:08:52,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,876 INFO L273 TraceCheckUtils]: 10: Hoare triple {2615#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:08:52,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:08:52,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,877 INFO L273 TraceCheckUtils]: 13: Hoare triple {2615#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:08:52,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:08:52,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,877 INFO L273 TraceCheckUtils]: 16: Hoare triple {2615#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:08:52,877 INFO L273 TraceCheckUtils]: 17: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:08:52,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,877 INFO L273 TraceCheckUtils]: 19: Hoare triple {2615#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {2615#true} is VALID [2018-11-14 17:08:52,878 INFO L273 TraceCheckUtils]: 20: Hoare triple {2615#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {2615#true} is VALID [2018-11-14 17:08:52,878 INFO L273 TraceCheckUtils]: 21: Hoare triple {2615#true} assume true; {2615#true} is VALID [2018-11-14 17:08:52,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {2615#true} assume !(~i~1 < 1000); {2615#true} is VALID [2018-11-14 17:08:52,878 INFO L256 TraceCheckUtils]: 23: Hoare triple {2615#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {2615#true} is VALID [2018-11-14 17:08:52,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {2615#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2698#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:52,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {2698#(<= xor_~i~0 1)} assume true; {2698#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:52,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {2698#(<= xor_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2698#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:52,880 INFO L273 TraceCheckUtils]: 27: Hoare triple {2698#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2708#(<= xor_~i~0 2)} is VALID [2018-11-14 17:08:52,880 INFO L273 TraceCheckUtils]: 28: Hoare triple {2708#(<= xor_~i~0 2)} assume true; {2708#(<= xor_~i~0 2)} is VALID [2018-11-14 17:08:52,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {2708#(<= xor_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2708#(<= xor_~i~0 2)} is VALID [2018-11-14 17:08:52,881 INFO L273 TraceCheckUtils]: 30: Hoare triple {2708#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2718#(<= xor_~i~0 3)} is VALID [2018-11-14 17:08:52,881 INFO L273 TraceCheckUtils]: 31: Hoare triple {2718#(<= xor_~i~0 3)} assume true; {2718#(<= xor_~i~0 3)} is VALID [2018-11-14 17:08:52,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {2718#(<= xor_~i~0 3)} assume !(~i~0 < 1000); {2616#false} is VALID [2018-11-14 17:08:52,882 INFO L273 TraceCheckUtils]: 33: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 17:08:52,882 INFO L273 TraceCheckUtils]: 34: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,882 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2616#false} {2615#true} #73#return; {2616#false} is VALID [2018-11-14 17:08:52,882 INFO L273 TraceCheckUtils]: 36: Hoare triple {2616#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {2616#false} is VALID [2018-11-14 17:08:52,882 INFO L256 TraceCheckUtils]: 37: Hoare triple {2616#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 17:08:52,882 INFO L273 TraceCheckUtils]: 38: Hoare triple {2616#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2616#false} is VALID [2018-11-14 17:08:52,883 INFO L273 TraceCheckUtils]: 39: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,883 INFO L273 TraceCheckUtils]: 40: Hoare triple {2616#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:08:52,883 INFO L273 TraceCheckUtils]: 41: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 17:08:52,884 INFO L273 TraceCheckUtils]: 42: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {2616#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:08:52,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 17:08:52,885 INFO L273 TraceCheckUtils]: 45: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,885 INFO L273 TraceCheckUtils]: 46: Hoare triple {2616#false} assume !(~i~0 < 1000); {2616#false} is VALID [2018-11-14 17:08:52,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 17:08:52,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,885 INFO L268 TraceCheckUtils]: 49: Hoare quadruple {2616#false} {2616#false} #75#return; {2616#false} is VALID [2018-11-14 17:08:52,885 INFO L273 TraceCheckUtils]: 50: Hoare triple {2616#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {2616#false} is VALID [2018-11-14 17:08:52,886 INFO L273 TraceCheckUtils]: 51: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,886 INFO L273 TraceCheckUtils]: 52: Hoare triple {2616#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {2616#false} is VALID [2018-11-14 17:08:52,886 INFO L273 TraceCheckUtils]: 53: Hoare triple {2616#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {2616#false} is VALID [2018-11-14 17:08:52,886 INFO L273 TraceCheckUtils]: 54: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,886 INFO L273 TraceCheckUtils]: 55: Hoare triple {2616#false} assume !(~i~2 < 999); {2616#false} is VALID [2018-11-14 17:08:52,887 INFO L273 TraceCheckUtils]: 56: Hoare triple {2616#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {2616#false} is VALID [2018-11-14 17:08:52,887 INFO L256 TraceCheckUtils]: 57: Hoare triple {2616#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {2616#false} is VALID [2018-11-14 17:08:52,887 INFO L273 TraceCheckUtils]: 58: Hoare triple {2616#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {2616#false} is VALID [2018-11-14 17:08:52,887 INFO L273 TraceCheckUtils]: 59: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,887 INFO L273 TraceCheckUtils]: 60: Hoare triple {2616#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:08:52,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 17:08:52,888 INFO L273 TraceCheckUtils]: 62: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,888 INFO L273 TraceCheckUtils]: 63: Hoare triple {2616#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {2616#false} is VALID [2018-11-14 17:08:52,888 INFO L273 TraceCheckUtils]: 64: Hoare triple {2616#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {2616#false} is VALID [2018-11-14 17:08:52,888 INFO L273 TraceCheckUtils]: 65: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,888 INFO L273 TraceCheckUtils]: 66: Hoare triple {2616#false} assume !(~i~0 < 1000); {2616#false} is VALID [2018-11-14 17:08:52,889 INFO L273 TraceCheckUtils]: 67: Hoare triple {2616#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {2616#false} is VALID [2018-11-14 17:08:52,889 INFO L273 TraceCheckUtils]: 68: Hoare triple {2616#false} assume true; {2616#false} is VALID [2018-11-14 17:08:52,889 INFO L268 TraceCheckUtils]: 69: Hoare quadruple {2616#false} {2616#false} #77#return; {2616#false} is VALID [2018-11-14 17:08:52,889 INFO L273 TraceCheckUtils]: 70: Hoare triple {2616#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {2616#false} is VALID [2018-11-14 17:08:52,889 INFO L273 TraceCheckUtils]: 71: Hoare triple {2616#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {2616#false} is VALID [2018-11-14 17:08:52,890 INFO L273 TraceCheckUtils]: 72: Hoare triple {2616#false} assume !false; {2616#false} is VALID [2018-11-14 17:08:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 46 proven. 7 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2018-11-14 17:08:52,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:52,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-14 17:08:52,923 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 17:08:52,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:52,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:08:53,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:53,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:08:53,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:08:53,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:08:53,091 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 11 states. [2018-11-14 17:08:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:53,756 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2018-11-14 17:08:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:08:53,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-11-14 17:08:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:53,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:08:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 17:08:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:08:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 88 transitions. [2018-11-14 17:08:53,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 88 transitions. [2018-11-14 17:08:53,883 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-14 17:08:53,885 INFO L225 Difference]: With dead ends: 85 [2018-11-14 17:08:53,886 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:08:53,886 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:08:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:08:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-11-14 17:08:53,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:53,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 56 states. [2018-11-14 17:08:53,904 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 56 states. [2018-11-14 17:08:53,904 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 56 states. [2018-11-14 17:08:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:53,907 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:08:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:08:53,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:53,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:53,908 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 58 states. [2018-11-14 17:08:53,908 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 58 states. [2018-11-14 17:08:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:53,910 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-11-14 17:08:53,910 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-11-14 17:08:53,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:53,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:53,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:53,911 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:08:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-14 17:08:53,913 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 73 [2018-11-14 17:08:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:53,914 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-14 17:08:53,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:08:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-14 17:08:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 17:08:53,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:53,915 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 7, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:08:53,915 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:53,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1472368537, now seen corresponding path program 6 times [2018-11-14 17:08:53,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:53,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:53,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:54,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 17:08:54,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3152#true} is VALID [2018-11-14 17:08:54,168 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 17:08:54,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 17:08:54,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {3152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3154#(= main_~i~1 0)} is VALID [2018-11-14 17:08:54,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {3154#(= main_~i~1 0)} assume true; {3154#(= main_~i~1 0)} is VALID [2018-11-14 17:08:54,170 INFO L273 TraceCheckUtils]: 7: Hoare triple {3154#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3154#(= main_~i~1 0)} is VALID [2018-11-14 17:08:54,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {3154#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:54,171 INFO L273 TraceCheckUtils]: 9: Hoare triple {3155#(<= main_~i~1 1)} assume true; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:54,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {3155#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3155#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:54,171 INFO L273 TraceCheckUtils]: 11: Hoare triple {3155#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:54,172 INFO L273 TraceCheckUtils]: 12: Hoare triple {3156#(<= main_~i~1 2)} assume true; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:54,172 INFO L273 TraceCheckUtils]: 13: Hoare triple {3156#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3156#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:54,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {3156#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:54,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {3157#(<= main_~i~1 3)} assume true; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:54,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {3157#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3157#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:54,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {3157#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:54,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {3158#(<= main_~i~1 4)} assume true; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:54,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {3158#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3158#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:54,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {3158#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:54,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {3159#(<= main_~i~1 5)} assume true; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:54,178 INFO L273 TraceCheckUtils]: 22: Hoare triple {3159#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3159#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:54,178 INFO L273 TraceCheckUtils]: 23: Hoare triple {3159#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3160#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:54,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {3160#(<= main_~i~1 6)} assume true; {3160#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:54,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {3160#(<= main_~i~1 6)} assume !(~i~1 < 1000); {3153#false} is VALID [2018-11-14 17:08:54,180 INFO L256 TraceCheckUtils]: 26: Hoare triple {3153#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:08:54,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:08:54,180 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,180 INFO L273 TraceCheckUtils]: 29: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,181 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,181 INFO L273 TraceCheckUtils]: 32: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,181 INFO L273 TraceCheckUtils]: 33: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,182 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,182 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 1000); {3152#true} is VALID [2018-11-14 17:08:54,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:08:54,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,183 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3153#false} #73#return; {3153#false} is VALID [2018-11-14 17:08:54,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {3153#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3153#false} is VALID [2018-11-14 17:08:54,183 INFO L256 TraceCheckUtils]: 43: Hoare triple {3153#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:08:54,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:08:54,184 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,184 INFO L273 TraceCheckUtils]: 46: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,184 INFO L273 TraceCheckUtils]: 47: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,184 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,185 INFO L273 TraceCheckUtils]: 49: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,185 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,185 INFO L273 TraceCheckUtils]: 52: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,185 INFO L273 TraceCheckUtils]: 53: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 1000); {3152#true} is VALID [2018-11-14 17:08:54,186 INFO L273 TraceCheckUtils]: 56: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:08:54,186 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,186 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3153#false} #75#return; {3153#false} is VALID [2018-11-14 17:08:54,186 INFO L273 TraceCheckUtils]: 59: Hoare triple {3153#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3153#false} is VALID [2018-11-14 17:08:54,186 INFO L273 TraceCheckUtils]: 60: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:08:54,186 INFO L273 TraceCheckUtils]: 61: Hoare triple {3153#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3153#false} is VALID [2018-11-14 17:08:54,187 INFO L273 TraceCheckUtils]: 62: Hoare triple {3153#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3153#false} is VALID [2018-11-14 17:08:54,187 INFO L273 TraceCheckUtils]: 63: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:08:54,187 INFO L273 TraceCheckUtils]: 64: Hoare triple {3153#false} assume !(~i~2 < 999); {3153#false} is VALID [2018-11-14 17:08:54,187 INFO L273 TraceCheckUtils]: 65: Hoare triple {3153#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {3153#false} is VALID [2018-11-14 17:08:54,187 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:08:54,187 INFO L273 TraceCheckUtils]: 67: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:08:54,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,188 INFO L273 TraceCheckUtils]: 69: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,188 INFO L273 TraceCheckUtils]: 70: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,188 INFO L273 TraceCheckUtils]: 71: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,188 INFO L273 TraceCheckUtils]: 72: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,188 INFO L273 TraceCheckUtils]: 73: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,189 INFO L273 TraceCheckUtils]: 74: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,189 INFO L273 TraceCheckUtils]: 75: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,189 INFO L273 TraceCheckUtils]: 76: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,189 INFO L273 TraceCheckUtils]: 77: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,189 INFO L273 TraceCheckUtils]: 78: Hoare triple {3152#true} assume !(~i~0 < 1000); {3152#true} is VALID [2018-11-14 17:08:54,189 INFO L273 TraceCheckUtils]: 79: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:08:54,190 INFO L273 TraceCheckUtils]: 80: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,190 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3152#true} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 17:08:54,190 INFO L273 TraceCheckUtils]: 82: Hoare triple {3153#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3153#false} is VALID [2018-11-14 17:08:54,190 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 17:08:54,190 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 17:08:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-11-14 17:08:54,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:54,199 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-14 17:08:54,215 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:08:54,311 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 17:08:54,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:54,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:54,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {3152#true} call ULTIMATE.init(); {3152#true} is VALID [2018-11-14 17:08:54,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {3152#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3152#true} is VALID [2018-11-14 17:08:54,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3152#true} {3152#true} #69#return; {3152#true} is VALID [2018-11-14 17:08:54,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {3152#true} call #t~ret13 := main(); {3152#true} is VALID [2018-11-14 17:08:54,483 INFO L273 TraceCheckUtils]: 5: Hoare triple {3152#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3152#true} is VALID [2018-11-14 17:08:54,483 INFO L273 TraceCheckUtils]: 6: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {3152#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:08:54,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:08:54,484 INFO L273 TraceCheckUtils]: 9: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {3152#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:08:54,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:08:54,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {3152#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:08:54,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:08:54,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {3152#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:08:54,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:08:54,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {3152#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:08:54,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:08:54,486 INFO L273 TraceCheckUtils]: 21: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {3152#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3152#true} is VALID [2018-11-14 17:08:54,487 INFO L273 TraceCheckUtils]: 23: Hoare triple {3152#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3152#true} is VALID [2018-11-14 17:08:54,487 INFO L273 TraceCheckUtils]: 24: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,487 INFO L273 TraceCheckUtils]: 25: Hoare triple {3152#true} assume !(~i~1 < 1000); {3152#true} is VALID [2018-11-14 17:08:54,487 INFO L256 TraceCheckUtils]: 26: Hoare triple {3152#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:08:54,487 INFO L273 TraceCheckUtils]: 27: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:08:54,488 INFO L273 TraceCheckUtils]: 28: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,488 INFO L273 TraceCheckUtils]: 29: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,488 INFO L273 TraceCheckUtils]: 30: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,488 INFO L273 TraceCheckUtils]: 31: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,488 INFO L273 TraceCheckUtils]: 32: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,488 INFO L273 TraceCheckUtils]: 33: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,488 INFO L273 TraceCheckUtils]: 34: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,488 INFO L273 TraceCheckUtils]: 36: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,489 INFO L273 TraceCheckUtils]: 37: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,489 INFO L273 TraceCheckUtils]: 38: Hoare triple {3152#true} assume !(~i~0 < 1000); {3152#true} is VALID [2018-11-14 17:08:54,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:08:54,489 INFO L273 TraceCheckUtils]: 40: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,489 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3152#true} {3152#true} #73#return; {3152#true} is VALID [2018-11-14 17:08:54,489 INFO L273 TraceCheckUtils]: 42: Hoare triple {3152#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3152#true} is VALID [2018-11-14 17:08:54,489 INFO L256 TraceCheckUtils]: 43: Hoare triple {3152#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3152#true} is VALID [2018-11-14 17:08:54,489 INFO L273 TraceCheckUtils]: 44: Hoare triple {3152#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3152#true} is VALID [2018-11-14 17:08:54,490 INFO L273 TraceCheckUtils]: 45: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,490 INFO L273 TraceCheckUtils]: 46: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,490 INFO L273 TraceCheckUtils]: 47: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,490 INFO L273 TraceCheckUtils]: 48: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,490 INFO L273 TraceCheckUtils]: 49: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,490 INFO L273 TraceCheckUtils]: 50: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,490 INFO L273 TraceCheckUtils]: 51: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,490 INFO L273 TraceCheckUtils]: 52: Hoare triple {3152#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3152#true} is VALID [2018-11-14 17:08:54,491 INFO L273 TraceCheckUtils]: 53: Hoare triple {3152#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3152#true} is VALID [2018-11-14 17:08:54,491 INFO L273 TraceCheckUtils]: 54: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,491 INFO L273 TraceCheckUtils]: 55: Hoare triple {3152#true} assume !(~i~0 < 1000); {3152#true} is VALID [2018-11-14 17:08:54,491 INFO L273 TraceCheckUtils]: 56: Hoare triple {3152#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3152#true} is VALID [2018-11-14 17:08:54,491 INFO L273 TraceCheckUtils]: 57: Hoare triple {3152#true} assume true; {3152#true} is VALID [2018-11-14 17:08:54,491 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {3152#true} {3152#true} #75#return; {3152#true} is VALID [2018-11-14 17:08:54,492 INFO L273 TraceCheckUtils]: 59: Hoare triple {3152#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:54,492 INFO L273 TraceCheckUtils]: 60: Hoare triple {3341#(<= main_~i~2 0)} assume true; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:54,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {3341#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3341#(<= main_~i~2 0)} is VALID [2018-11-14 17:08:54,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {3341#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3351#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:54,493 INFO L273 TraceCheckUtils]: 63: Hoare triple {3351#(<= main_~i~2 1)} assume true; {3351#(<= main_~i~2 1)} is VALID [2018-11-14 17:08:54,494 INFO L273 TraceCheckUtils]: 64: Hoare triple {3351#(<= main_~i~2 1)} assume !(~i~2 < 999); {3153#false} is VALID [2018-11-14 17:08:54,494 INFO L273 TraceCheckUtils]: 65: Hoare triple {3153#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {3153#false} is VALID [2018-11-14 17:08:54,494 INFO L256 TraceCheckUtils]: 66: Hoare triple {3153#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3153#false} is VALID [2018-11-14 17:08:54,494 INFO L273 TraceCheckUtils]: 67: Hoare triple {3153#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3153#false} is VALID [2018-11-14 17:08:54,494 INFO L273 TraceCheckUtils]: 68: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:08:54,494 INFO L273 TraceCheckUtils]: 69: Hoare triple {3153#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 17:08:54,494 INFO L273 TraceCheckUtils]: 70: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 17:08:54,494 INFO L273 TraceCheckUtils]: 71: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:08:54,495 INFO L273 TraceCheckUtils]: 72: Hoare triple {3153#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 17:08:54,495 INFO L273 TraceCheckUtils]: 73: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 17:08:54,495 INFO L273 TraceCheckUtils]: 74: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:08:54,495 INFO L273 TraceCheckUtils]: 75: Hoare triple {3153#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3153#false} is VALID [2018-11-14 17:08:54,495 INFO L273 TraceCheckUtils]: 76: Hoare triple {3153#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3153#false} is VALID [2018-11-14 17:08:54,495 INFO L273 TraceCheckUtils]: 77: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:08:54,495 INFO L273 TraceCheckUtils]: 78: Hoare triple {3153#false} assume !(~i~0 < 1000); {3153#false} is VALID [2018-11-14 17:08:54,496 INFO L273 TraceCheckUtils]: 79: Hoare triple {3153#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3153#false} is VALID [2018-11-14 17:08:54,496 INFO L273 TraceCheckUtils]: 80: Hoare triple {3153#false} assume true; {3153#false} is VALID [2018-11-14 17:08:54,496 INFO L268 TraceCheckUtils]: 81: Hoare quadruple {3153#false} {3153#false} #77#return; {3153#false} is VALID [2018-11-14 17:08:54,496 INFO L273 TraceCheckUtils]: 82: Hoare triple {3153#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3153#false} is VALID [2018-11-14 17:08:54,496 INFO L273 TraceCheckUtils]: 83: Hoare triple {3153#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3153#false} is VALID [2018-11-14 17:08:54,496 INFO L273 TraceCheckUtils]: 84: Hoare triple {3153#false} assume !false; {3153#false} is VALID [2018-11-14 17:08:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 90 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-14 17:08:54,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:54,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2018-11-14 17:08:54,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 17:08:54,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:54,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:08:54,628 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-14 17:08:54,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:08:54,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:08:54,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:08:54,629 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 11 states. [2018-11-14 17:08:54,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:54,968 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-14 17:08:54,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:08:54,969 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-11-14 17:08:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:08:54,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 17:08:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:08:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 85 transitions. [2018-11-14 17:08:54,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 85 transitions. [2018-11-14 17:08:55,057 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-14 17:08:55,060 INFO L225 Difference]: With dead ends: 94 [2018-11-14 17:08:55,060 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:08:55,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:08:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:08:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-11-14 17:08:55,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:55,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 62 states. [2018-11-14 17:08:55,091 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 62 states. [2018-11-14 17:08:55,091 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 62 states. [2018-11-14 17:08:55,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:55,093 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 17:08:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 17:08:55,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:55,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:55,094 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 64 states. [2018-11-14 17:08:55,094 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 64 states. [2018-11-14 17:08:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:55,096 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-11-14 17:08:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-14 17:08:55,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:55,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:55,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:55,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:08:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-11-14 17:08:55,098 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 85 [2018-11-14 17:08:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:55,098 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-11-14 17:08:55,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:08:55,099 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-11-14 17:08:55,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-14 17:08:55,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:55,100 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 8, 7, 7, 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] [2018-11-14 17:08:55,100 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:55,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:55,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1537898689, now seen corresponding path program 7 times [2018-11-14 17:08:55,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:55,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:55,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:55,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:55,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:55,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 17:08:55,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3757#true} is VALID [2018-11-14 17:08:55,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 17:08:55,300 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 17:08:55,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {3757#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3759#(= main_~i~1 0)} is VALID [2018-11-14 17:08:55,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {3759#(= main_~i~1 0)} assume true; {3759#(= main_~i~1 0)} is VALID [2018-11-14 17:08:55,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {3759#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3759#(= main_~i~1 0)} is VALID [2018-11-14 17:08:55,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {3759#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:55,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:55,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {3760#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:55,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {3760#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:55,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:55,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {3761#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:55,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {3761#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:55,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:55,307 INFO L273 TraceCheckUtils]: 16: Hoare triple {3762#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:55,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {3762#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:55,307 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:55,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:55,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {3763#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:55,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:55,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {3764#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:55,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {3764#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:55,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:55,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {3765#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:55,312 INFO L273 TraceCheckUtils]: 26: Hoare triple {3765#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:55,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:55,314 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 1000); {3758#false} is VALID [2018-11-14 17:08:55,314 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 17:08:55,314 INFO L273 TraceCheckUtils]: 30: Hoare triple {3757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 17:08:55,314 INFO L273 TraceCheckUtils]: 31: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,314 INFO L273 TraceCheckUtils]: 32: Hoare triple {3757#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:08:55,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:08:55,315 INFO L273 TraceCheckUtils]: 34: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,315 INFO L273 TraceCheckUtils]: 35: Hoare triple {3757#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:08:55,315 INFO L273 TraceCheckUtils]: 36: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:08:55,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,316 INFO L273 TraceCheckUtils]: 38: Hoare triple {3757#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:08:55,316 INFO L273 TraceCheckUtils]: 39: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:08:55,316 INFO L273 TraceCheckUtils]: 40: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,316 INFO L273 TraceCheckUtils]: 41: Hoare triple {3757#true} assume !(~i~0 < 1000); {3757#true} is VALID [2018-11-14 17:08:55,316 INFO L273 TraceCheckUtils]: 42: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 17:08:55,316 INFO L273 TraceCheckUtils]: 43: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,317 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3757#true} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 17:08:55,317 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3758#false} is VALID [2018-11-14 17:08:55,317 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 17:08:55,317 INFO L273 TraceCheckUtils]: 47: Hoare triple {3757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 17:08:55,317 INFO L273 TraceCheckUtils]: 48: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,317 INFO L273 TraceCheckUtils]: 49: Hoare triple {3757#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:08:55,317 INFO L273 TraceCheckUtils]: 50: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:08:55,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,318 INFO L273 TraceCheckUtils]: 52: Hoare triple {3757#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:08:55,318 INFO L273 TraceCheckUtils]: 53: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:08:55,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,318 INFO L273 TraceCheckUtils]: 55: Hoare triple {3757#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:08:55,318 INFO L273 TraceCheckUtils]: 56: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:08:55,318 INFO L273 TraceCheckUtils]: 57: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,318 INFO L273 TraceCheckUtils]: 58: Hoare triple {3757#true} assume !(~i~0 < 1000); {3757#true} is VALID [2018-11-14 17:08:55,318 INFO L273 TraceCheckUtils]: 59: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 17:08:55,319 INFO L273 TraceCheckUtils]: 60: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,319 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3757#true} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 17:08:55,319 INFO L273 TraceCheckUtils]: 62: Hoare triple {3758#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3758#false} is VALID [2018-11-14 17:08:55,319 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,319 INFO L273 TraceCheckUtils]: 64: Hoare triple {3758#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 17:08:55,319 INFO L273 TraceCheckUtils]: 65: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 17:08:55,319 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,319 INFO L273 TraceCheckUtils]: 67: Hoare triple {3758#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 17:08:55,320 INFO L273 TraceCheckUtils]: 68: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 17:08:55,320 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,320 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 999); {3758#false} is VALID [2018-11-14 17:08:55,320 INFO L273 TraceCheckUtils]: 71: Hoare triple {3758#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {3758#false} is VALID [2018-11-14 17:08:55,320 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3757#true} is VALID [2018-11-14 17:08:55,320 INFO L273 TraceCheckUtils]: 73: Hoare triple {3757#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3757#true} is VALID [2018-11-14 17:08:55,320 INFO L273 TraceCheckUtils]: 74: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,320 INFO L273 TraceCheckUtils]: 75: Hoare triple {3757#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:08:55,321 INFO L273 TraceCheckUtils]: 76: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:08:55,321 INFO L273 TraceCheckUtils]: 77: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,321 INFO L273 TraceCheckUtils]: 78: Hoare triple {3757#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:08:55,321 INFO L273 TraceCheckUtils]: 79: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:08:55,321 INFO L273 TraceCheckUtils]: 80: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,321 INFO L273 TraceCheckUtils]: 81: Hoare triple {3757#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3757#true} is VALID [2018-11-14 17:08:55,321 INFO L273 TraceCheckUtils]: 82: Hoare triple {3757#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3757#true} is VALID [2018-11-14 17:08:55,321 INFO L273 TraceCheckUtils]: 83: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,321 INFO L273 TraceCheckUtils]: 84: Hoare triple {3757#true} assume !(~i~0 < 1000); {3757#true} is VALID [2018-11-14 17:08:55,322 INFO L273 TraceCheckUtils]: 85: Hoare triple {3757#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3757#true} is VALID [2018-11-14 17:08:55,322 INFO L273 TraceCheckUtils]: 86: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,322 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3757#true} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 17:08:55,322 INFO L273 TraceCheckUtils]: 88: Hoare triple {3758#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3758#false} is VALID [2018-11-14 17:08:55,322 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 17:08:55,322 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 17:08:55,327 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:08:55,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:55,328 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-14 17:08:55,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:55,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:55,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {3757#true} call ULTIMATE.init(); {3757#true} is VALID [2018-11-14 17:08:55,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {3757#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3757#true} is VALID [2018-11-14 17:08:55,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {3757#true} assume true; {3757#true} is VALID [2018-11-14 17:08:55,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3757#true} {3757#true} #69#return; {3757#true} is VALID [2018-11-14 17:08:55,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {3757#true} call #t~ret13 := main(); {3757#true} is VALID [2018-11-14 17:08:55,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {3757#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:55,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {3785#(<= main_~i~1 0)} assume true; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:55,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {3785#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3785#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:55,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {3785#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:55,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(<= main_~i~1 1)} assume true; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:55,535 INFO L273 TraceCheckUtils]: 10: Hoare triple {3760#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3760#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:55,536 INFO L273 TraceCheckUtils]: 11: Hoare triple {3760#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:55,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {3761#(<= main_~i~1 2)} assume true; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:55,537 INFO L273 TraceCheckUtils]: 13: Hoare triple {3761#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3761#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:55,537 INFO L273 TraceCheckUtils]: 14: Hoare triple {3761#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:55,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {3762#(<= main_~i~1 3)} assume true; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:55,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {3762#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3762#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:55,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {3762#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:55,540 INFO L273 TraceCheckUtils]: 18: Hoare triple {3763#(<= main_~i~1 4)} assume true; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:55,540 INFO L273 TraceCheckUtils]: 19: Hoare triple {3763#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3763#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:55,541 INFO L273 TraceCheckUtils]: 20: Hoare triple {3763#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:55,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {3764#(<= main_~i~1 5)} assume true; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:55,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {3764#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3764#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:55,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {3764#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:55,543 INFO L273 TraceCheckUtils]: 24: Hoare triple {3765#(<= main_~i~1 6)} assume true; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:55,544 INFO L273 TraceCheckUtils]: 25: Hoare triple {3765#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {3765#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:55,544 INFO L273 TraceCheckUtils]: 26: Hoare triple {3765#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:55,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {3766#(<= main_~i~1 7)} assume true; {3766#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:55,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {3766#(<= main_~i~1 7)} assume !(~i~1 < 1000); {3758#false} is VALID [2018-11-14 17:08:55,546 INFO L256 TraceCheckUtils]: 29: Hoare triple {3758#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 17:08:55,546 INFO L273 TraceCheckUtils]: 30: Hoare triple {3758#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 17:08:55,546 INFO L273 TraceCheckUtils]: 31: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,546 INFO L273 TraceCheckUtils]: 32: Hoare triple {3758#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:08:55,546 INFO L273 TraceCheckUtils]: 33: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:08:55,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,547 INFO L273 TraceCheckUtils]: 35: Hoare triple {3758#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:08:55,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:08:55,547 INFO L273 TraceCheckUtils]: 37: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,547 INFO L273 TraceCheckUtils]: 38: Hoare triple {3758#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:08:55,548 INFO L273 TraceCheckUtils]: 39: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:08:55,548 INFO L273 TraceCheckUtils]: 40: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,548 INFO L273 TraceCheckUtils]: 41: Hoare triple {3758#false} assume !(~i~0 < 1000); {3758#false} is VALID [2018-11-14 17:08:55,548 INFO L273 TraceCheckUtils]: 42: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 17:08:55,548 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,549 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3758#false} {3758#false} #73#return; {3758#false} is VALID [2018-11-14 17:08:55,549 INFO L273 TraceCheckUtils]: 45: Hoare triple {3758#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {3758#false} is VALID [2018-11-14 17:08:55,549 INFO L256 TraceCheckUtils]: 46: Hoare triple {3758#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 17:08:55,549 INFO L273 TraceCheckUtils]: 47: Hoare triple {3758#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 17:08:55,549 INFO L273 TraceCheckUtils]: 48: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,549 INFO L273 TraceCheckUtils]: 49: Hoare triple {3758#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:08:55,549 INFO L273 TraceCheckUtils]: 50: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:08:55,549 INFO L273 TraceCheckUtils]: 51: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,550 INFO L273 TraceCheckUtils]: 52: Hoare triple {3758#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:08:55,550 INFO L273 TraceCheckUtils]: 53: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:08:55,550 INFO L273 TraceCheckUtils]: 54: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,550 INFO L273 TraceCheckUtils]: 55: Hoare triple {3758#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:08:55,550 INFO L273 TraceCheckUtils]: 56: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:08:55,550 INFO L273 TraceCheckUtils]: 57: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,550 INFO L273 TraceCheckUtils]: 58: Hoare triple {3758#false} assume !(~i~0 < 1000); {3758#false} is VALID [2018-11-14 17:08:55,550 INFO L273 TraceCheckUtils]: 59: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 17:08:55,550 INFO L273 TraceCheckUtils]: 60: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,551 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {3758#false} {3758#false} #75#return; {3758#false} is VALID [2018-11-14 17:08:55,551 INFO L273 TraceCheckUtils]: 62: Hoare triple {3758#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {3758#false} is VALID [2018-11-14 17:08:55,551 INFO L273 TraceCheckUtils]: 63: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,551 INFO L273 TraceCheckUtils]: 64: Hoare triple {3758#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 17:08:55,551 INFO L273 TraceCheckUtils]: 65: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 17:08:55,551 INFO L273 TraceCheckUtils]: 66: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,551 INFO L273 TraceCheckUtils]: 67: Hoare triple {3758#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {3758#false} is VALID [2018-11-14 17:08:55,551 INFO L273 TraceCheckUtils]: 68: Hoare triple {3758#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {3758#false} is VALID [2018-11-14 17:08:55,552 INFO L273 TraceCheckUtils]: 69: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,552 INFO L273 TraceCheckUtils]: 70: Hoare triple {3758#false} assume !(~i~2 < 999); {3758#false} is VALID [2018-11-14 17:08:55,552 INFO L273 TraceCheckUtils]: 71: Hoare triple {3758#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {3758#false} is VALID [2018-11-14 17:08:55,552 INFO L256 TraceCheckUtils]: 72: Hoare triple {3758#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {3758#false} is VALID [2018-11-14 17:08:55,552 INFO L273 TraceCheckUtils]: 73: Hoare triple {3758#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {3758#false} is VALID [2018-11-14 17:08:55,552 INFO L273 TraceCheckUtils]: 74: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,552 INFO L273 TraceCheckUtils]: 75: Hoare triple {3758#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:08:55,552 INFO L273 TraceCheckUtils]: 76: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:08:55,552 INFO L273 TraceCheckUtils]: 77: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,553 INFO L273 TraceCheckUtils]: 78: Hoare triple {3758#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:08:55,553 INFO L273 TraceCheckUtils]: 79: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:08:55,553 INFO L273 TraceCheckUtils]: 80: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,553 INFO L273 TraceCheckUtils]: 81: Hoare triple {3758#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {3758#false} is VALID [2018-11-14 17:08:55,553 INFO L273 TraceCheckUtils]: 82: Hoare triple {3758#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {3758#false} is VALID [2018-11-14 17:08:55,553 INFO L273 TraceCheckUtils]: 83: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,553 INFO L273 TraceCheckUtils]: 84: Hoare triple {3758#false} assume !(~i~0 < 1000); {3758#false} is VALID [2018-11-14 17:08:55,553 INFO L273 TraceCheckUtils]: 85: Hoare triple {3758#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {3758#false} is VALID [2018-11-14 17:08:55,554 INFO L273 TraceCheckUtils]: 86: Hoare triple {3758#false} assume true; {3758#false} is VALID [2018-11-14 17:08:55,554 INFO L268 TraceCheckUtils]: 87: Hoare quadruple {3758#false} {3758#false} #77#return; {3758#false} is VALID [2018-11-14 17:08:55,554 INFO L273 TraceCheckUtils]: 88: Hoare triple {3758#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {3758#false} is VALID [2018-11-14 17:08:55,554 INFO L273 TraceCheckUtils]: 89: Hoare triple {3758#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {3758#false} is VALID [2018-11-14 17:08:55,554 INFO L273 TraceCheckUtils]: 90: Hoare triple {3758#false} assume !false; {3758#false} is VALID [2018-11-14 17:08:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:08:55,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:55,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 17:08:55,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 17:08:55,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:55,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 17:08:55,651 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-14 17:08:55,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 17:08:55,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 17:08:55,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:08:55,652 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 11 states. [2018-11-14 17:08:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:55,970 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2018-11-14 17:08:55,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:08:55,970 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 91 [2018-11-14 17:08:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:55,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:08:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 17:08:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 17:08:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 81 transitions. [2018-11-14 17:08:55,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 81 transitions. [2018-11-14 17:08:56,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:56,047 INFO L225 Difference]: With dead ends: 99 [2018-11-14 17:08:56,047 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:08:56,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 17:08:56,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:08:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-11-14 17:08:56,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:56,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 65 states. [2018-11-14 17:08:56,143 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 65 states. [2018-11-14 17:08:56,143 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 65 states. [2018-11-14 17:08:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:56,145 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:08:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:08:56,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:56,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:56,145 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 66 states. [2018-11-14 17:08:56,145 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 66 states. [2018-11-14 17:08:56,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:56,147 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-11-14 17:08:56,147 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-14 17:08:56,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:56,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:56,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:56,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 17:08:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-14 17:08:56,149 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 91 [2018-11-14 17:08:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:56,150 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-14 17:08:56,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 17:08:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-14 17:08:56,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-14 17:08:56,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:56,151 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 8, 8, 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] [2018-11-14 17:08:56,151 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:56,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash -849314171, now seen corresponding path program 8 times [2018-11-14 17:08:56,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:56,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:56,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:08:56,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:56,949 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 17:08:56,950 INFO L273 TraceCheckUtils]: 1: Hoare triple {4395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4395#true} is VALID [2018-11-14 17:08:56,950 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,950 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 17:08:56,950 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 17:08:56,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {4395#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4397#(= main_~i~1 0)} is VALID [2018-11-14 17:08:56,951 INFO L273 TraceCheckUtils]: 6: Hoare triple {4397#(= main_~i~1 0)} assume true; {4397#(= main_~i~1 0)} is VALID [2018-11-14 17:08:56,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {4397#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4397#(= main_~i~1 0)} is VALID [2018-11-14 17:08:56,952 INFO L273 TraceCheckUtils]: 8: Hoare triple {4397#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:56,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:56,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {4398#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:56,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {4398#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:56,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:56,954 INFO L273 TraceCheckUtils]: 13: Hoare triple {4399#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:56,954 INFO L273 TraceCheckUtils]: 14: Hoare triple {4399#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:56,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:56,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {4400#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:56,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {4400#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:56,956 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:56,957 INFO L273 TraceCheckUtils]: 19: Hoare triple {4401#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:56,957 INFO L273 TraceCheckUtils]: 20: Hoare triple {4401#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:56,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:56,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {4402#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:56,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {4402#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:56,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:56,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {4403#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:56,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {4403#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:56,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:56,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {4404#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:56,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {4404#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:56,963 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:56,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 1000); {4396#false} is VALID [2018-11-14 17:08:56,964 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 17:08:56,964 INFO L273 TraceCheckUtils]: 33: Hoare triple {4395#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 17:08:56,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {4395#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:08:56,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:08:56,965 INFO L273 TraceCheckUtils]: 37: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,965 INFO L273 TraceCheckUtils]: 38: Hoare triple {4395#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:08:56,966 INFO L273 TraceCheckUtils]: 39: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:08:56,966 INFO L273 TraceCheckUtils]: 40: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,966 INFO L273 TraceCheckUtils]: 41: Hoare triple {4395#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:08:56,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:08:56,966 INFO L273 TraceCheckUtils]: 43: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,966 INFO L273 TraceCheckUtils]: 44: Hoare triple {4395#true} assume !(~i~0 < 1000); {4395#true} is VALID [2018-11-14 17:08:56,967 INFO L273 TraceCheckUtils]: 45: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 17:08:56,967 INFO L273 TraceCheckUtils]: 46: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,967 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4395#true} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 17:08:56,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {4396#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4396#false} is VALID [2018-11-14 17:08:56,967 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 17:08:56,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {4395#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 17:08:56,967 INFO L273 TraceCheckUtils]: 51: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,967 INFO L273 TraceCheckUtils]: 52: Hoare triple {4395#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:08:56,968 INFO L273 TraceCheckUtils]: 53: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:08:56,968 INFO L273 TraceCheckUtils]: 54: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {4395#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:08:56,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:08:56,968 INFO L273 TraceCheckUtils]: 57: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {4395#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:08:56,969 INFO L273 TraceCheckUtils]: 59: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:08:56,969 INFO L273 TraceCheckUtils]: 60: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,969 INFO L273 TraceCheckUtils]: 61: Hoare triple {4395#true} assume !(~i~0 < 1000); {4395#true} is VALID [2018-11-14 17:08:56,969 INFO L273 TraceCheckUtils]: 62: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 17:08:56,969 INFO L273 TraceCheckUtils]: 63: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,969 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4395#true} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 17:08:56,969 INFO L273 TraceCheckUtils]: 65: Hoare triple {4396#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4396#false} is VALID [2018-11-14 17:08:56,970 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:56,970 INFO L273 TraceCheckUtils]: 67: Hoare triple {4396#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 17:08:56,970 INFO L273 TraceCheckUtils]: 68: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 17:08:56,970 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:56,970 INFO L273 TraceCheckUtils]: 70: Hoare triple {4396#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 17:08:56,970 INFO L273 TraceCheckUtils]: 71: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 17:08:56,971 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:56,971 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 999); {4396#false} is VALID [2018-11-14 17:08:56,971 INFO L273 TraceCheckUtils]: 74: Hoare triple {4396#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {4396#false} is VALID [2018-11-14 17:08:56,971 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4395#true} is VALID [2018-11-14 17:08:56,971 INFO L273 TraceCheckUtils]: 76: Hoare triple {4395#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4395#true} is VALID [2018-11-14 17:08:56,971 INFO L273 TraceCheckUtils]: 77: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,971 INFO L273 TraceCheckUtils]: 78: Hoare triple {4395#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:08:56,972 INFO L273 TraceCheckUtils]: 79: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:08:56,972 INFO L273 TraceCheckUtils]: 80: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,972 INFO L273 TraceCheckUtils]: 81: Hoare triple {4395#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:08:56,972 INFO L273 TraceCheckUtils]: 82: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:08:56,972 INFO L273 TraceCheckUtils]: 83: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,972 INFO L273 TraceCheckUtils]: 84: Hoare triple {4395#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4395#true} is VALID [2018-11-14 17:08:56,973 INFO L273 TraceCheckUtils]: 85: Hoare triple {4395#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4395#true} is VALID [2018-11-14 17:08:56,973 INFO L273 TraceCheckUtils]: 86: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,973 INFO L273 TraceCheckUtils]: 87: Hoare triple {4395#true} assume !(~i~0 < 1000); {4395#true} is VALID [2018-11-14 17:08:56,973 INFO L273 TraceCheckUtils]: 88: Hoare triple {4395#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4395#true} is VALID [2018-11-14 17:08:56,973 INFO L273 TraceCheckUtils]: 89: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:56,973 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4395#true} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 17:08:56,973 INFO L273 TraceCheckUtils]: 91: Hoare triple {4396#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4396#false} is VALID [2018-11-14 17:08:56,974 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 17:08:56,974 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 17:08:56,982 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:08:56,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:56,983 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-14 17:08:56,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:08:57,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:08:57,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:57,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:57,201 INFO L256 TraceCheckUtils]: 0: Hoare triple {4395#true} call ULTIMATE.init(); {4395#true} is VALID [2018-11-14 17:08:57,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {4395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4395#true} is VALID [2018-11-14 17:08:57,201 INFO L273 TraceCheckUtils]: 2: Hoare triple {4395#true} assume true; {4395#true} is VALID [2018-11-14 17:08:57,201 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4395#true} {4395#true} #69#return; {4395#true} is VALID [2018-11-14 17:08:57,202 INFO L256 TraceCheckUtils]: 4: Hoare triple {4395#true} call #t~ret13 := main(); {4395#true} is VALID [2018-11-14 17:08:57,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {4395#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:57,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {4424#(<= main_~i~1 0)} assume true; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:57,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {4424#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4424#(<= main_~i~1 0)} is VALID [2018-11-14 17:08:57,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {4424#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:57,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {4398#(<= main_~i~1 1)} assume true; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:57,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {4398#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4398#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:57,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {4398#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:57,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {4399#(<= main_~i~1 2)} assume true; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:57,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {4399#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4399#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:57,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {4399#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:57,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {4400#(<= main_~i~1 3)} assume true; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:57,208 INFO L273 TraceCheckUtils]: 16: Hoare triple {4400#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4400#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:57,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {4400#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:57,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {4401#(<= main_~i~1 4)} assume true; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:57,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {4401#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4401#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:57,211 INFO L273 TraceCheckUtils]: 20: Hoare triple {4401#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:57,211 INFO L273 TraceCheckUtils]: 21: Hoare triple {4402#(<= main_~i~1 5)} assume true; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:57,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {4402#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4402#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:57,213 INFO L273 TraceCheckUtils]: 23: Hoare triple {4402#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:57,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {4403#(<= main_~i~1 6)} assume true; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:57,214 INFO L273 TraceCheckUtils]: 25: Hoare triple {4403#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4403#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:57,215 INFO L273 TraceCheckUtils]: 26: Hoare triple {4403#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:57,215 INFO L273 TraceCheckUtils]: 27: Hoare triple {4404#(<= main_~i~1 7)} assume true; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:57,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {4404#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {4404#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:57,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {4404#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:57,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {4405#(<= main_~i~1 8)} assume true; {4405#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:57,218 INFO L273 TraceCheckUtils]: 31: Hoare triple {4405#(<= main_~i~1 8)} assume !(~i~1 < 1000); {4396#false} is VALID [2018-11-14 17:08:57,218 INFO L256 TraceCheckUtils]: 32: Hoare triple {4396#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 17:08:57,219 INFO L273 TraceCheckUtils]: 33: Hoare triple {4396#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 17:08:57,219 INFO L273 TraceCheckUtils]: 34: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,219 INFO L273 TraceCheckUtils]: 35: Hoare triple {4396#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:08:57,219 INFO L273 TraceCheckUtils]: 36: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:08:57,220 INFO L273 TraceCheckUtils]: 37: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,220 INFO L273 TraceCheckUtils]: 38: Hoare triple {4396#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:08:57,220 INFO L273 TraceCheckUtils]: 39: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:08:57,220 INFO L273 TraceCheckUtils]: 40: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,221 INFO L273 TraceCheckUtils]: 41: Hoare triple {4396#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:08:57,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:08:57,221 INFO L273 TraceCheckUtils]: 43: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,221 INFO L273 TraceCheckUtils]: 44: Hoare triple {4396#false} assume !(~i~0 < 1000); {4396#false} is VALID [2018-11-14 17:08:57,222 INFO L273 TraceCheckUtils]: 45: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 17:08:57,222 INFO L273 TraceCheckUtils]: 46: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,222 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4396#false} {4396#false} #73#return; {4396#false} is VALID [2018-11-14 17:08:57,222 INFO L273 TraceCheckUtils]: 48: Hoare triple {4396#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {4396#false} is VALID [2018-11-14 17:08:57,223 INFO L256 TraceCheckUtils]: 49: Hoare triple {4396#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 17:08:57,223 INFO L273 TraceCheckUtils]: 50: Hoare triple {4396#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 17:08:57,223 INFO L273 TraceCheckUtils]: 51: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,223 INFO L273 TraceCheckUtils]: 52: Hoare triple {4396#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:08:57,223 INFO L273 TraceCheckUtils]: 53: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:08:57,223 INFO L273 TraceCheckUtils]: 54: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,224 INFO L273 TraceCheckUtils]: 55: Hoare triple {4396#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:08:57,224 INFO L273 TraceCheckUtils]: 56: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:08:57,224 INFO L273 TraceCheckUtils]: 57: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,224 INFO L273 TraceCheckUtils]: 58: Hoare triple {4396#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:08:57,224 INFO L273 TraceCheckUtils]: 59: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:08:57,224 INFO L273 TraceCheckUtils]: 60: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,225 INFO L273 TraceCheckUtils]: 61: Hoare triple {4396#false} assume !(~i~0 < 1000); {4396#false} is VALID [2018-11-14 17:08:57,225 INFO L273 TraceCheckUtils]: 62: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 17:08:57,225 INFO L273 TraceCheckUtils]: 63: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,225 INFO L268 TraceCheckUtils]: 64: Hoare quadruple {4396#false} {4396#false} #75#return; {4396#false} is VALID [2018-11-14 17:08:57,225 INFO L273 TraceCheckUtils]: 65: Hoare triple {4396#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {4396#false} is VALID [2018-11-14 17:08:57,226 INFO L273 TraceCheckUtils]: 66: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,226 INFO L273 TraceCheckUtils]: 67: Hoare triple {4396#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 17:08:57,226 INFO L273 TraceCheckUtils]: 68: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 17:08:57,226 INFO L273 TraceCheckUtils]: 69: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,226 INFO L273 TraceCheckUtils]: 70: Hoare triple {4396#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {4396#false} is VALID [2018-11-14 17:08:57,226 INFO L273 TraceCheckUtils]: 71: Hoare triple {4396#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {4396#false} is VALID [2018-11-14 17:08:57,226 INFO L273 TraceCheckUtils]: 72: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,227 INFO L273 TraceCheckUtils]: 73: Hoare triple {4396#false} assume !(~i~2 < 999); {4396#false} is VALID [2018-11-14 17:08:57,227 INFO L273 TraceCheckUtils]: 74: Hoare triple {4396#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {4396#false} is VALID [2018-11-14 17:08:57,227 INFO L256 TraceCheckUtils]: 75: Hoare triple {4396#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {4396#false} is VALID [2018-11-14 17:08:57,227 INFO L273 TraceCheckUtils]: 76: Hoare triple {4396#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {4396#false} is VALID [2018-11-14 17:08:57,227 INFO L273 TraceCheckUtils]: 77: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,227 INFO L273 TraceCheckUtils]: 78: Hoare triple {4396#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:08:57,228 INFO L273 TraceCheckUtils]: 79: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:08:57,228 INFO L273 TraceCheckUtils]: 80: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,228 INFO L273 TraceCheckUtils]: 81: Hoare triple {4396#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:08:57,228 INFO L273 TraceCheckUtils]: 82: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:08:57,228 INFO L273 TraceCheckUtils]: 83: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,228 INFO L273 TraceCheckUtils]: 84: Hoare triple {4396#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {4396#false} is VALID [2018-11-14 17:08:57,228 INFO L273 TraceCheckUtils]: 85: Hoare triple {4396#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {4396#false} is VALID [2018-11-14 17:08:57,229 INFO L273 TraceCheckUtils]: 86: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,229 INFO L273 TraceCheckUtils]: 87: Hoare triple {4396#false} assume !(~i~0 < 1000); {4396#false} is VALID [2018-11-14 17:08:57,229 INFO L273 TraceCheckUtils]: 88: Hoare triple {4396#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {4396#false} is VALID [2018-11-14 17:08:57,229 INFO L273 TraceCheckUtils]: 89: Hoare triple {4396#false} assume true; {4396#false} is VALID [2018-11-14 17:08:57,229 INFO L268 TraceCheckUtils]: 90: Hoare quadruple {4396#false} {4396#false} #77#return; {4396#false} is VALID [2018-11-14 17:08:57,229 INFO L273 TraceCheckUtils]: 91: Hoare triple {4396#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {4396#false} is VALID [2018-11-14 17:08:57,230 INFO L273 TraceCheckUtils]: 92: Hoare triple {4396#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {4396#false} is VALID [2018-11-14 17:08:57,230 INFO L273 TraceCheckUtils]: 93: Hoare triple {4396#false} assume !false; {4396#false} is VALID [2018-11-14 17:08:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:08:57,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:57,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 17:08:57,260 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 17:08:57,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:57,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:08:57,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:57,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:08:57,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:08:57,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:08:57,355 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 12 states. [2018-11-14 17:08:57,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:57,672 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2018-11-14 17:08:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:08:57,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-11-14 17:08:57,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:08:57,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 17:08:57,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:08:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2018-11-14 17:08:57,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2018-11-14 17:08:57,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:08:57,761 INFO L225 Difference]: With dead ends: 102 [2018-11-14 17:08:57,761 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:08:57,762 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:08:57,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:08:57,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-14 17:08:57,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:08:57,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 68 states. [2018-11-14 17:08:57,801 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 68 states. [2018-11-14 17:08:57,801 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 68 states. [2018-11-14 17:08:57,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:57,803 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 17:08:57,803 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 17:08:57,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:57,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:57,803 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 69 states. [2018-11-14 17:08:57,803 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 69 states. [2018-11-14 17:08:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:57,805 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-14 17:08:57,805 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-14 17:08:57,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:08:57,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:08:57,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:08:57,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:08:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 17:08:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-14 17:08:57,807 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 94 [2018-11-14 17:08:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:08:57,807 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-14 17:08:57,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:08:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-14 17:08:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-14 17:08:57,808 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:08:57,809 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 9, 9, 9, 9, 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] [2018-11-14 17:08:57,809 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:08:57,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:08:57,809 INFO L82 PathProgramCache]: Analyzing trace with hash 8255871, now seen corresponding path program 9 times [2018-11-14 17:08:57,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:08:57,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:08:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:57,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:08:57,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:08:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:58,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 17:08:58,189 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5057#true} is VALID [2018-11-14 17:08:58,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,189 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 17:08:58,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 17:08:58,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5059#(= main_~i~1 0)} is VALID [2018-11-14 17:08:58,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {5059#(= main_~i~1 0)} assume true; {5059#(= main_~i~1 0)} is VALID [2018-11-14 17:08:58,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {5059#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5059#(= main_~i~1 0)} is VALID [2018-11-14 17:08:58,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {5059#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:58,192 INFO L273 TraceCheckUtils]: 9: Hoare triple {5060#(<= main_~i~1 1)} assume true; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:58,192 INFO L273 TraceCheckUtils]: 10: Hoare triple {5060#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5060#(<= main_~i~1 1)} is VALID [2018-11-14 17:08:58,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {5060#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:58,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {5061#(<= main_~i~1 2)} assume true; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:58,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {5061#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5061#(<= main_~i~1 2)} is VALID [2018-11-14 17:08:58,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {5061#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:58,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {5062#(<= main_~i~1 3)} assume true; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:58,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {5062#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5062#(<= main_~i~1 3)} is VALID [2018-11-14 17:08:58,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {5062#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:58,196 INFO L273 TraceCheckUtils]: 18: Hoare triple {5063#(<= main_~i~1 4)} assume true; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:58,197 INFO L273 TraceCheckUtils]: 19: Hoare triple {5063#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5063#(<= main_~i~1 4)} is VALID [2018-11-14 17:08:58,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {5063#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:58,198 INFO L273 TraceCheckUtils]: 21: Hoare triple {5064#(<= main_~i~1 5)} assume true; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:58,199 INFO L273 TraceCheckUtils]: 22: Hoare triple {5064#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5064#(<= main_~i~1 5)} is VALID [2018-11-14 17:08:58,199 INFO L273 TraceCheckUtils]: 23: Hoare triple {5064#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:58,200 INFO L273 TraceCheckUtils]: 24: Hoare triple {5065#(<= main_~i~1 6)} assume true; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:58,219 INFO L273 TraceCheckUtils]: 25: Hoare triple {5065#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5065#(<= main_~i~1 6)} is VALID [2018-11-14 17:08:58,219 INFO L273 TraceCheckUtils]: 26: Hoare triple {5065#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:58,220 INFO L273 TraceCheckUtils]: 27: Hoare triple {5066#(<= main_~i~1 7)} assume true; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:58,220 INFO L273 TraceCheckUtils]: 28: Hoare triple {5066#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5066#(<= main_~i~1 7)} is VALID [2018-11-14 17:08:58,220 INFO L273 TraceCheckUtils]: 29: Hoare triple {5066#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:58,221 INFO L273 TraceCheckUtils]: 30: Hoare triple {5067#(<= main_~i~1 8)} assume true; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:58,221 INFO L273 TraceCheckUtils]: 31: Hoare triple {5067#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5067#(<= main_~i~1 8)} is VALID [2018-11-14 17:08:58,222 INFO L273 TraceCheckUtils]: 32: Hoare triple {5067#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5068#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:58,222 INFO L273 TraceCheckUtils]: 33: Hoare triple {5068#(<= main_~i~1 9)} assume true; {5068#(<= main_~i~1 9)} is VALID [2018-11-14 17:08:58,222 INFO L273 TraceCheckUtils]: 34: Hoare triple {5068#(<= main_~i~1 9)} assume !(~i~1 < 1000); {5058#false} is VALID [2018-11-14 17:08:58,222 INFO L256 TraceCheckUtils]: 35: Hoare triple {5058#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:08:58,223 INFO L273 TraceCheckUtils]: 36: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:08:58,223 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,223 INFO L273 TraceCheckUtils]: 38: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,223 INFO L273 TraceCheckUtils]: 39: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,223 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,223 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,224 INFO L273 TraceCheckUtils]: 42: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,224 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,224 INFO L273 TraceCheckUtils]: 44: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,224 INFO L273 TraceCheckUtils]: 45: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,224 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,225 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 1000); {5057#true} is VALID [2018-11-14 17:08:58,225 INFO L273 TraceCheckUtils]: 48: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:08:58,225 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,225 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5058#false} #73#return; {5058#false} is VALID [2018-11-14 17:08:58,225 INFO L273 TraceCheckUtils]: 51: Hoare triple {5058#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5058#false} is VALID [2018-11-14 17:08:58,226 INFO L256 TraceCheckUtils]: 52: Hoare triple {5058#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:08:58,226 INFO L273 TraceCheckUtils]: 53: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:08:58,226 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,226 INFO L273 TraceCheckUtils]: 55: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,226 INFO L273 TraceCheckUtils]: 56: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,226 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,226 INFO L273 TraceCheckUtils]: 58: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,226 INFO L273 TraceCheckUtils]: 59: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,227 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,227 INFO L273 TraceCheckUtils]: 61: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,227 INFO L273 TraceCheckUtils]: 62: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,227 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,227 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 1000); {5057#true} is VALID [2018-11-14 17:08:58,227 INFO L273 TraceCheckUtils]: 65: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:08:58,227 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,227 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5058#false} #75#return; {5058#false} is VALID [2018-11-14 17:08:58,228 INFO L273 TraceCheckUtils]: 68: Hoare triple {5058#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5058#false} is VALID [2018-11-14 17:08:58,228 INFO L273 TraceCheckUtils]: 69: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:08:58,228 INFO L273 TraceCheckUtils]: 70: Hoare triple {5058#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5058#false} is VALID [2018-11-14 17:08:58,228 INFO L273 TraceCheckUtils]: 71: Hoare triple {5058#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5058#false} is VALID [2018-11-14 17:08:58,228 INFO L273 TraceCheckUtils]: 72: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:08:58,228 INFO L273 TraceCheckUtils]: 73: Hoare triple {5058#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5058#false} is VALID [2018-11-14 17:08:58,228 INFO L273 TraceCheckUtils]: 74: Hoare triple {5058#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5058#false} is VALID [2018-11-14 17:08:58,228 INFO L273 TraceCheckUtils]: 75: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:08:58,229 INFO L273 TraceCheckUtils]: 76: Hoare triple {5058#false} assume !(~i~2 < 999); {5058#false} is VALID [2018-11-14 17:08:58,229 INFO L273 TraceCheckUtils]: 77: Hoare triple {5058#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {5058#false} is VALID [2018-11-14 17:08:58,229 INFO L256 TraceCheckUtils]: 78: Hoare triple {5058#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:08:58,229 INFO L273 TraceCheckUtils]: 79: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:08:58,229 INFO L273 TraceCheckUtils]: 80: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,229 INFO L273 TraceCheckUtils]: 81: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,229 INFO L273 TraceCheckUtils]: 82: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,229 INFO L273 TraceCheckUtils]: 83: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,229 INFO L273 TraceCheckUtils]: 84: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,230 INFO L273 TraceCheckUtils]: 85: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,230 INFO L273 TraceCheckUtils]: 86: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,230 INFO L273 TraceCheckUtils]: 87: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,230 INFO L273 TraceCheckUtils]: 88: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,230 INFO L273 TraceCheckUtils]: 89: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,230 INFO L273 TraceCheckUtils]: 90: Hoare triple {5057#true} assume !(~i~0 < 1000); {5057#true} is VALID [2018-11-14 17:08:58,230 INFO L273 TraceCheckUtils]: 91: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:08:58,230 INFO L273 TraceCheckUtils]: 92: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,231 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5057#true} {5058#false} #77#return; {5058#false} is VALID [2018-11-14 17:08:58,231 INFO L273 TraceCheckUtils]: 94: Hoare triple {5058#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5058#false} is VALID [2018-11-14 17:08:58,231 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 17:08:58,231 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 17:08:58,235 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-14 17:08:58,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:08:58,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 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-14 17:08:58,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:08:58,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 17:08:58,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:08:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:08:58,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:08:58,401 INFO L256 TraceCheckUtils]: 0: Hoare triple {5057#true} call ULTIMATE.init(); {5057#true} is VALID [2018-11-14 17:08:58,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {5057#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5057#true} is VALID [2018-11-14 17:08:58,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5057#true} {5057#true} #69#return; {5057#true} is VALID [2018-11-14 17:08:58,402 INFO L256 TraceCheckUtils]: 4: Hoare triple {5057#true} call #t~ret13 := main(); {5057#true} is VALID [2018-11-14 17:08:58,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {5057#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5057#true} is VALID [2018-11-14 17:08:58,402 INFO L273 TraceCheckUtils]: 6: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {5057#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:08:58,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:08:58,403 INFO L273 TraceCheckUtils]: 9: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {5057#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:08:58,403 INFO L273 TraceCheckUtils]: 11: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:08:58,403 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,403 INFO L273 TraceCheckUtils]: 13: Hoare triple {5057#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:08:58,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:08:58,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {5057#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:08:58,404 INFO L273 TraceCheckUtils]: 17: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:08:58,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,404 INFO L273 TraceCheckUtils]: 19: Hoare triple {5057#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:08:58,404 INFO L273 TraceCheckUtils]: 20: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:08:58,404 INFO L273 TraceCheckUtils]: 21: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {5057#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:08:58,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:08:58,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {5057#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:08:58,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:08:58,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,405 INFO L273 TraceCheckUtils]: 28: Hoare triple {5057#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:08:58,405 INFO L273 TraceCheckUtils]: 29: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:08:58,405 INFO L273 TraceCheckUtils]: 30: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {5057#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5057#true} is VALID [2018-11-14 17:08:58,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {5057#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5057#true} is VALID [2018-11-14 17:08:58,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {5057#true} assume !(~i~1 < 1000); {5057#true} is VALID [2018-11-14 17:08:58,406 INFO L256 TraceCheckUtils]: 35: Hoare triple {5057#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:08:58,406 INFO L273 TraceCheckUtils]: 36: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:08:58,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,406 INFO L273 TraceCheckUtils]: 38: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,406 INFO L273 TraceCheckUtils]: 39: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,406 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,407 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,407 INFO L273 TraceCheckUtils]: 42: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,407 INFO L273 TraceCheckUtils]: 46: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,407 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#true} assume !(~i~0 < 1000); {5057#true} is VALID [2018-11-14 17:08:58,407 INFO L273 TraceCheckUtils]: 48: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:08:58,408 INFO L273 TraceCheckUtils]: 49: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,408 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5057#true} {5057#true} #73#return; {5057#true} is VALID [2018-11-14 17:08:58,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {5057#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5057#true} is VALID [2018-11-14 17:08:58,408 INFO L256 TraceCheckUtils]: 52: Hoare triple {5057#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:08:58,408 INFO L273 TraceCheckUtils]: 53: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5057#true} is VALID [2018-11-14 17:08:58,408 INFO L273 TraceCheckUtils]: 54: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,408 INFO L273 TraceCheckUtils]: 55: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,408 INFO L273 TraceCheckUtils]: 56: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,408 INFO L273 TraceCheckUtils]: 57: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,409 INFO L273 TraceCheckUtils]: 58: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,409 INFO L273 TraceCheckUtils]: 59: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,409 INFO L273 TraceCheckUtils]: 60: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,409 INFO L273 TraceCheckUtils]: 61: Hoare triple {5057#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5057#true} is VALID [2018-11-14 17:08:58,409 INFO L273 TraceCheckUtils]: 62: Hoare triple {5057#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5057#true} is VALID [2018-11-14 17:08:58,409 INFO L273 TraceCheckUtils]: 63: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,409 INFO L273 TraceCheckUtils]: 64: Hoare triple {5057#true} assume !(~i~0 < 1000); {5057#true} is VALID [2018-11-14 17:08:58,409 INFO L273 TraceCheckUtils]: 65: Hoare triple {5057#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5057#true} is VALID [2018-11-14 17:08:58,410 INFO L273 TraceCheckUtils]: 66: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,410 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {5057#true} {5057#true} #75#return; {5057#true} is VALID [2018-11-14 17:08:58,410 INFO L273 TraceCheckUtils]: 68: Hoare triple {5057#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5057#true} is VALID [2018-11-14 17:08:58,410 INFO L273 TraceCheckUtils]: 69: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,410 INFO L273 TraceCheckUtils]: 70: Hoare triple {5057#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5057#true} is VALID [2018-11-14 17:08:58,410 INFO L273 TraceCheckUtils]: 71: Hoare triple {5057#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5057#true} is VALID [2018-11-14 17:08:58,410 INFO L273 TraceCheckUtils]: 72: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,410 INFO L273 TraceCheckUtils]: 73: Hoare triple {5057#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5057#true} is VALID [2018-11-14 17:08:58,410 INFO L273 TraceCheckUtils]: 74: Hoare triple {5057#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5057#true} is VALID [2018-11-14 17:08:58,411 INFO L273 TraceCheckUtils]: 75: Hoare triple {5057#true} assume true; {5057#true} is VALID [2018-11-14 17:08:58,411 INFO L273 TraceCheckUtils]: 76: Hoare triple {5057#true} assume !(~i~2 < 999); {5057#true} is VALID [2018-11-14 17:08:58,411 INFO L273 TraceCheckUtils]: 77: Hoare triple {5057#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {5057#true} is VALID [2018-11-14 17:08:58,411 INFO L256 TraceCheckUtils]: 78: Hoare triple {5057#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5057#true} is VALID [2018-11-14 17:08:58,411 INFO L273 TraceCheckUtils]: 79: Hoare triple {5057#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5309#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:58,412 INFO L273 TraceCheckUtils]: 80: Hoare triple {5309#(<= xor_~i~0 1)} assume true; {5309#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:58,412 INFO L273 TraceCheckUtils]: 81: Hoare triple {5309#(<= xor_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5309#(<= xor_~i~0 1)} is VALID [2018-11-14 17:08:58,412 INFO L273 TraceCheckUtils]: 82: Hoare triple {5309#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5319#(<= xor_~i~0 2)} is VALID [2018-11-14 17:08:58,413 INFO L273 TraceCheckUtils]: 83: Hoare triple {5319#(<= xor_~i~0 2)} assume true; {5319#(<= xor_~i~0 2)} is VALID [2018-11-14 17:08:58,413 INFO L273 TraceCheckUtils]: 84: Hoare triple {5319#(<= xor_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5319#(<= xor_~i~0 2)} is VALID [2018-11-14 17:08:58,414 INFO L273 TraceCheckUtils]: 85: Hoare triple {5319#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5329#(<= xor_~i~0 3)} is VALID [2018-11-14 17:08:58,414 INFO L273 TraceCheckUtils]: 86: Hoare triple {5329#(<= xor_~i~0 3)} assume true; {5329#(<= xor_~i~0 3)} is VALID [2018-11-14 17:08:58,414 INFO L273 TraceCheckUtils]: 87: Hoare triple {5329#(<= xor_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5329#(<= xor_~i~0 3)} is VALID [2018-11-14 17:08:58,415 INFO L273 TraceCheckUtils]: 88: Hoare triple {5329#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5339#(<= xor_~i~0 4)} is VALID [2018-11-14 17:08:58,415 INFO L273 TraceCheckUtils]: 89: Hoare triple {5339#(<= xor_~i~0 4)} assume true; {5339#(<= xor_~i~0 4)} is VALID [2018-11-14 17:08:58,416 INFO L273 TraceCheckUtils]: 90: Hoare triple {5339#(<= xor_~i~0 4)} assume !(~i~0 < 1000); {5058#false} is VALID [2018-11-14 17:08:58,416 INFO L273 TraceCheckUtils]: 91: Hoare triple {5058#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5058#false} is VALID [2018-11-14 17:08:58,416 INFO L273 TraceCheckUtils]: 92: Hoare triple {5058#false} assume true; {5058#false} is VALID [2018-11-14 17:08:58,416 INFO L268 TraceCheckUtils]: 93: Hoare quadruple {5058#false} {5057#true} #77#return; {5058#false} is VALID [2018-11-14 17:08:58,416 INFO L273 TraceCheckUtils]: 94: Hoare triple {5058#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5058#false} is VALID [2018-11-14 17:08:58,417 INFO L273 TraceCheckUtils]: 95: Hoare triple {5058#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5058#false} is VALID [2018-11-14 17:08:58,417 INFO L273 TraceCheckUtils]: 96: Hoare triple {5058#false} assume !false; {5058#false} is VALID [2018-11-14 17:08:58,422 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 88 proven. 15 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-14 17:08:58,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:08:58,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 16 [2018-11-14 17:08:58,443 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 17:08:58,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:08:58,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 17:08:58,526 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-14 17:08:58,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 17:08:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 17:08:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:08:58,528 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 16 states. [2018-11-14 17:08:58,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:08:58,966 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-14 17:08:58,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:08:58,966 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 97 [2018-11-14 17:08:58,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:08:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:08:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 17:08:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 17:08:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2018-11-14 17:08:58,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 103 transitions. [2018-11-14 17:08:59,855 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-14 17:08:59,857 INFO L225 Difference]: With dead ends: 109 [2018-11-14 17:08:59,857 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:08:59,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:08:59,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:09:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-14 17:09:00,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:00,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-14 17:09:00,325 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-14 17:09:00,325 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-14 17:09:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:00,331 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 17:09:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 17:09:00,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:00,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:00,332 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-14 17:09:00,332 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-14 17:09:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:00,334 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-11-14 17:09:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-14 17:09:00,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:00,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:00,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:00,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 17:09:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2018-11-14 17:09:00,337 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 97 [2018-11-14 17:09:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:00,337 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2018-11-14 17:09:00,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 17:09:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2018-11-14 17:09:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 17:09:00,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:00,338 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 11, 10, 10, 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] [2018-11-14 17:09:00,339 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:00,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1234880144, now seen corresponding path program 10 times [2018-11-14 17:09:00,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:00,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:00,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:00,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:00,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:00,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 17:09:00,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {5763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5763#true} is VALID [2018-11-14 17:09:00,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 17:09:00,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 17:09:00,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {5763#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5765#(= main_~i~1 0)} is VALID [2018-11-14 17:09:00,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {5765#(= main_~i~1 0)} assume true; {5765#(= main_~i~1 0)} is VALID [2018-11-14 17:09:00,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {5765#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5765#(= main_~i~1 0)} is VALID [2018-11-14 17:09:00,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {5765#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:00,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:00,622 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:00,622 INFO L273 TraceCheckUtils]: 11: Hoare triple {5766#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:00,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:00,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {5767#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:00,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {5767#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:00,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:00,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {5768#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:00,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {5768#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:00,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:00,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {5769#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:00,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {5769#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:00,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:00,630 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:00,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:00,631 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:00,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {5771#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:00,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {5771#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:00,632 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:00,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {5772#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:00,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {5772#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:00,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:00,635 INFO L273 TraceCheckUtils]: 31: Hoare triple {5773#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:00,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {5773#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:00,636 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:00,636 INFO L273 TraceCheckUtils]: 34: Hoare triple {5774#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:00,637 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:00,638 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:00,638 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 1000); {5764#false} is VALID [2018-11-14 17:09:00,638 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 17:09:00,639 INFO L273 TraceCheckUtils]: 39: Hoare triple {5763#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 17:09:00,639 INFO L273 TraceCheckUtils]: 40: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,639 INFO L273 TraceCheckUtils]: 41: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,639 INFO L273 TraceCheckUtils]: 42: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,639 INFO L273 TraceCheckUtils]: 43: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,640 INFO L273 TraceCheckUtils]: 44: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,640 INFO L273 TraceCheckUtils]: 45: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,640 INFO L273 TraceCheckUtils]: 46: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,640 INFO L273 TraceCheckUtils]: 47: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,640 INFO L273 TraceCheckUtils]: 48: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,641 INFO L273 TraceCheckUtils]: 49: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,641 INFO L273 TraceCheckUtils]: 50: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,641 INFO L273 TraceCheckUtils]: 51: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,641 INFO L273 TraceCheckUtils]: 52: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,641 INFO L273 TraceCheckUtils]: 53: Hoare triple {5763#true} assume !(~i~0 < 1000); {5763#true} is VALID [2018-11-14 17:09:00,641 INFO L273 TraceCheckUtils]: 54: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 17:09:00,642 INFO L273 TraceCheckUtils]: 55: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,642 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5763#true} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 17:09:00,642 INFO L273 TraceCheckUtils]: 57: Hoare triple {5764#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5764#false} is VALID [2018-11-14 17:09:00,642 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 17:09:00,642 INFO L273 TraceCheckUtils]: 59: Hoare triple {5763#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 17:09:00,642 INFO L273 TraceCheckUtils]: 60: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,643 INFO L273 TraceCheckUtils]: 61: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,643 INFO L273 TraceCheckUtils]: 62: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,643 INFO L273 TraceCheckUtils]: 63: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,643 INFO L273 TraceCheckUtils]: 64: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,643 INFO L273 TraceCheckUtils]: 65: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,644 INFO L273 TraceCheckUtils]: 66: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,644 INFO L273 TraceCheckUtils]: 67: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,644 INFO L273 TraceCheckUtils]: 68: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,644 INFO L273 TraceCheckUtils]: 69: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,644 INFO L273 TraceCheckUtils]: 70: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,644 INFO L273 TraceCheckUtils]: 71: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,645 INFO L273 TraceCheckUtils]: 72: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,645 INFO L273 TraceCheckUtils]: 73: Hoare triple {5763#true} assume !(~i~0 < 1000); {5763#true} is VALID [2018-11-14 17:09:00,645 INFO L273 TraceCheckUtils]: 74: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 17:09:00,645 INFO L273 TraceCheckUtils]: 75: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,645 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5763#true} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 17:09:00,646 INFO L273 TraceCheckUtils]: 77: Hoare triple {5764#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5764#false} is VALID [2018-11-14 17:09:00,646 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,646 INFO L273 TraceCheckUtils]: 79: Hoare triple {5764#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 17:09:00,646 INFO L273 TraceCheckUtils]: 80: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 17:09:00,646 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,646 INFO L273 TraceCheckUtils]: 82: Hoare triple {5764#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 17:09:00,647 INFO L273 TraceCheckUtils]: 83: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 17:09:00,647 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,647 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 999); {5764#false} is VALID [2018-11-14 17:09:00,647 INFO L273 TraceCheckUtils]: 86: Hoare triple {5764#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {5764#false} is VALID [2018-11-14 17:09:00,647 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5763#true} is VALID [2018-11-14 17:09:00,647 INFO L273 TraceCheckUtils]: 88: Hoare triple {5763#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5763#true} is VALID [2018-11-14 17:09:00,648 INFO L273 TraceCheckUtils]: 89: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,648 INFO L273 TraceCheckUtils]: 90: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,648 INFO L273 TraceCheckUtils]: 91: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,648 INFO L273 TraceCheckUtils]: 92: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,648 INFO L273 TraceCheckUtils]: 93: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,648 INFO L273 TraceCheckUtils]: 94: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,649 INFO L273 TraceCheckUtils]: 95: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,649 INFO L273 TraceCheckUtils]: 96: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,649 INFO L273 TraceCheckUtils]: 97: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,649 INFO L273 TraceCheckUtils]: 98: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,649 INFO L273 TraceCheckUtils]: 99: Hoare triple {5763#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5763#true} is VALID [2018-11-14 17:09:00,649 INFO L273 TraceCheckUtils]: 100: Hoare triple {5763#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5763#true} is VALID [2018-11-14 17:09:00,650 INFO L273 TraceCheckUtils]: 101: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,650 INFO L273 TraceCheckUtils]: 102: Hoare triple {5763#true} assume !(~i~0 < 1000); {5763#true} is VALID [2018-11-14 17:09:00,650 INFO L273 TraceCheckUtils]: 103: Hoare triple {5763#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5763#true} is VALID [2018-11-14 17:09:00,650 INFO L273 TraceCheckUtils]: 104: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,650 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5763#true} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 17:09:00,650 INFO L273 TraceCheckUtils]: 106: Hoare triple {5764#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5764#false} is VALID [2018-11-14 17:09:00,651 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 17:09:00,651 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 17:09:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 17:09:00,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:00,658 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-14 17:09:00,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:09:00,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:09:00,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:00,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:00,919 INFO L256 TraceCheckUtils]: 0: Hoare triple {5763#true} call ULTIMATE.init(); {5763#true} is VALID [2018-11-14 17:09:00,919 INFO L273 TraceCheckUtils]: 1: Hoare triple {5763#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5763#true} is VALID [2018-11-14 17:09:00,919 INFO L273 TraceCheckUtils]: 2: Hoare triple {5763#true} assume true; {5763#true} is VALID [2018-11-14 17:09:00,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5763#true} {5763#true} #69#return; {5763#true} is VALID [2018-11-14 17:09:00,920 INFO L256 TraceCheckUtils]: 4: Hoare triple {5763#true} call #t~ret13 := main(); {5763#true} is VALID [2018-11-14 17:09:00,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {5763#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:00,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {5794#(<= main_~i~1 0)} assume true; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:00,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {5794#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5794#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:00,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {5794#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:00,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {5766#(<= main_~i~1 1)} assume true; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:00,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {5766#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5766#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:00,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {5766#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:00,923 INFO L273 TraceCheckUtils]: 12: Hoare triple {5767#(<= main_~i~1 2)} assume true; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:00,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {5767#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5767#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:00,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {5767#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:00,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {5768#(<= main_~i~1 3)} assume true; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:00,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {5768#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5768#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:00,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {5768#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:00,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {5769#(<= main_~i~1 4)} assume true; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:00,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {5769#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5769#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:00,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {5769#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:00,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(<= main_~i~1 5)} assume true; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:00,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5770#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:00,929 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:00,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {5771#(<= main_~i~1 6)} assume true; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:00,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {5771#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5771#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:00,931 INFO L273 TraceCheckUtils]: 26: Hoare triple {5771#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:00,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {5772#(<= main_~i~1 7)} assume true; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:00,932 INFO L273 TraceCheckUtils]: 28: Hoare triple {5772#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5772#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:00,933 INFO L273 TraceCheckUtils]: 29: Hoare triple {5772#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:00,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {5773#(<= main_~i~1 8)} assume true; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:00,934 INFO L273 TraceCheckUtils]: 31: Hoare triple {5773#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5773#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:00,934 INFO L273 TraceCheckUtils]: 32: Hoare triple {5773#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:00,935 INFO L273 TraceCheckUtils]: 33: Hoare triple {5774#(<= main_~i~1 9)} assume true; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:00,935 INFO L273 TraceCheckUtils]: 34: Hoare triple {5774#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {5774#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:00,936 INFO L273 TraceCheckUtils]: 35: Hoare triple {5774#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:00,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(<= main_~i~1 10)} assume true; {5775#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:00,937 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(<= main_~i~1 10)} assume !(~i~1 < 1000); {5764#false} is VALID [2018-11-14 17:09:00,937 INFO L256 TraceCheckUtils]: 38: Hoare triple {5764#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 17:09:00,938 INFO L273 TraceCheckUtils]: 39: Hoare triple {5764#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 17:09:00,938 INFO L273 TraceCheckUtils]: 40: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,938 INFO L273 TraceCheckUtils]: 41: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,938 INFO L273 TraceCheckUtils]: 42: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,938 INFO L273 TraceCheckUtils]: 43: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,939 INFO L273 TraceCheckUtils]: 44: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,939 INFO L273 TraceCheckUtils]: 45: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,939 INFO L273 TraceCheckUtils]: 46: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,939 INFO L273 TraceCheckUtils]: 47: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,939 INFO L273 TraceCheckUtils]: 48: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,940 INFO L273 TraceCheckUtils]: 49: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,940 INFO L273 TraceCheckUtils]: 50: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,940 INFO L273 TraceCheckUtils]: 51: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,940 INFO L273 TraceCheckUtils]: 52: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,940 INFO L273 TraceCheckUtils]: 53: Hoare triple {5764#false} assume !(~i~0 < 1000); {5764#false} is VALID [2018-11-14 17:09:00,941 INFO L273 TraceCheckUtils]: 54: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 17:09:00,941 INFO L273 TraceCheckUtils]: 55: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,941 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {5764#false} {5764#false} #73#return; {5764#false} is VALID [2018-11-14 17:09:00,941 INFO L273 TraceCheckUtils]: 57: Hoare triple {5764#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {5764#false} is VALID [2018-11-14 17:09:00,941 INFO L256 TraceCheckUtils]: 58: Hoare triple {5764#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 17:09:00,941 INFO L273 TraceCheckUtils]: 59: Hoare triple {5764#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 17:09:00,942 INFO L273 TraceCheckUtils]: 60: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,942 INFO L273 TraceCheckUtils]: 61: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,942 INFO L273 TraceCheckUtils]: 62: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,942 INFO L273 TraceCheckUtils]: 63: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,942 INFO L273 TraceCheckUtils]: 64: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,942 INFO L273 TraceCheckUtils]: 65: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,943 INFO L273 TraceCheckUtils]: 66: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,943 INFO L273 TraceCheckUtils]: 67: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,943 INFO L273 TraceCheckUtils]: 68: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,943 INFO L273 TraceCheckUtils]: 69: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,943 INFO L273 TraceCheckUtils]: 70: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,943 INFO L273 TraceCheckUtils]: 71: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,944 INFO L273 TraceCheckUtils]: 72: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,944 INFO L273 TraceCheckUtils]: 73: Hoare triple {5764#false} assume !(~i~0 < 1000); {5764#false} is VALID [2018-11-14 17:09:00,944 INFO L273 TraceCheckUtils]: 74: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 17:09:00,944 INFO L273 TraceCheckUtils]: 75: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,944 INFO L268 TraceCheckUtils]: 76: Hoare quadruple {5764#false} {5764#false} #75#return; {5764#false} is VALID [2018-11-14 17:09:00,944 INFO L273 TraceCheckUtils]: 77: Hoare triple {5764#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {5764#false} is VALID [2018-11-14 17:09:00,945 INFO L273 TraceCheckUtils]: 78: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,945 INFO L273 TraceCheckUtils]: 79: Hoare triple {5764#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 17:09:00,945 INFO L273 TraceCheckUtils]: 80: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 17:09:00,945 INFO L273 TraceCheckUtils]: 81: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,945 INFO L273 TraceCheckUtils]: 82: Hoare triple {5764#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {5764#false} is VALID [2018-11-14 17:09:00,945 INFO L273 TraceCheckUtils]: 83: Hoare triple {5764#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {5764#false} is VALID [2018-11-14 17:09:00,946 INFO L273 TraceCheckUtils]: 84: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,946 INFO L273 TraceCheckUtils]: 85: Hoare triple {5764#false} assume !(~i~2 < 999); {5764#false} is VALID [2018-11-14 17:09:00,946 INFO L273 TraceCheckUtils]: 86: Hoare triple {5764#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {5764#false} is VALID [2018-11-14 17:09:00,946 INFO L256 TraceCheckUtils]: 87: Hoare triple {5764#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {5764#false} is VALID [2018-11-14 17:09:00,946 INFO L273 TraceCheckUtils]: 88: Hoare triple {5764#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {5764#false} is VALID [2018-11-14 17:09:00,946 INFO L273 TraceCheckUtils]: 89: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,946 INFO L273 TraceCheckUtils]: 90: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,947 INFO L273 TraceCheckUtils]: 91: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,947 INFO L273 TraceCheckUtils]: 92: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,947 INFO L273 TraceCheckUtils]: 93: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,947 INFO L273 TraceCheckUtils]: 94: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,947 INFO L273 TraceCheckUtils]: 95: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,947 INFO L273 TraceCheckUtils]: 96: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,948 INFO L273 TraceCheckUtils]: 97: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,948 INFO L273 TraceCheckUtils]: 98: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,948 INFO L273 TraceCheckUtils]: 99: Hoare triple {5764#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {5764#false} is VALID [2018-11-14 17:09:00,948 INFO L273 TraceCheckUtils]: 100: Hoare triple {5764#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {5764#false} is VALID [2018-11-14 17:09:00,948 INFO L273 TraceCheckUtils]: 101: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,948 INFO L273 TraceCheckUtils]: 102: Hoare triple {5764#false} assume !(~i~0 < 1000); {5764#false} is VALID [2018-11-14 17:09:00,949 INFO L273 TraceCheckUtils]: 103: Hoare triple {5764#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {5764#false} is VALID [2018-11-14 17:09:00,949 INFO L273 TraceCheckUtils]: 104: Hoare triple {5764#false} assume true; {5764#false} is VALID [2018-11-14 17:09:00,949 INFO L268 TraceCheckUtils]: 105: Hoare quadruple {5764#false} {5764#false} #77#return; {5764#false} is VALID [2018-11-14 17:09:00,949 INFO L273 TraceCheckUtils]: 106: Hoare triple {5764#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {5764#false} is VALID [2018-11-14 17:09:00,949 INFO L273 TraceCheckUtils]: 107: Hoare triple {5764#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {5764#false} is VALID [2018-11-14 17:09:00,949 INFO L273 TraceCheckUtils]: 108: Hoare triple {5764#false} assume !false; {5764#false} is VALID [2018-11-14 17:09:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 17:09:00,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:00,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 17:09:00,976 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 17:09:00,977 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:00,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:09:01,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:01,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:09:01,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:09:01,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:09:01,050 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 14 states. [2018-11-14 17:09:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:01,392 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2018-11-14 17:09:01,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:09:01,392 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 109 [2018-11-14 17:09:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:09:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 17:09:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:09:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 90 transitions. [2018-11-14 17:09:01,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 90 transitions. [2018-11-14 17:09:01,541 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-14 17:09:01,543 INFO L225 Difference]: With dead ends: 114 [2018-11-14 17:09:01,544 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 17:09:01,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:09:01,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 17:09:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-11-14 17:09:01,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:01,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 77 states. [2018-11-14 17:09:01,573 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 77 states. [2018-11-14 17:09:01,573 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 77 states. [2018-11-14 17:09:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:01,576 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 17:09:01,577 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 17:09:01,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:01,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:01,577 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 78 states. [2018-11-14 17:09:01,577 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 78 states. [2018-11-14 17:09:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:01,579 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-14 17:09:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-11-14 17:09:01,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:01,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:01,580 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:01,580 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 17:09:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-11-14 17:09:01,582 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 109 [2018-11-14 17:09:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:01,583 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-11-14 17:09:01,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:09:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-11-14 17:09:01,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-14 17:09:01,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:01,584 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 11, 11, 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] [2018-11-14 17:09:01,584 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:01,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1525893034, now seen corresponding path program 11 times [2018-11-14 17:09:01,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:01,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:01,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:02,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 17:09:02,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {6518#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6518#true} is VALID [2018-11-14 17:09:02,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 17:09:02,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 17:09:02,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {6518#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6520#(= main_~i~1 0)} is VALID [2018-11-14 17:09:02,650 INFO L273 TraceCheckUtils]: 6: Hoare triple {6520#(= main_~i~1 0)} assume true; {6520#(= main_~i~1 0)} is VALID [2018-11-14 17:09:02,651 INFO L273 TraceCheckUtils]: 7: Hoare triple {6520#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6520#(= main_~i~1 0)} is VALID [2018-11-14 17:09:02,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {6520#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:02,652 INFO L273 TraceCheckUtils]: 9: Hoare triple {6521#(<= main_~i~1 1)} assume true; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:02,653 INFO L273 TraceCheckUtils]: 10: Hoare triple {6521#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6521#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:02,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {6521#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:02,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {6522#(<= main_~i~1 2)} assume true; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:02,654 INFO L273 TraceCheckUtils]: 13: Hoare triple {6522#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6522#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:02,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {6522#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:02,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {6523#(<= main_~i~1 3)} assume true; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:02,656 INFO L273 TraceCheckUtils]: 16: Hoare triple {6523#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6523#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:02,657 INFO L273 TraceCheckUtils]: 17: Hoare triple {6523#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:02,657 INFO L273 TraceCheckUtils]: 18: Hoare triple {6524#(<= main_~i~1 4)} assume true; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:02,658 INFO L273 TraceCheckUtils]: 19: Hoare triple {6524#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6524#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:02,659 INFO L273 TraceCheckUtils]: 20: Hoare triple {6524#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:02,659 INFO L273 TraceCheckUtils]: 21: Hoare triple {6525#(<= main_~i~1 5)} assume true; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:02,660 INFO L273 TraceCheckUtils]: 22: Hoare triple {6525#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6525#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:02,661 INFO L273 TraceCheckUtils]: 23: Hoare triple {6525#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:02,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {6526#(<= main_~i~1 6)} assume true; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:02,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {6526#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6526#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:02,662 INFO L273 TraceCheckUtils]: 26: Hoare triple {6526#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:02,663 INFO L273 TraceCheckUtils]: 27: Hoare triple {6527#(<= main_~i~1 7)} assume true; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:02,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {6527#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6527#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:02,664 INFO L273 TraceCheckUtils]: 29: Hoare triple {6527#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:02,665 INFO L273 TraceCheckUtils]: 30: Hoare triple {6528#(<= main_~i~1 8)} assume true; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:02,665 INFO L273 TraceCheckUtils]: 31: Hoare triple {6528#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6528#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:02,666 INFO L273 TraceCheckUtils]: 32: Hoare triple {6528#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:02,666 INFO L273 TraceCheckUtils]: 33: Hoare triple {6529#(<= main_~i~1 9)} assume true; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:02,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {6529#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6529#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:02,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {6529#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:02,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {6530#(<= main_~i~1 10)} assume true; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:02,669 INFO L273 TraceCheckUtils]: 37: Hoare triple {6530#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6530#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:02,669 INFO L273 TraceCheckUtils]: 38: Hoare triple {6530#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6531#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:02,670 INFO L273 TraceCheckUtils]: 39: Hoare triple {6531#(<= main_~i~1 11)} assume true; {6531#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:02,671 INFO L273 TraceCheckUtils]: 40: Hoare triple {6531#(<= main_~i~1 11)} assume !(~i~1 < 1000); {6519#false} is VALID [2018-11-14 17:09:02,671 INFO L256 TraceCheckUtils]: 41: Hoare triple {6519#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:09:02,671 INFO L273 TraceCheckUtils]: 42: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 17:09:02,671 INFO L273 TraceCheckUtils]: 43: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,672 INFO L273 TraceCheckUtils]: 44: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,672 INFO L273 TraceCheckUtils]: 45: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,672 INFO L273 TraceCheckUtils]: 46: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,672 INFO L273 TraceCheckUtils]: 47: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,672 INFO L273 TraceCheckUtils]: 48: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,673 INFO L273 TraceCheckUtils]: 49: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,673 INFO L273 TraceCheckUtils]: 50: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,673 INFO L273 TraceCheckUtils]: 51: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,673 INFO L273 TraceCheckUtils]: 52: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,673 INFO L273 TraceCheckUtils]: 53: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,674 INFO L273 TraceCheckUtils]: 54: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,674 INFO L273 TraceCheckUtils]: 56: Hoare triple {6518#true} assume !(~i~0 < 1000); {6518#true} is VALID [2018-11-14 17:09:02,674 INFO L273 TraceCheckUtils]: 57: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 17:09:02,674 INFO L273 TraceCheckUtils]: 58: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,674 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6518#true} {6519#false} #73#return; {6519#false} is VALID [2018-11-14 17:09:02,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {6519#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {6519#false} is VALID [2018-11-14 17:09:02,675 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:09:02,675 INFO L273 TraceCheckUtils]: 62: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 17:09:02,675 INFO L273 TraceCheckUtils]: 63: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,675 INFO L273 TraceCheckUtils]: 64: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,675 INFO L273 TraceCheckUtils]: 65: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,675 INFO L273 TraceCheckUtils]: 66: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,675 INFO L273 TraceCheckUtils]: 67: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,675 INFO L273 TraceCheckUtils]: 68: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,675 INFO L273 TraceCheckUtils]: 69: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,676 INFO L273 TraceCheckUtils]: 70: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,676 INFO L273 TraceCheckUtils]: 71: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,676 INFO L273 TraceCheckUtils]: 72: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,676 INFO L273 TraceCheckUtils]: 73: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,676 INFO L273 TraceCheckUtils]: 74: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,676 INFO L273 TraceCheckUtils]: 75: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,676 INFO L273 TraceCheckUtils]: 76: Hoare triple {6518#true} assume !(~i~0 < 1000); {6518#true} is VALID [2018-11-14 17:09:02,676 INFO L273 TraceCheckUtils]: 77: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 17:09:02,677 INFO L273 TraceCheckUtils]: 78: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,677 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6518#true} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 17:09:02,677 INFO L273 TraceCheckUtils]: 80: Hoare triple {6519#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6519#false} is VALID [2018-11-14 17:09:02,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:02,677 INFO L273 TraceCheckUtils]: 82: Hoare triple {6519#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 17:09:02,677 INFO L273 TraceCheckUtils]: 83: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 17:09:02,677 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:02,677 INFO L273 TraceCheckUtils]: 85: Hoare triple {6519#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 17:09:02,677 INFO L273 TraceCheckUtils]: 86: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 17:09:02,678 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:02,678 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 999); {6519#false} is VALID [2018-11-14 17:09:02,678 INFO L273 TraceCheckUtils]: 89: Hoare triple {6519#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {6519#false} is VALID [2018-11-14 17:09:02,678 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:09:02,678 INFO L273 TraceCheckUtils]: 91: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6518#true} is VALID [2018-11-14 17:09:02,678 INFO L273 TraceCheckUtils]: 92: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,678 INFO L273 TraceCheckUtils]: 93: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,678 INFO L273 TraceCheckUtils]: 94: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,678 INFO L273 TraceCheckUtils]: 95: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,679 INFO L273 TraceCheckUtils]: 96: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,679 INFO L273 TraceCheckUtils]: 97: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,679 INFO L273 TraceCheckUtils]: 98: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,679 INFO L273 TraceCheckUtils]: 99: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,679 INFO L273 TraceCheckUtils]: 100: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,679 INFO L273 TraceCheckUtils]: 101: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,679 INFO L273 TraceCheckUtils]: 102: Hoare triple {6518#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6518#true} is VALID [2018-11-14 17:09:02,679 INFO L273 TraceCheckUtils]: 103: Hoare triple {6518#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6518#true} is VALID [2018-11-14 17:09:02,680 INFO L273 TraceCheckUtils]: 104: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,680 INFO L273 TraceCheckUtils]: 105: Hoare triple {6518#true} assume !(~i~0 < 1000); {6518#true} is VALID [2018-11-14 17:09:02,680 INFO L273 TraceCheckUtils]: 106: Hoare triple {6518#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6518#true} is VALID [2018-11-14 17:09:02,680 INFO L273 TraceCheckUtils]: 107: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:02,680 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6518#true} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 17:09:02,680 INFO L273 TraceCheckUtils]: 109: Hoare triple {6519#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6519#false} is VALID [2018-11-14 17:09:02,680 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 17:09:02,680 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 17:09:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-11-14 17:09:02,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:02,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 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-14 17:09:02,695 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:09:02,874 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-14 17:09:02,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:02,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:02,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:03,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {6518#true} call ULTIMATE.init(); {6518#true} is VALID [2018-11-14 17:09:03,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {6518#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6518#true} is VALID [2018-11-14 17:09:03,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6518#true} {6518#true} #69#return; {6518#true} is VALID [2018-11-14 17:09:03,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {6518#true} call #t~ret13 := main(); {6518#true} is VALID [2018-11-14 17:09:03,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {6518#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {6518#true} is VALID [2018-11-14 17:09:03,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,068 INFO L273 TraceCheckUtils]: 8: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,069 INFO L273 TraceCheckUtils]: 19: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,070 INFO L273 TraceCheckUtils]: 23: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,070 INFO L273 TraceCheckUtils]: 24: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,071 INFO L273 TraceCheckUtils]: 26: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,071 INFO L273 TraceCheckUtils]: 27: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,071 INFO L273 TraceCheckUtils]: 28: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,071 INFO L273 TraceCheckUtils]: 29: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,072 INFO L273 TraceCheckUtils]: 31: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,072 INFO L273 TraceCheckUtils]: 33: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,072 INFO L273 TraceCheckUtils]: 35: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,072 INFO L273 TraceCheckUtils]: 36: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {6518#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {6518#true} is VALID [2018-11-14 17:09:03,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {6518#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {6518#true} is VALID [2018-11-14 17:09:03,073 INFO L273 TraceCheckUtils]: 39: Hoare triple {6518#true} assume true; {6518#true} is VALID [2018-11-14 17:09:03,073 INFO L273 TraceCheckUtils]: 40: Hoare triple {6518#true} assume !(~i~1 < 1000); {6518#true} is VALID [2018-11-14 17:09:03,073 INFO L256 TraceCheckUtils]: 41: Hoare triple {6518#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {6518#true} is VALID [2018-11-14 17:09:03,088 INFO L273 TraceCheckUtils]: 42: Hoare triple {6518#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6661#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:03,097 INFO L273 TraceCheckUtils]: 43: Hoare triple {6661#(<= xor_~i~0 1)} assume true; {6661#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:03,112 INFO L273 TraceCheckUtils]: 44: Hoare triple {6661#(<= xor_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6661#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:03,118 INFO L273 TraceCheckUtils]: 45: Hoare triple {6661#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6671#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:03,118 INFO L273 TraceCheckUtils]: 46: Hoare triple {6671#(<= xor_~i~0 2)} assume true; {6671#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:03,120 INFO L273 TraceCheckUtils]: 47: Hoare triple {6671#(<= xor_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6671#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:03,120 INFO L273 TraceCheckUtils]: 48: Hoare triple {6671#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6681#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:03,122 INFO L273 TraceCheckUtils]: 49: Hoare triple {6681#(<= xor_~i~0 3)} assume true; {6681#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:03,122 INFO L273 TraceCheckUtils]: 50: Hoare triple {6681#(<= xor_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6681#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:03,124 INFO L273 TraceCheckUtils]: 51: Hoare triple {6681#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6691#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:03,124 INFO L273 TraceCheckUtils]: 52: Hoare triple {6691#(<= xor_~i~0 4)} assume true; {6691#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:03,124 INFO L273 TraceCheckUtils]: 53: Hoare triple {6691#(<= xor_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6691#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:03,125 INFO L273 TraceCheckUtils]: 54: Hoare triple {6691#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6701#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:03,125 INFO L273 TraceCheckUtils]: 55: Hoare triple {6701#(<= xor_~i~0 5)} assume true; {6701#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:03,125 INFO L273 TraceCheckUtils]: 56: Hoare triple {6701#(<= xor_~i~0 5)} assume !(~i~0 < 1000); {6519#false} is VALID [2018-11-14 17:09:03,126 INFO L273 TraceCheckUtils]: 57: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 17:09:03,126 INFO L273 TraceCheckUtils]: 58: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,126 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6519#false} {6518#true} #73#return; {6519#false} is VALID [2018-11-14 17:09:03,126 INFO L273 TraceCheckUtils]: 60: Hoare triple {6519#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {6519#false} is VALID [2018-11-14 17:09:03,126 INFO L256 TraceCheckUtils]: 61: Hoare triple {6519#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 17:09:03,126 INFO L273 TraceCheckUtils]: 62: Hoare triple {6519#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6519#false} is VALID [2018-11-14 17:09:03,126 INFO L273 TraceCheckUtils]: 63: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,126 INFO L273 TraceCheckUtils]: 64: Hoare triple {6519#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:09:03,127 INFO L273 TraceCheckUtils]: 65: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:09:03,127 INFO L273 TraceCheckUtils]: 66: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,127 INFO L273 TraceCheckUtils]: 67: Hoare triple {6519#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:09:03,127 INFO L273 TraceCheckUtils]: 68: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:09:03,127 INFO L273 TraceCheckUtils]: 69: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,127 INFO L273 TraceCheckUtils]: 70: Hoare triple {6519#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:09:03,127 INFO L273 TraceCheckUtils]: 71: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:09:03,127 INFO L273 TraceCheckUtils]: 72: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,127 INFO L273 TraceCheckUtils]: 73: Hoare triple {6519#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:09:03,128 INFO L273 TraceCheckUtils]: 74: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:09:03,128 INFO L273 TraceCheckUtils]: 75: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,128 INFO L273 TraceCheckUtils]: 76: Hoare triple {6519#false} assume !(~i~0 < 1000); {6519#false} is VALID [2018-11-14 17:09:03,128 INFO L273 TraceCheckUtils]: 77: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 17:09:03,128 INFO L273 TraceCheckUtils]: 78: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,128 INFO L268 TraceCheckUtils]: 79: Hoare quadruple {6519#false} {6519#false} #75#return; {6519#false} is VALID [2018-11-14 17:09:03,128 INFO L273 TraceCheckUtils]: 80: Hoare triple {6519#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {6519#false} is VALID [2018-11-14 17:09:03,128 INFO L273 TraceCheckUtils]: 81: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,129 INFO L273 TraceCheckUtils]: 82: Hoare triple {6519#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 17:09:03,129 INFO L273 TraceCheckUtils]: 83: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 17:09:03,129 INFO L273 TraceCheckUtils]: 84: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,129 INFO L273 TraceCheckUtils]: 85: Hoare triple {6519#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {6519#false} is VALID [2018-11-14 17:09:03,129 INFO L273 TraceCheckUtils]: 86: Hoare triple {6519#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {6519#false} is VALID [2018-11-14 17:09:03,129 INFO L273 TraceCheckUtils]: 87: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,129 INFO L273 TraceCheckUtils]: 88: Hoare triple {6519#false} assume !(~i~2 < 999); {6519#false} is VALID [2018-11-14 17:09:03,129 INFO L273 TraceCheckUtils]: 89: Hoare triple {6519#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {6519#false} is VALID [2018-11-14 17:09:03,129 INFO L256 TraceCheckUtils]: 90: Hoare triple {6519#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {6519#false} is VALID [2018-11-14 17:09:03,130 INFO L273 TraceCheckUtils]: 91: Hoare triple {6519#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {6519#false} is VALID [2018-11-14 17:09:03,130 INFO L273 TraceCheckUtils]: 92: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,130 INFO L273 TraceCheckUtils]: 93: Hoare triple {6519#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:09:03,130 INFO L273 TraceCheckUtils]: 94: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:09:03,130 INFO L273 TraceCheckUtils]: 95: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,130 INFO L273 TraceCheckUtils]: 96: Hoare triple {6519#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:09:03,130 INFO L273 TraceCheckUtils]: 97: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:09:03,130 INFO L273 TraceCheckUtils]: 98: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,130 INFO L273 TraceCheckUtils]: 99: Hoare triple {6519#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:09:03,131 INFO L273 TraceCheckUtils]: 100: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:09:03,131 INFO L273 TraceCheckUtils]: 101: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,131 INFO L273 TraceCheckUtils]: 102: Hoare triple {6519#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {6519#false} is VALID [2018-11-14 17:09:03,131 INFO L273 TraceCheckUtils]: 103: Hoare triple {6519#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {6519#false} is VALID [2018-11-14 17:09:03,131 INFO L273 TraceCheckUtils]: 104: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,131 INFO L273 TraceCheckUtils]: 105: Hoare triple {6519#false} assume !(~i~0 < 1000); {6519#false} is VALID [2018-11-14 17:09:03,131 INFO L273 TraceCheckUtils]: 106: Hoare triple {6519#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {6519#false} is VALID [2018-11-14 17:09:03,131 INFO L273 TraceCheckUtils]: 107: Hoare triple {6519#false} assume true; {6519#false} is VALID [2018-11-14 17:09:03,132 INFO L268 TraceCheckUtils]: 108: Hoare quadruple {6519#false} {6519#false} #77#return; {6519#false} is VALID [2018-11-14 17:09:03,132 INFO L273 TraceCheckUtils]: 109: Hoare triple {6519#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {6519#false} is VALID [2018-11-14 17:09:03,132 INFO L273 TraceCheckUtils]: 110: Hoare triple {6519#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {6519#false} is VALID [2018-11-14 17:09:03,132 INFO L273 TraceCheckUtils]: 111: Hoare triple {6519#false} assume !false; {6519#false} is VALID [2018-11-14 17:09:03,137 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 134 proven. 26 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-11-14 17:09:03,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:03,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2018-11-14 17:09:03,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 17:09:03,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:03,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:09:03,263 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-14 17:09:03,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:09:03,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:09:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:09:03,264 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 19 states. [2018-11-14 17:09:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:03,687 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-11-14 17:09:03,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 17:09:03,688 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 112 [2018-11-14 17:09:03,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:03,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:09:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 17:09:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:09:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 112 transitions. [2018-11-14 17:09:03,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 112 transitions. [2018-11-14 17:09:03,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:03,829 INFO L225 Difference]: With dead ends: 121 [2018-11-14 17:09:03,829 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 17:09:03,830 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:09:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 17:09:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-11-14 17:09:03,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:03,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 83 states. [2018-11-14 17:09:03,897 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 83 states. [2018-11-14 17:09:03,897 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 83 states. [2018-11-14 17:09:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:03,899 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 17:09:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 17:09:03,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:03,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:03,900 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 85 states. [2018-11-14 17:09:03,901 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 85 states. [2018-11-14 17:09:03,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:03,903 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-14 17:09:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-11-14 17:09:03,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:03,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:03,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:03,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 17:09:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-14 17:09:03,906 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 112 [2018-11-14 17:09:03,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:03,907 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-14 17:09:03,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:09:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-14 17:09:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-14 17:09:03,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:03,909 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 13, 12, 12, 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] [2018-11-14 17:09:03,910 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:03,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:03,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1735050981, now seen corresponding path program 12 times [2018-11-14 17:09:03,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:03,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:03,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:06,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 17:09:06,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7318#true} is VALID [2018-11-14 17:09:06,204 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 17:09:06,205 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 17:09:06,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7320#(= main_~i~1 0)} is VALID [2018-11-14 17:09:06,206 INFO L273 TraceCheckUtils]: 6: Hoare triple {7320#(= main_~i~1 0)} assume true; {7320#(= main_~i~1 0)} is VALID [2018-11-14 17:09:06,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {7320#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7320#(= main_~i~1 0)} is VALID [2018-11-14 17:09:06,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {7320#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:06,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {7321#(<= main_~i~1 1)} assume true; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:06,209 INFO L273 TraceCheckUtils]: 10: Hoare triple {7321#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7321#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:06,209 INFO L273 TraceCheckUtils]: 11: Hoare triple {7321#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:06,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {7322#(<= main_~i~1 2)} assume true; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:06,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {7322#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7322#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:06,211 INFO L273 TraceCheckUtils]: 14: Hoare triple {7322#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:06,212 INFO L273 TraceCheckUtils]: 15: Hoare triple {7323#(<= main_~i~1 3)} assume true; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:06,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {7323#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7323#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:06,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {7323#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:06,214 INFO L273 TraceCheckUtils]: 18: Hoare triple {7324#(<= main_~i~1 4)} assume true; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:06,215 INFO L273 TraceCheckUtils]: 19: Hoare triple {7324#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7324#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:06,215 INFO L273 TraceCheckUtils]: 20: Hoare triple {7324#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:06,216 INFO L273 TraceCheckUtils]: 21: Hoare triple {7325#(<= main_~i~1 5)} assume true; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:06,217 INFO L273 TraceCheckUtils]: 22: Hoare triple {7325#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7325#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:06,217 INFO L273 TraceCheckUtils]: 23: Hoare triple {7325#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:06,218 INFO L273 TraceCheckUtils]: 24: Hoare triple {7326#(<= main_~i~1 6)} assume true; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:06,219 INFO L273 TraceCheckUtils]: 25: Hoare triple {7326#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7326#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:06,219 INFO L273 TraceCheckUtils]: 26: Hoare triple {7326#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:06,220 INFO L273 TraceCheckUtils]: 27: Hoare triple {7327#(<= main_~i~1 7)} assume true; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:06,220 INFO L273 TraceCheckUtils]: 28: Hoare triple {7327#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7327#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:06,221 INFO L273 TraceCheckUtils]: 29: Hoare triple {7327#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:06,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {7328#(<= main_~i~1 8)} assume true; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:06,222 INFO L273 TraceCheckUtils]: 31: Hoare triple {7328#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7328#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:06,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {7328#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:06,224 INFO L273 TraceCheckUtils]: 33: Hoare triple {7329#(<= main_~i~1 9)} assume true; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:06,224 INFO L273 TraceCheckUtils]: 34: Hoare triple {7329#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7329#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:06,225 INFO L273 TraceCheckUtils]: 35: Hoare triple {7329#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:06,226 INFO L273 TraceCheckUtils]: 36: Hoare triple {7330#(<= main_~i~1 10)} assume true; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:06,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {7330#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7330#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:06,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {7330#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:06,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {7331#(<= main_~i~1 11)} assume true; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:06,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {7331#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7331#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:06,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {7331#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7332#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:06,230 INFO L273 TraceCheckUtils]: 42: Hoare triple {7332#(<= main_~i~1 12)} assume true; {7332#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:06,231 INFO L273 TraceCheckUtils]: 43: Hoare triple {7332#(<= main_~i~1 12)} assume !(~i~1 < 1000); {7319#false} is VALID [2018-11-14 17:09:06,231 INFO L256 TraceCheckUtils]: 44: Hoare triple {7319#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:09:06,231 INFO L273 TraceCheckUtils]: 45: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:09:06,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,232 INFO L273 TraceCheckUtils]: 47: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,232 INFO L273 TraceCheckUtils]: 48: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,232 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,233 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,233 INFO L273 TraceCheckUtils]: 53: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,233 INFO L273 TraceCheckUtils]: 54: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,234 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,234 INFO L273 TraceCheckUtils]: 56: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,234 INFO L273 TraceCheckUtils]: 57: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,234 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,235 INFO L273 TraceCheckUtils]: 59: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,235 INFO L273 TraceCheckUtils]: 60: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,235 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,235 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 1000); {7318#true} is VALID [2018-11-14 17:09:06,235 INFO L273 TraceCheckUtils]: 63: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:09:06,235 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,236 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7319#false} #73#return; {7319#false} is VALID [2018-11-14 17:09:06,236 INFO L273 TraceCheckUtils]: 66: Hoare triple {7319#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {7319#false} is VALID [2018-11-14 17:09:06,236 INFO L256 TraceCheckUtils]: 67: Hoare triple {7319#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:09:06,236 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:09:06,236 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,236 INFO L273 TraceCheckUtils]: 70: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,237 INFO L273 TraceCheckUtils]: 71: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,237 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,237 INFO L273 TraceCheckUtils]: 73: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,237 INFO L273 TraceCheckUtils]: 74: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,237 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,237 INFO L273 TraceCheckUtils]: 76: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,237 INFO L273 TraceCheckUtils]: 77: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,238 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,238 INFO L273 TraceCheckUtils]: 79: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,238 INFO L273 TraceCheckUtils]: 80: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,238 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,238 INFO L273 TraceCheckUtils]: 82: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,238 INFO L273 TraceCheckUtils]: 83: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,238 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,239 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 1000); {7318#true} is VALID [2018-11-14 17:09:06,239 INFO L273 TraceCheckUtils]: 86: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:09:06,239 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,239 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7319#false} #75#return; {7319#false} is VALID [2018-11-14 17:09:06,239 INFO L273 TraceCheckUtils]: 89: Hoare triple {7319#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7319#false} is VALID [2018-11-14 17:09:06,239 INFO L273 TraceCheckUtils]: 90: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,240 INFO L273 TraceCheckUtils]: 91: Hoare triple {7319#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7319#false} is VALID [2018-11-14 17:09:06,240 INFO L273 TraceCheckUtils]: 92: Hoare triple {7319#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7319#false} is VALID [2018-11-14 17:09:06,240 INFO L273 TraceCheckUtils]: 93: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,240 INFO L273 TraceCheckUtils]: 94: Hoare triple {7319#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7319#false} is VALID [2018-11-14 17:09:06,240 INFO L273 TraceCheckUtils]: 95: Hoare triple {7319#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7319#false} is VALID [2018-11-14 17:09:06,240 INFO L273 TraceCheckUtils]: 96: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,240 INFO L273 TraceCheckUtils]: 97: Hoare triple {7319#false} assume !(~i~2 < 999); {7319#false} is VALID [2018-11-14 17:09:06,241 INFO L273 TraceCheckUtils]: 98: Hoare triple {7319#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {7319#false} is VALID [2018-11-14 17:09:06,241 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:09:06,241 INFO L273 TraceCheckUtils]: 100: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:09:06,241 INFO L273 TraceCheckUtils]: 101: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,241 INFO L273 TraceCheckUtils]: 102: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,241 INFO L273 TraceCheckUtils]: 103: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,241 INFO L273 TraceCheckUtils]: 104: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,242 INFO L273 TraceCheckUtils]: 105: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,242 INFO L273 TraceCheckUtils]: 106: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,242 INFO L273 TraceCheckUtils]: 107: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,242 INFO L273 TraceCheckUtils]: 108: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,242 INFO L273 TraceCheckUtils]: 109: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,242 INFO L273 TraceCheckUtils]: 110: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,242 INFO L273 TraceCheckUtils]: 111: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,243 INFO L273 TraceCheckUtils]: 112: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,243 INFO L273 TraceCheckUtils]: 113: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,243 INFO L273 TraceCheckUtils]: 114: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,243 INFO L273 TraceCheckUtils]: 115: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,243 INFO L273 TraceCheckUtils]: 116: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,243 INFO L273 TraceCheckUtils]: 117: Hoare triple {7318#true} assume !(~i~0 < 1000); {7318#true} is VALID [2018-11-14 17:09:06,243 INFO L273 TraceCheckUtils]: 118: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:09:06,244 INFO L273 TraceCheckUtils]: 119: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,244 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7318#true} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 17:09:06,244 INFO L273 TraceCheckUtils]: 121: Hoare triple {7319#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7319#false} is VALID [2018-11-14 17:09:06,244 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 17:09:06,244 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 17:09:06,258 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2018-11-14 17:09:06,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:06,259 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-14 17:09:06,267 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:09:06,335 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 17:09:06,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:06,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:06,563 INFO L256 TraceCheckUtils]: 0: Hoare triple {7318#true} call ULTIMATE.init(); {7318#true} is VALID [2018-11-14 17:09:06,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7318#true} is VALID [2018-11-14 17:09:06,564 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,564 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7318#true} {7318#true} #69#return; {7318#true} is VALID [2018-11-14 17:09:06,564 INFO L256 TraceCheckUtils]: 4: Hoare triple {7318#true} call #t~ret13 := main(); {7318#true} is VALID [2018-11-14 17:09:06,564 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {7318#true} is VALID [2018-11-14 17:09:06,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,565 INFO L273 TraceCheckUtils]: 7: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,565 INFO L273 TraceCheckUtils]: 8: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,566 INFO L273 TraceCheckUtils]: 11: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,566 INFO L273 TraceCheckUtils]: 12: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,567 INFO L273 TraceCheckUtils]: 17: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,567 INFO L273 TraceCheckUtils]: 18: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,567 INFO L273 TraceCheckUtils]: 19: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,567 INFO L273 TraceCheckUtils]: 20: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,567 INFO L273 TraceCheckUtils]: 21: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,567 INFO L273 TraceCheckUtils]: 22: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,567 INFO L273 TraceCheckUtils]: 25: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,568 INFO L273 TraceCheckUtils]: 26: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,568 INFO L273 TraceCheckUtils]: 27: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,568 INFO L273 TraceCheckUtils]: 28: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,568 INFO L273 TraceCheckUtils]: 29: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,568 INFO L273 TraceCheckUtils]: 31: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,568 INFO L273 TraceCheckUtils]: 32: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,568 INFO L273 TraceCheckUtils]: 33: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,569 INFO L273 TraceCheckUtils]: 34: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,569 INFO L273 TraceCheckUtils]: 35: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,569 INFO L273 TraceCheckUtils]: 36: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,569 INFO L273 TraceCheckUtils]: 37: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,569 INFO L273 TraceCheckUtils]: 38: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,569 INFO L273 TraceCheckUtils]: 39: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,569 INFO L273 TraceCheckUtils]: 40: Hoare triple {7318#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {7318#true} is VALID [2018-11-14 17:09:06,569 INFO L273 TraceCheckUtils]: 41: Hoare triple {7318#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {7318#true} is VALID [2018-11-14 17:09:06,569 INFO L273 TraceCheckUtils]: 42: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,570 INFO L273 TraceCheckUtils]: 43: Hoare triple {7318#true} assume !(~i~1 < 1000); {7318#true} is VALID [2018-11-14 17:09:06,570 INFO L256 TraceCheckUtils]: 44: Hoare triple {7318#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:09:06,570 INFO L273 TraceCheckUtils]: 45: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:09:06,570 INFO L273 TraceCheckUtils]: 46: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,570 INFO L273 TraceCheckUtils]: 47: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,570 INFO L273 TraceCheckUtils]: 48: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,570 INFO L273 TraceCheckUtils]: 49: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,570 INFO L273 TraceCheckUtils]: 50: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,570 INFO L273 TraceCheckUtils]: 51: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,571 INFO L273 TraceCheckUtils]: 52: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,571 INFO L273 TraceCheckUtils]: 53: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,571 INFO L273 TraceCheckUtils]: 54: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,571 INFO L273 TraceCheckUtils]: 55: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,571 INFO L273 TraceCheckUtils]: 56: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,571 INFO L273 TraceCheckUtils]: 57: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,571 INFO L273 TraceCheckUtils]: 58: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,571 INFO L273 TraceCheckUtils]: 59: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,571 INFO L273 TraceCheckUtils]: 60: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,572 INFO L273 TraceCheckUtils]: 61: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,572 INFO L273 TraceCheckUtils]: 62: Hoare triple {7318#true} assume !(~i~0 < 1000); {7318#true} is VALID [2018-11-14 17:09:06,572 INFO L273 TraceCheckUtils]: 63: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:09:06,572 INFO L273 TraceCheckUtils]: 64: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,572 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {7318#true} {7318#true} #73#return; {7318#true} is VALID [2018-11-14 17:09:06,572 INFO L273 TraceCheckUtils]: 66: Hoare triple {7318#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {7318#true} is VALID [2018-11-14 17:09:06,572 INFO L256 TraceCheckUtils]: 67: Hoare triple {7318#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {7318#true} is VALID [2018-11-14 17:09:06,572 INFO L273 TraceCheckUtils]: 68: Hoare triple {7318#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7318#true} is VALID [2018-11-14 17:09:06,573 INFO L273 TraceCheckUtils]: 69: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,573 INFO L273 TraceCheckUtils]: 70: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,573 INFO L273 TraceCheckUtils]: 71: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,573 INFO L273 TraceCheckUtils]: 72: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,573 INFO L273 TraceCheckUtils]: 73: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,573 INFO L273 TraceCheckUtils]: 74: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,573 INFO L273 TraceCheckUtils]: 75: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,573 INFO L273 TraceCheckUtils]: 76: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,573 INFO L273 TraceCheckUtils]: 77: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,574 INFO L273 TraceCheckUtils]: 78: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,574 INFO L273 TraceCheckUtils]: 79: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,574 INFO L273 TraceCheckUtils]: 80: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,574 INFO L273 TraceCheckUtils]: 81: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,574 INFO L273 TraceCheckUtils]: 82: Hoare triple {7318#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7318#true} is VALID [2018-11-14 17:09:06,574 INFO L273 TraceCheckUtils]: 83: Hoare triple {7318#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7318#true} is VALID [2018-11-14 17:09:06,574 INFO L273 TraceCheckUtils]: 84: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,574 INFO L273 TraceCheckUtils]: 85: Hoare triple {7318#true} assume !(~i~0 < 1000); {7318#true} is VALID [2018-11-14 17:09:06,574 INFO L273 TraceCheckUtils]: 86: Hoare triple {7318#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7318#true} is VALID [2018-11-14 17:09:06,575 INFO L273 TraceCheckUtils]: 87: Hoare triple {7318#true} assume true; {7318#true} is VALID [2018-11-14 17:09:06,575 INFO L268 TraceCheckUtils]: 88: Hoare quadruple {7318#true} {7318#true} #75#return; {7318#true} is VALID [2018-11-14 17:09:06,575 INFO L273 TraceCheckUtils]: 89: Hoare triple {7318#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:06,576 INFO L273 TraceCheckUtils]: 90: Hoare triple {7603#(<= main_~i~2 0)} assume true; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:06,576 INFO L273 TraceCheckUtils]: 91: Hoare triple {7603#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7603#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:06,576 INFO L273 TraceCheckUtils]: 92: Hoare triple {7603#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:06,577 INFO L273 TraceCheckUtils]: 93: Hoare triple {7613#(<= main_~i~2 1)} assume true; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:06,577 INFO L273 TraceCheckUtils]: 94: Hoare triple {7613#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {7613#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:06,577 INFO L273 TraceCheckUtils]: 95: Hoare triple {7613#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {7623#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:06,578 INFO L273 TraceCheckUtils]: 96: Hoare triple {7623#(<= main_~i~2 2)} assume true; {7623#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:06,578 INFO L273 TraceCheckUtils]: 97: Hoare triple {7623#(<= main_~i~2 2)} assume !(~i~2 < 999); {7319#false} is VALID [2018-11-14 17:09:06,578 INFO L273 TraceCheckUtils]: 98: Hoare triple {7319#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {7319#false} is VALID [2018-11-14 17:09:06,578 INFO L256 TraceCheckUtils]: 99: Hoare triple {7319#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {7319#false} is VALID [2018-11-14 17:09:06,578 INFO L273 TraceCheckUtils]: 100: Hoare triple {7319#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {7319#false} is VALID [2018-11-14 17:09:06,579 INFO L273 TraceCheckUtils]: 101: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,579 INFO L273 TraceCheckUtils]: 102: Hoare triple {7319#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:09:06,579 INFO L273 TraceCheckUtils]: 103: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:09:06,579 INFO L273 TraceCheckUtils]: 104: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,579 INFO L273 TraceCheckUtils]: 105: Hoare triple {7319#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:09:06,579 INFO L273 TraceCheckUtils]: 106: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:09:06,579 INFO L273 TraceCheckUtils]: 107: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,579 INFO L273 TraceCheckUtils]: 108: Hoare triple {7319#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:09:06,579 INFO L273 TraceCheckUtils]: 109: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:09:06,580 INFO L273 TraceCheckUtils]: 110: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,580 INFO L273 TraceCheckUtils]: 111: Hoare triple {7319#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:09:06,580 INFO L273 TraceCheckUtils]: 112: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:09:06,580 INFO L273 TraceCheckUtils]: 113: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,580 INFO L273 TraceCheckUtils]: 114: Hoare triple {7319#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {7319#false} is VALID [2018-11-14 17:09:06,580 INFO L273 TraceCheckUtils]: 115: Hoare triple {7319#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {7319#false} is VALID [2018-11-14 17:09:06,580 INFO L273 TraceCheckUtils]: 116: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,580 INFO L273 TraceCheckUtils]: 117: Hoare triple {7319#false} assume !(~i~0 < 1000); {7319#false} is VALID [2018-11-14 17:09:06,580 INFO L273 TraceCheckUtils]: 118: Hoare triple {7319#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {7319#false} is VALID [2018-11-14 17:09:06,581 INFO L273 TraceCheckUtils]: 119: Hoare triple {7319#false} assume true; {7319#false} is VALID [2018-11-14 17:09:06,581 INFO L268 TraceCheckUtils]: 120: Hoare quadruple {7319#false} {7319#false} #77#return; {7319#false} is VALID [2018-11-14 17:09:06,581 INFO L273 TraceCheckUtils]: 121: Hoare triple {7319#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {7319#false} is VALID [2018-11-14 17:09:06,581 INFO L273 TraceCheckUtils]: 122: Hoare triple {7319#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {7319#false} is VALID [2018-11-14 17:09:06,582 INFO L273 TraceCheckUtils]: 123: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2018-11-14 17:09:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 652 backedges. 202 proven. 7 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2018-11-14 17:09:06,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:06,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2018-11-14 17:09:06,609 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 17:09:06,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:06,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:09:06,693 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-14 17:09:06,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:09:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:09:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:09:06,695 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 18 states. [2018-11-14 17:09:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:07,385 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-11-14 17:09:07,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 17:09:07,385 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2018-11-14 17:09:07,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:09:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 17:09:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:09:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 106 transitions. [2018-11-14 17:09:07,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 106 transitions. [2018-11-14 17:09:07,924 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-14 17:09:07,926 INFO L225 Difference]: With dead ends: 130 [2018-11-14 17:09:07,926 INFO L226 Difference]: Without dead ends: 91 [2018-11-14 17:09:07,927 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:09:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-14 17:09:07,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-11-14 17:09:07,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:07,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 89 states. [2018-11-14 17:09:07,951 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 89 states. [2018-11-14 17:09:07,951 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 89 states. [2018-11-14 17:09:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:07,954 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 17:09:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 17:09:07,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:07,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:07,954 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 91 states. [2018-11-14 17:09:07,955 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 91 states. [2018-11-14 17:09:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:07,957 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-14 17:09:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2018-11-14 17:09:07,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:07,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:07,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:07,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 17:09:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-11-14 17:09:07,960 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2018-11-14 17:09:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:07,960 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-11-14 17:09:07,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:09:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-11-14 17:09:07,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-14 17:09:07,962 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:07,962 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 14, 13, 13, 4, 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-14 17:09:07,962 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:07,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash 854600333, now seen corresponding path program 13 times [2018-11-14 17:09:07,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:07,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:07,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:07,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:08,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 17:09:08,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {8185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8185#true} is VALID [2018-11-14 17:09:08,586 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 17:09:08,586 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 17:09:08,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {8185#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8187#(= main_~i~1 0)} is VALID [2018-11-14 17:09:08,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {8187#(= main_~i~1 0)} assume true; {8187#(= main_~i~1 0)} is VALID [2018-11-14 17:09:08,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {8187#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8187#(= main_~i~1 0)} is VALID [2018-11-14 17:09:08,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {8187#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:08,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:08,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {8188#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:08,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {8188#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:08,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:08,590 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:08,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {8189#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:08,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:08,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {8190#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:08,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {8190#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:08,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:08,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {8191#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:08,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {8191#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:08,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:08,595 INFO L273 TraceCheckUtils]: 22: Hoare triple {8192#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:08,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {8192#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:08,599 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:08,599 INFO L273 TraceCheckUtils]: 25: Hoare triple {8193#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:08,600 INFO L273 TraceCheckUtils]: 26: Hoare triple {8193#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:08,600 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:08,601 INFO L273 TraceCheckUtils]: 28: Hoare triple {8194#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:08,601 INFO L273 TraceCheckUtils]: 29: Hoare triple {8194#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:08,601 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:08,602 INFO L273 TraceCheckUtils]: 31: Hoare triple {8195#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:08,602 INFO L273 TraceCheckUtils]: 32: Hoare triple {8195#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:08,602 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:08,603 INFO L273 TraceCheckUtils]: 34: Hoare triple {8196#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:08,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {8196#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:08,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:08,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {8197#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:08,605 INFO L273 TraceCheckUtils]: 38: Hoare triple {8197#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:08,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:08,606 INFO L273 TraceCheckUtils]: 40: Hoare triple {8198#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:08,607 INFO L273 TraceCheckUtils]: 41: Hoare triple {8198#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:08,607 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:08,608 INFO L273 TraceCheckUtils]: 43: Hoare triple {8199#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:08,609 INFO L273 TraceCheckUtils]: 44: Hoare triple {8199#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:08,609 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:08,610 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 1000); {8186#false} is VALID [2018-11-14 17:09:08,610 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 17:09:08,610 INFO L273 TraceCheckUtils]: 48: Hoare triple {8185#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 17:09:08,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,611 INFO L273 TraceCheckUtils]: 50: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,611 INFO L273 TraceCheckUtils]: 51: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,611 INFO L273 TraceCheckUtils]: 52: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,611 INFO L273 TraceCheckUtils]: 53: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,612 INFO L273 TraceCheckUtils]: 54: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,612 INFO L273 TraceCheckUtils]: 55: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,612 INFO L273 TraceCheckUtils]: 58: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,612 INFO L273 TraceCheckUtils]: 59: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,613 INFO L273 TraceCheckUtils]: 60: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,613 INFO L273 TraceCheckUtils]: 61: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,613 INFO L273 TraceCheckUtils]: 62: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,613 INFO L273 TraceCheckUtils]: 63: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,613 INFO L273 TraceCheckUtils]: 64: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,613 INFO L273 TraceCheckUtils]: 65: Hoare triple {8185#true} assume !(~i~0 < 1000); {8185#true} is VALID [2018-11-14 17:09:08,613 INFO L273 TraceCheckUtils]: 66: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 17:09:08,613 INFO L273 TraceCheckUtils]: 67: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,613 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8185#true} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 17:09:08,614 INFO L273 TraceCheckUtils]: 69: Hoare triple {8186#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {8186#false} is VALID [2018-11-14 17:09:08,614 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 17:09:08,614 INFO L273 TraceCheckUtils]: 71: Hoare triple {8185#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 17:09:08,614 INFO L273 TraceCheckUtils]: 72: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,614 INFO L273 TraceCheckUtils]: 73: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,614 INFO L273 TraceCheckUtils]: 74: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,614 INFO L273 TraceCheckUtils]: 75: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,614 INFO L273 TraceCheckUtils]: 76: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,615 INFO L273 TraceCheckUtils]: 77: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,615 INFO L273 TraceCheckUtils]: 78: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,615 INFO L273 TraceCheckUtils]: 79: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,615 INFO L273 TraceCheckUtils]: 80: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,615 INFO L273 TraceCheckUtils]: 81: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,615 INFO L273 TraceCheckUtils]: 82: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,615 INFO L273 TraceCheckUtils]: 83: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,615 INFO L273 TraceCheckUtils]: 84: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,615 INFO L273 TraceCheckUtils]: 85: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,616 INFO L273 TraceCheckUtils]: 86: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,616 INFO L273 TraceCheckUtils]: 87: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,616 INFO L273 TraceCheckUtils]: 88: Hoare triple {8185#true} assume !(~i~0 < 1000); {8185#true} is VALID [2018-11-14 17:09:08,616 INFO L273 TraceCheckUtils]: 89: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 17:09:08,616 INFO L273 TraceCheckUtils]: 90: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,616 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8185#true} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 17:09:08,617 INFO L273 TraceCheckUtils]: 92: Hoare triple {8186#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8186#false} is VALID [2018-11-14 17:09:08,617 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:08,617 INFO L273 TraceCheckUtils]: 94: Hoare triple {8186#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:09:08,617 INFO L273 TraceCheckUtils]: 95: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:09:08,617 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:08,618 INFO L273 TraceCheckUtils]: 97: Hoare triple {8186#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:09:08,618 INFO L273 TraceCheckUtils]: 98: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:09:08,618 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:08,618 INFO L273 TraceCheckUtils]: 100: Hoare triple {8186#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:09:08,618 INFO L273 TraceCheckUtils]: 101: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:09:08,618 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:08,619 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 999); {8186#false} is VALID [2018-11-14 17:09:08,619 INFO L273 TraceCheckUtils]: 104: Hoare triple {8186#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {8186#false} is VALID [2018-11-14 17:09:08,619 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {8185#true} is VALID [2018-11-14 17:09:08,619 INFO L273 TraceCheckUtils]: 106: Hoare triple {8185#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8185#true} is VALID [2018-11-14 17:09:08,619 INFO L273 TraceCheckUtils]: 107: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,619 INFO L273 TraceCheckUtils]: 108: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,620 INFO L273 TraceCheckUtils]: 109: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,620 INFO L273 TraceCheckUtils]: 110: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,620 INFO L273 TraceCheckUtils]: 111: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,620 INFO L273 TraceCheckUtils]: 112: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,620 INFO L273 TraceCheckUtils]: 113: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,620 INFO L273 TraceCheckUtils]: 114: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,620 INFO L273 TraceCheckUtils]: 115: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,621 INFO L273 TraceCheckUtils]: 116: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,621 INFO L273 TraceCheckUtils]: 117: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,621 INFO L273 TraceCheckUtils]: 118: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,621 INFO L273 TraceCheckUtils]: 119: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,621 INFO L273 TraceCheckUtils]: 120: Hoare triple {8185#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8185#true} is VALID [2018-11-14 17:09:08,621 INFO L273 TraceCheckUtils]: 121: Hoare triple {8185#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8185#true} is VALID [2018-11-14 17:09:08,622 INFO L273 TraceCheckUtils]: 122: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,622 INFO L273 TraceCheckUtils]: 123: Hoare triple {8185#true} assume !(~i~0 < 1000); {8185#true} is VALID [2018-11-14 17:09:08,622 INFO L273 TraceCheckUtils]: 124: Hoare triple {8185#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8185#true} is VALID [2018-11-14 17:09:08,622 INFO L273 TraceCheckUtils]: 125: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,622 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8185#true} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 17:09:08,622 INFO L273 TraceCheckUtils]: 127: Hoare triple {8186#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8186#false} is VALID [2018-11-14 17:09:08,623 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 17:09:08,623 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 17:09:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:09:08,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:08,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 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-14 17:09:08,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:09:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:08,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:08,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {8185#true} call ULTIMATE.init(); {8185#true} is VALID [2018-11-14 17:09:08,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {8185#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8185#true} is VALID [2018-11-14 17:09:08,975 INFO L273 TraceCheckUtils]: 2: Hoare triple {8185#true} assume true; {8185#true} is VALID [2018-11-14 17:09:08,975 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8185#true} {8185#true} #69#return; {8185#true} is VALID [2018-11-14 17:09:08,975 INFO L256 TraceCheckUtils]: 4: Hoare triple {8185#true} call #t~ret13 := main(); {8185#true} is VALID [2018-11-14 17:09:08,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {8185#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:08,977 INFO L273 TraceCheckUtils]: 6: Hoare triple {8219#(<= main_~i~1 0)} assume true; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:08,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {8219#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8219#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:08,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {8219#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:08,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {8188#(<= main_~i~1 1)} assume true; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:08,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {8188#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8188#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:08,979 INFO L273 TraceCheckUtils]: 11: Hoare triple {8188#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:08,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {8189#(<= main_~i~1 2)} assume true; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:08,979 INFO L273 TraceCheckUtils]: 13: Hoare triple {8189#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8189#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:08,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {8189#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:08,981 INFO L273 TraceCheckUtils]: 15: Hoare triple {8190#(<= main_~i~1 3)} assume true; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:08,981 INFO L273 TraceCheckUtils]: 16: Hoare triple {8190#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8190#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:08,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {8190#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:08,982 INFO L273 TraceCheckUtils]: 18: Hoare triple {8191#(<= main_~i~1 4)} assume true; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:08,983 INFO L273 TraceCheckUtils]: 19: Hoare triple {8191#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8191#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:08,984 INFO L273 TraceCheckUtils]: 20: Hoare triple {8191#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:08,984 INFO L273 TraceCheckUtils]: 21: Hoare triple {8192#(<= main_~i~1 5)} assume true; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:08,985 INFO L273 TraceCheckUtils]: 22: Hoare triple {8192#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8192#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:08,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {8192#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:08,986 INFO L273 TraceCheckUtils]: 24: Hoare triple {8193#(<= main_~i~1 6)} assume true; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:08,986 INFO L273 TraceCheckUtils]: 25: Hoare triple {8193#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8193#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:08,987 INFO L273 TraceCheckUtils]: 26: Hoare triple {8193#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:08,988 INFO L273 TraceCheckUtils]: 27: Hoare triple {8194#(<= main_~i~1 7)} assume true; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:08,988 INFO L273 TraceCheckUtils]: 28: Hoare triple {8194#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8194#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:08,989 INFO L273 TraceCheckUtils]: 29: Hoare triple {8194#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:08,989 INFO L273 TraceCheckUtils]: 30: Hoare triple {8195#(<= main_~i~1 8)} assume true; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:08,990 INFO L273 TraceCheckUtils]: 31: Hoare triple {8195#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8195#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:08,990 INFO L273 TraceCheckUtils]: 32: Hoare triple {8195#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:08,991 INFO L273 TraceCheckUtils]: 33: Hoare triple {8196#(<= main_~i~1 9)} assume true; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:08,991 INFO L273 TraceCheckUtils]: 34: Hoare triple {8196#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8196#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:08,992 INFO L273 TraceCheckUtils]: 35: Hoare triple {8196#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:08,993 INFO L273 TraceCheckUtils]: 36: Hoare triple {8197#(<= main_~i~1 10)} assume true; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:08,993 INFO L273 TraceCheckUtils]: 37: Hoare triple {8197#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8197#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:08,994 INFO L273 TraceCheckUtils]: 38: Hoare triple {8197#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:08,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {8198#(<= main_~i~1 11)} assume true; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:08,995 INFO L273 TraceCheckUtils]: 40: Hoare triple {8198#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8198#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:08,996 INFO L273 TraceCheckUtils]: 41: Hoare triple {8198#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:08,996 INFO L273 TraceCheckUtils]: 42: Hoare triple {8199#(<= main_~i~1 12)} assume true; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:08,997 INFO L273 TraceCheckUtils]: 43: Hoare triple {8199#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {8199#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:08,997 INFO L273 TraceCheckUtils]: 44: Hoare triple {8199#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:08,998 INFO L273 TraceCheckUtils]: 45: Hoare triple {8200#(<= main_~i~1 13)} assume true; {8200#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:08,999 INFO L273 TraceCheckUtils]: 46: Hoare triple {8200#(<= main_~i~1 13)} assume !(~i~1 < 1000); {8186#false} is VALID [2018-11-14 17:09:08,999 INFO L256 TraceCheckUtils]: 47: Hoare triple {8186#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 17:09:08,999 INFO L273 TraceCheckUtils]: 48: Hoare triple {8186#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 17:09:08,999 INFO L273 TraceCheckUtils]: 49: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:08,999 INFO L273 TraceCheckUtils]: 50: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,000 INFO L273 TraceCheckUtils]: 51: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,000 INFO L273 TraceCheckUtils]: 52: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,000 INFO L273 TraceCheckUtils]: 53: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,000 INFO L273 TraceCheckUtils]: 54: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,001 INFO L273 TraceCheckUtils]: 55: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,001 INFO L273 TraceCheckUtils]: 56: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,001 INFO L273 TraceCheckUtils]: 58: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,001 INFO L273 TraceCheckUtils]: 59: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,001 INFO L273 TraceCheckUtils]: 60: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,002 INFO L273 TraceCheckUtils]: 61: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,002 INFO L273 TraceCheckUtils]: 62: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,002 INFO L273 TraceCheckUtils]: 63: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,002 INFO L273 TraceCheckUtils]: 64: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,002 INFO L273 TraceCheckUtils]: 65: Hoare triple {8186#false} assume !(~i~0 < 1000); {8186#false} is VALID [2018-11-14 17:09:09,003 INFO L273 TraceCheckUtils]: 66: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 17:09:09,003 INFO L273 TraceCheckUtils]: 67: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,003 INFO L268 TraceCheckUtils]: 68: Hoare quadruple {8186#false} {8186#false} #73#return; {8186#false} is VALID [2018-11-14 17:09:09,003 INFO L273 TraceCheckUtils]: 69: Hoare triple {8186#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {8186#false} is VALID [2018-11-14 17:09:09,003 INFO L256 TraceCheckUtils]: 70: Hoare triple {8186#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 17:09:09,004 INFO L273 TraceCheckUtils]: 71: Hoare triple {8186#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 17:09:09,004 INFO L273 TraceCheckUtils]: 72: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,004 INFO L273 TraceCheckUtils]: 73: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,004 INFO L273 TraceCheckUtils]: 74: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,004 INFO L273 TraceCheckUtils]: 75: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,004 INFO L273 TraceCheckUtils]: 76: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,005 INFO L273 TraceCheckUtils]: 77: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,005 INFO L273 TraceCheckUtils]: 78: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,005 INFO L273 TraceCheckUtils]: 79: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,005 INFO L273 TraceCheckUtils]: 80: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,005 INFO L273 TraceCheckUtils]: 81: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,005 INFO L273 TraceCheckUtils]: 82: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,005 INFO L273 TraceCheckUtils]: 83: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,005 INFO L273 TraceCheckUtils]: 84: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,005 INFO L273 TraceCheckUtils]: 85: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,006 INFO L273 TraceCheckUtils]: 86: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,006 INFO L273 TraceCheckUtils]: 87: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,006 INFO L273 TraceCheckUtils]: 88: Hoare triple {8186#false} assume !(~i~0 < 1000); {8186#false} is VALID [2018-11-14 17:09:09,006 INFO L273 TraceCheckUtils]: 89: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 17:09:09,006 INFO L273 TraceCheckUtils]: 90: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,006 INFO L268 TraceCheckUtils]: 91: Hoare quadruple {8186#false} {8186#false} #75#return; {8186#false} is VALID [2018-11-14 17:09:09,006 INFO L273 TraceCheckUtils]: 92: Hoare triple {8186#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {8186#false} is VALID [2018-11-14 17:09:09,006 INFO L273 TraceCheckUtils]: 93: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,006 INFO L273 TraceCheckUtils]: 94: Hoare triple {8186#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:09:09,007 INFO L273 TraceCheckUtils]: 95: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:09:09,007 INFO L273 TraceCheckUtils]: 96: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,007 INFO L273 TraceCheckUtils]: 97: Hoare triple {8186#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:09:09,007 INFO L273 TraceCheckUtils]: 98: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:09:09,007 INFO L273 TraceCheckUtils]: 99: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,007 INFO L273 TraceCheckUtils]: 100: Hoare triple {8186#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {8186#false} is VALID [2018-11-14 17:09:09,007 INFO L273 TraceCheckUtils]: 101: Hoare triple {8186#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {8186#false} is VALID [2018-11-14 17:09:09,007 INFO L273 TraceCheckUtils]: 102: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,007 INFO L273 TraceCheckUtils]: 103: Hoare triple {8186#false} assume !(~i~2 < 999); {8186#false} is VALID [2018-11-14 17:09:09,008 INFO L273 TraceCheckUtils]: 104: Hoare triple {8186#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {8186#false} is VALID [2018-11-14 17:09:09,008 INFO L256 TraceCheckUtils]: 105: Hoare triple {8186#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {8186#false} is VALID [2018-11-14 17:09:09,008 INFO L273 TraceCheckUtils]: 106: Hoare triple {8186#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {8186#false} is VALID [2018-11-14 17:09:09,008 INFO L273 TraceCheckUtils]: 107: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,008 INFO L273 TraceCheckUtils]: 108: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,008 INFO L273 TraceCheckUtils]: 109: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,008 INFO L273 TraceCheckUtils]: 110: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,008 INFO L273 TraceCheckUtils]: 111: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,008 INFO L273 TraceCheckUtils]: 112: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,009 INFO L273 TraceCheckUtils]: 113: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,009 INFO L273 TraceCheckUtils]: 114: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,009 INFO L273 TraceCheckUtils]: 115: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,009 INFO L273 TraceCheckUtils]: 116: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,009 INFO L273 TraceCheckUtils]: 117: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,009 INFO L273 TraceCheckUtils]: 118: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,009 INFO L273 TraceCheckUtils]: 119: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,009 INFO L273 TraceCheckUtils]: 120: Hoare triple {8186#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {8186#false} is VALID [2018-11-14 17:09:09,010 INFO L273 TraceCheckUtils]: 121: Hoare triple {8186#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {8186#false} is VALID [2018-11-14 17:09:09,010 INFO L273 TraceCheckUtils]: 122: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,010 INFO L273 TraceCheckUtils]: 123: Hoare triple {8186#false} assume !(~i~0 < 1000); {8186#false} is VALID [2018-11-14 17:09:09,010 INFO L273 TraceCheckUtils]: 124: Hoare triple {8186#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {8186#false} is VALID [2018-11-14 17:09:09,010 INFO L273 TraceCheckUtils]: 125: Hoare triple {8186#false} assume true; {8186#false} is VALID [2018-11-14 17:09:09,010 INFO L268 TraceCheckUtils]: 126: Hoare quadruple {8186#false} {8186#false} #77#return; {8186#false} is VALID [2018-11-14 17:09:09,010 INFO L273 TraceCheckUtils]: 127: Hoare triple {8186#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {8186#false} is VALID [2018-11-14 17:09:09,010 INFO L273 TraceCheckUtils]: 128: Hoare triple {8186#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {8186#false} is VALID [2018-11-14 17:09:09,010 INFO L273 TraceCheckUtils]: 129: Hoare triple {8186#false} assume !false; {8186#false} is VALID [2018-11-14 17:09:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:09:09,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:09,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 17:09:09,039 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 17:09:09,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:09,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 17:09:09,145 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-14 17:09:09,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 17:09:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 17:09:09,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:09:09,146 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 17 states. [2018-11-14 17:09:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:09,556 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-11-14 17:09:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 17:09:09,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 130 [2018-11-14 17:09:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:09:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 17:09:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 17:09:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 99 transitions. [2018-11-14 17:09:09,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 99 transitions. [2018-11-14 17:09:10,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:10,024 INFO L225 Difference]: With dead ends: 135 [2018-11-14 17:09:10,024 INFO L226 Difference]: Without dead ends: 93 [2018-11-14 17:09:10,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 17:09:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-14 17:09:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-14 17:09:10,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:10,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 92 states. [2018-11-14 17:09:10,052 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 92 states. [2018-11-14 17:09:10,052 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 92 states. [2018-11-14 17:09:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:10,055 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 17:09:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 17:09:10,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:10,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:10,056 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 93 states. [2018-11-14 17:09:10,056 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 93 states. [2018-11-14 17:09:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:10,058 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-11-14 17:09:10,058 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2018-11-14 17:09:10,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:10,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:10,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:10,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-14 17:09:10,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2018-11-14 17:09:10,061 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 130 [2018-11-14 17:09:10,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:10,062 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-11-14 17:09:10,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 17:09:10,062 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2018-11-14 17:09:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-14 17:09:10,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:10,063 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 14, 14, 4, 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-14 17:09:10,064 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:10,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash 138227847, now seen corresponding path program 14 times [2018-11-14 17:09:10,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:10,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:10,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:10,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:09:10,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:10,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 17:09:10,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {9084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9084#true} is VALID [2018-11-14 17:09:10,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 17:09:10,891 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 17:09:10,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {9084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9086#(= main_~i~1 0)} is VALID [2018-11-14 17:09:10,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {9086#(= main_~i~1 0)} assume true; {9086#(= main_~i~1 0)} is VALID [2018-11-14 17:09:10,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {9086#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9086#(= main_~i~1 0)} is VALID [2018-11-14 17:09:10,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {9086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:10,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:10,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {9087#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:10,894 INFO L273 TraceCheckUtils]: 11: Hoare triple {9087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:10,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:10,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {9088#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:10,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {9088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:10,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:10,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {9089#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:10,897 INFO L273 TraceCheckUtils]: 17: Hoare triple {9089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:10,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:10,898 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:10,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {9090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:10,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:10,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:10,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:10,901 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:10,901 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:10,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:10,902 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:10,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:10,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:10,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:10,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {9094#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:10,905 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:10,906 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:10,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {9095#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:10,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {9095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:10,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:10,908 INFO L273 TraceCheckUtils]: 37: Hoare triple {9096#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:10,909 INFO L273 TraceCheckUtils]: 38: Hoare triple {9096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:10,909 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:10,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {9097#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:10,910 INFO L273 TraceCheckUtils]: 41: Hoare triple {9097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:10,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:10,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {9098#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:10,912 INFO L273 TraceCheckUtils]: 44: Hoare triple {9098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:10,912 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:10,913 INFO L273 TraceCheckUtils]: 46: Hoare triple {9099#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:10,914 INFO L273 TraceCheckUtils]: 47: Hoare triple {9099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:10,914 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:10,915 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 1000); {9085#false} is VALID [2018-11-14 17:09:10,915 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 17:09:10,915 INFO L273 TraceCheckUtils]: 51: Hoare triple {9084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 17:09:10,915 INFO L273 TraceCheckUtils]: 52: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,916 INFO L273 TraceCheckUtils]: 53: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,916 INFO L273 TraceCheckUtils]: 54: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,916 INFO L273 TraceCheckUtils]: 55: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,916 INFO L273 TraceCheckUtils]: 56: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,916 INFO L273 TraceCheckUtils]: 57: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,917 INFO L273 TraceCheckUtils]: 58: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,917 INFO L273 TraceCheckUtils]: 59: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,917 INFO L273 TraceCheckUtils]: 60: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,917 INFO L273 TraceCheckUtils]: 61: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,917 INFO L273 TraceCheckUtils]: 62: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,917 INFO L273 TraceCheckUtils]: 63: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,918 INFO L273 TraceCheckUtils]: 64: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,918 INFO L273 TraceCheckUtils]: 65: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,918 INFO L273 TraceCheckUtils]: 66: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,918 INFO L273 TraceCheckUtils]: 67: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,918 INFO L273 TraceCheckUtils]: 68: Hoare triple {9084#true} assume !(~i~0 < 1000); {9084#true} is VALID [2018-11-14 17:09:10,919 INFO L273 TraceCheckUtils]: 69: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 17:09:10,919 INFO L273 TraceCheckUtils]: 70: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,919 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9084#true} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 17:09:10,919 INFO L273 TraceCheckUtils]: 72: Hoare triple {9085#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {9085#false} is VALID [2018-11-14 17:09:10,919 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 17:09:10,919 INFO L273 TraceCheckUtils]: 74: Hoare triple {9084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 17:09:10,919 INFO L273 TraceCheckUtils]: 75: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,919 INFO L273 TraceCheckUtils]: 76: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,920 INFO L273 TraceCheckUtils]: 77: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,920 INFO L273 TraceCheckUtils]: 78: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,920 INFO L273 TraceCheckUtils]: 79: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,920 INFO L273 TraceCheckUtils]: 80: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,920 INFO L273 TraceCheckUtils]: 81: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,920 INFO L273 TraceCheckUtils]: 82: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,920 INFO L273 TraceCheckUtils]: 83: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,920 INFO L273 TraceCheckUtils]: 84: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,920 INFO L273 TraceCheckUtils]: 85: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,921 INFO L273 TraceCheckUtils]: 86: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,921 INFO L273 TraceCheckUtils]: 87: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,921 INFO L273 TraceCheckUtils]: 88: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,921 INFO L273 TraceCheckUtils]: 89: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,921 INFO L273 TraceCheckUtils]: 90: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,921 INFO L273 TraceCheckUtils]: 91: Hoare triple {9084#true} assume !(~i~0 < 1000); {9084#true} is VALID [2018-11-14 17:09:10,921 INFO L273 TraceCheckUtils]: 92: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 17:09:10,922 INFO L273 TraceCheckUtils]: 93: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,922 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9084#true} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 17:09:10,922 INFO L273 TraceCheckUtils]: 95: Hoare triple {9085#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9085#false} is VALID [2018-11-14 17:09:10,922 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:10,922 INFO L273 TraceCheckUtils]: 97: Hoare triple {9085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:09:10,922 INFO L273 TraceCheckUtils]: 98: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:09:10,923 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:10,923 INFO L273 TraceCheckUtils]: 100: Hoare triple {9085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:09:10,923 INFO L273 TraceCheckUtils]: 101: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:09:10,923 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:10,923 INFO L273 TraceCheckUtils]: 103: Hoare triple {9085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:09:10,923 INFO L273 TraceCheckUtils]: 104: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:09:10,924 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:10,924 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 999); {9085#false} is VALID [2018-11-14 17:09:10,924 INFO L273 TraceCheckUtils]: 107: Hoare triple {9085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {9085#false} is VALID [2018-11-14 17:09:10,924 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {9084#true} is VALID [2018-11-14 17:09:10,924 INFO L273 TraceCheckUtils]: 109: Hoare triple {9084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9084#true} is VALID [2018-11-14 17:09:10,925 INFO L273 TraceCheckUtils]: 110: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,925 INFO L273 TraceCheckUtils]: 111: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,925 INFO L273 TraceCheckUtils]: 112: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,925 INFO L273 TraceCheckUtils]: 113: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,925 INFO L273 TraceCheckUtils]: 114: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,925 INFO L273 TraceCheckUtils]: 115: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,925 INFO L273 TraceCheckUtils]: 116: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,926 INFO L273 TraceCheckUtils]: 117: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,926 INFO L273 TraceCheckUtils]: 118: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,926 INFO L273 TraceCheckUtils]: 119: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,926 INFO L273 TraceCheckUtils]: 120: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,926 INFO L273 TraceCheckUtils]: 121: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,926 INFO L273 TraceCheckUtils]: 122: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,927 INFO L273 TraceCheckUtils]: 123: Hoare triple {9084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9084#true} is VALID [2018-11-14 17:09:10,927 INFO L273 TraceCheckUtils]: 124: Hoare triple {9084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9084#true} is VALID [2018-11-14 17:09:10,927 INFO L273 TraceCheckUtils]: 125: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,927 INFO L273 TraceCheckUtils]: 126: Hoare triple {9084#true} assume !(~i~0 < 1000); {9084#true} is VALID [2018-11-14 17:09:10,927 INFO L273 TraceCheckUtils]: 127: Hoare triple {9084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9084#true} is VALID [2018-11-14 17:09:10,927 INFO L273 TraceCheckUtils]: 128: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:10,928 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9084#true} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 17:09:10,928 INFO L273 TraceCheckUtils]: 130: Hoare triple {9085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9085#false} is VALID [2018-11-14 17:09:10,928 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 17:09:10,928 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 17:09:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:09:10,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:10,939 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-14 17:09:10,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:09:11,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:09:11,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:11,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:11,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {9084#true} call ULTIMATE.init(); {9084#true} is VALID [2018-11-14 17:09:11,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {9084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9084#true} is VALID [2018-11-14 17:09:11,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {9084#true} assume true; {9084#true} is VALID [2018-11-14 17:09:11,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9084#true} {9084#true} #69#return; {9084#true} is VALID [2018-11-14 17:09:11,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {9084#true} call #t~ret13 := main(); {9084#true} is VALID [2018-11-14 17:09:11,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {9084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:11,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {9119#(<= main_~i~1 0)} assume true; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:11,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {9119#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9119#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:11,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {9119#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:11,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {9087#(<= main_~i~1 1)} assume true; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:11,282 INFO L273 TraceCheckUtils]: 10: Hoare triple {9087#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9087#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:11,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {9087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:11,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {9088#(<= main_~i~1 2)} assume true; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:11,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {9088#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9088#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:11,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {9088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:11,291 INFO L273 TraceCheckUtils]: 15: Hoare triple {9089#(<= main_~i~1 3)} assume true; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:11,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {9089#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9089#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:11,292 INFO L273 TraceCheckUtils]: 17: Hoare triple {9089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:11,293 INFO L273 TraceCheckUtils]: 18: Hoare triple {9090#(<= main_~i~1 4)} assume true; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:11,293 INFO L273 TraceCheckUtils]: 19: Hoare triple {9090#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9090#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:11,293 INFO L273 TraceCheckUtils]: 20: Hoare triple {9090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:11,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {9091#(<= main_~i~1 5)} assume true; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:11,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {9091#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9091#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:11,295 INFO L273 TraceCheckUtils]: 23: Hoare triple {9091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:11,295 INFO L273 TraceCheckUtils]: 24: Hoare triple {9092#(<= main_~i~1 6)} assume true; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:11,295 INFO L273 TraceCheckUtils]: 25: Hoare triple {9092#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9092#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:11,296 INFO L273 TraceCheckUtils]: 26: Hoare triple {9092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:11,296 INFO L273 TraceCheckUtils]: 27: Hoare triple {9093#(<= main_~i~1 7)} assume true; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:11,297 INFO L273 TraceCheckUtils]: 28: Hoare triple {9093#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9093#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:11,298 INFO L273 TraceCheckUtils]: 29: Hoare triple {9093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:11,298 INFO L273 TraceCheckUtils]: 30: Hoare triple {9094#(<= main_~i~1 8)} assume true; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:11,299 INFO L273 TraceCheckUtils]: 31: Hoare triple {9094#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9094#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:11,299 INFO L273 TraceCheckUtils]: 32: Hoare triple {9094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:11,300 INFO L273 TraceCheckUtils]: 33: Hoare triple {9095#(<= main_~i~1 9)} assume true; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:11,300 INFO L273 TraceCheckUtils]: 34: Hoare triple {9095#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9095#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:11,301 INFO L273 TraceCheckUtils]: 35: Hoare triple {9095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:11,302 INFO L273 TraceCheckUtils]: 36: Hoare triple {9096#(<= main_~i~1 10)} assume true; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:11,302 INFO L273 TraceCheckUtils]: 37: Hoare triple {9096#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9096#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:11,303 INFO L273 TraceCheckUtils]: 38: Hoare triple {9096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:11,303 INFO L273 TraceCheckUtils]: 39: Hoare triple {9097#(<= main_~i~1 11)} assume true; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:11,304 INFO L273 TraceCheckUtils]: 40: Hoare triple {9097#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9097#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:11,305 INFO L273 TraceCheckUtils]: 41: Hoare triple {9097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:11,305 INFO L273 TraceCheckUtils]: 42: Hoare triple {9098#(<= main_~i~1 12)} assume true; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:11,306 INFO L273 TraceCheckUtils]: 43: Hoare triple {9098#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9098#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:11,306 INFO L273 TraceCheckUtils]: 44: Hoare triple {9098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:11,307 INFO L273 TraceCheckUtils]: 45: Hoare triple {9099#(<= main_~i~1 13)} assume true; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:11,307 INFO L273 TraceCheckUtils]: 46: Hoare triple {9099#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {9099#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:11,308 INFO L273 TraceCheckUtils]: 47: Hoare triple {9099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:11,309 INFO L273 TraceCheckUtils]: 48: Hoare triple {9100#(<= main_~i~1 14)} assume true; {9100#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:11,309 INFO L273 TraceCheckUtils]: 49: Hoare triple {9100#(<= main_~i~1 14)} assume !(~i~1 < 1000); {9085#false} is VALID [2018-11-14 17:09:11,310 INFO L256 TraceCheckUtils]: 50: Hoare triple {9085#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 17:09:11,310 INFO L273 TraceCheckUtils]: 51: Hoare triple {9085#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 17:09:11,310 INFO L273 TraceCheckUtils]: 52: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,310 INFO L273 TraceCheckUtils]: 53: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,310 INFO L273 TraceCheckUtils]: 54: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,311 INFO L273 TraceCheckUtils]: 55: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,311 INFO L273 TraceCheckUtils]: 56: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,311 INFO L273 TraceCheckUtils]: 57: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,311 INFO L273 TraceCheckUtils]: 58: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,311 INFO L273 TraceCheckUtils]: 59: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,311 INFO L273 TraceCheckUtils]: 60: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,312 INFO L273 TraceCheckUtils]: 61: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,312 INFO L273 TraceCheckUtils]: 62: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,312 INFO L273 TraceCheckUtils]: 63: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,312 INFO L273 TraceCheckUtils]: 64: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,312 INFO L273 TraceCheckUtils]: 65: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,312 INFO L273 TraceCheckUtils]: 66: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,312 INFO L273 TraceCheckUtils]: 67: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,312 INFO L273 TraceCheckUtils]: 68: Hoare triple {9085#false} assume !(~i~0 < 1000); {9085#false} is VALID [2018-11-14 17:09:11,312 INFO L273 TraceCheckUtils]: 69: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 17:09:11,313 INFO L273 TraceCheckUtils]: 70: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,313 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {9085#false} {9085#false} #73#return; {9085#false} is VALID [2018-11-14 17:09:11,313 INFO L273 TraceCheckUtils]: 72: Hoare triple {9085#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {9085#false} is VALID [2018-11-14 17:09:11,313 INFO L256 TraceCheckUtils]: 73: Hoare triple {9085#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 17:09:11,313 INFO L273 TraceCheckUtils]: 74: Hoare triple {9085#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 17:09:11,313 INFO L273 TraceCheckUtils]: 75: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,313 INFO L273 TraceCheckUtils]: 76: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,313 INFO L273 TraceCheckUtils]: 77: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,313 INFO L273 TraceCheckUtils]: 78: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,314 INFO L273 TraceCheckUtils]: 79: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,314 INFO L273 TraceCheckUtils]: 80: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,314 INFO L273 TraceCheckUtils]: 81: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,314 INFO L273 TraceCheckUtils]: 82: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,314 INFO L273 TraceCheckUtils]: 83: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,314 INFO L273 TraceCheckUtils]: 84: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,314 INFO L273 TraceCheckUtils]: 85: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,314 INFO L273 TraceCheckUtils]: 86: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,314 INFO L273 TraceCheckUtils]: 87: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,315 INFO L273 TraceCheckUtils]: 88: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,315 INFO L273 TraceCheckUtils]: 89: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,315 INFO L273 TraceCheckUtils]: 90: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,315 INFO L273 TraceCheckUtils]: 91: Hoare triple {9085#false} assume !(~i~0 < 1000); {9085#false} is VALID [2018-11-14 17:09:11,315 INFO L273 TraceCheckUtils]: 92: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 17:09:11,315 INFO L273 TraceCheckUtils]: 93: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,315 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {9085#false} {9085#false} #75#return; {9085#false} is VALID [2018-11-14 17:09:11,315 INFO L273 TraceCheckUtils]: 95: Hoare triple {9085#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {9085#false} is VALID [2018-11-14 17:09:11,315 INFO L273 TraceCheckUtils]: 96: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,316 INFO L273 TraceCheckUtils]: 97: Hoare triple {9085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:09:11,316 INFO L273 TraceCheckUtils]: 98: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:09:11,316 INFO L273 TraceCheckUtils]: 99: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,316 INFO L273 TraceCheckUtils]: 100: Hoare triple {9085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:09:11,316 INFO L273 TraceCheckUtils]: 101: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:09:11,316 INFO L273 TraceCheckUtils]: 102: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,316 INFO L273 TraceCheckUtils]: 103: Hoare triple {9085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {9085#false} is VALID [2018-11-14 17:09:11,316 INFO L273 TraceCheckUtils]: 104: Hoare triple {9085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {9085#false} is VALID [2018-11-14 17:09:11,316 INFO L273 TraceCheckUtils]: 105: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,317 INFO L273 TraceCheckUtils]: 106: Hoare triple {9085#false} assume !(~i~2 < 999); {9085#false} is VALID [2018-11-14 17:09:11,317 INFO L273 TraceCheckUtils]: 107: Hoare triple {9085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {9085#false} is VALID [2018-11-14 17:09:11,317 INFO L256 TraceCheckUtils]: 108: Hoare triple {9085#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {9085#false} is VALID [2018-11-14 17:09:11,317 INFO L273 TraceCheckUtils]: 109: Hoare triple {9085#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {9085#false} is VALID [2018-11-14 17:09:11,317 INFO L273 TraceCheckUtils]: 110: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,317 INFO L273 TraceCheckUtils]: 111: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,317 INFO L273 TraceCheckUtils]: 112: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,317 INFO L273 TraceCheckUtils]: 113: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,317 INFO L273 TraceCheckUtils]: 114: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,318 INFO L273 TraceCheckUtils]: 115: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,318 INFO L273 TraceCheckUtils]: 116: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,318 INFO L273 TraceCheckUtils]: 117: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,318 INFO L273 TraceCheckUtils]: 118: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,318 INFO L273 TraceCheckUtils]: 119: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,318 INFO L273 TraceCheckUtils]: 120: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,318 INFO L273 TraceCheckUtils]: 121: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,318 INFO L273 TraceCheckUtils]: 122: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,318 INFO L273 TraceCheckUtils]: 123: Hoare triple {9085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {9085#false} is VALID [2018-11-14 17:09:11,319 INFO L273 TraceCheckUtils]: 124: Hoare triple {9085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {9085#false} is VALID [2018-11-14 17:09:11,319 INFO L273 TraceCheckUtils]: 125: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,319 INFO L273 TraceCheckUtils]: 126: Hoare triple {9085#false} assume !(~i~0 < 1000); {9085#false} is VALID [2018-11-14 17:09:11,319 INFO L273 TraceCheckUtils]: 127: Hoare triple {9085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {9085#false} is VALID [2018-11-14 17:09:11,319 INFO L273 TraceCheckUtils]: 128: Hoare triple {9085#false} assume true; {9085#false} is VALID [2018-11-14 17:09:11,319 INFO L268 TraceCheckUtils]: 129: Hoare quadruple {9085#false} {9085#false} #77#return; {9085#false} is VALID [2018-11-14 17:09:11,319 INFO L273 TraceCheckUtils]: 130: Hoare triple {9085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {9085#false} is VALID [2018-11-14 17:09:11,320 INFO L273 TraceCheckUtils]: 131: Hoare triple {9085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {9085#false} is VALID [2018-11-14 17:09:11,320 INFO L273 TraceCheckUtils]: 132: Hoare triple {9085#false} assume !false; {9085#false} is VALID [2018-11-14 17:09:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:09:11,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:11,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 17:09:11,348 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 17:09:11,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:11,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:09:11,430 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-14 17:09:11,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:09:11,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:09:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:09:11,431 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand 18 states. [2018-11-14 17:09:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:12,271 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-14 17:09:12,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:09:12,271 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 133 [2018-11-14 17:09:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:09:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 17:09:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:09:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 102 transitions. [2018-11-14 17:09:12,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 102 transitions. [2018-11-14 17:09:12,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:12,371 INFO L225 Difference]: With dead ends: 138 [2018-11-14 17:09:12,371 INFO L226 Difference]: Without dead ends: 96 [2018-11-14 17:09:12,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:09:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-14 17:09:12,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-11-14 17:09:12,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:12,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 95 states. [2018-11-14 17:09:12,395 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 95 states. [2018-11-14 17:09:12,395 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 95 states. [2018-11-14 17:09:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:12,397 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:09:12,397 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:09:12,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:12,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:12,398 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 96 states. [2018-11-14 17:09:12,398 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 96 states. [2018-11-14 17:09:12,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:12,400 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2018-11-14 17:09:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-14 17:09:12,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:12,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:12,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:12,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 17:09:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-14 17:09:12,403 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 133 [2018-11-14 17:09:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:12,404 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-14 17:09:12,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:09:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-14 17:09:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-14 17:09:12,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:12,406 INFO L375 BasicCegarLoop]: trace histogram [18, 16, 15, 15, 15, 15, 4, 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-14 17:09:12,406 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:12,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash 377991245, now seen corresponding path program 15 times [2018-11-14 17:09:12,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:12,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:12,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:13,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 17:09:13,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {10007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10007#true} is VALID [2018-11-14 17:09:13,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 17:09:13,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 17:09:13,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {10007#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10009#(= main_~i~1 0)} is VALID [2018-11-14 17:09:13,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {10009#(= main_~i~1 0)} assume true; {10009#(= main_~i~1 0)} is VALID [2018-11-14 17:09:13,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {10009#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10009#(= main_~i~1 0)} is VALID [2018-11-14 17:09:13,771 INFO L273 TraceCheckUtils]: 8: Hoare triple {10009#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:13,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {10010#(<= main_~i~1 1)} assume true; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:13,772 INFO L273 TraceCheckUtils]: 10: Hoare triple {10010#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10010#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:13,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {10010#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:13,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {10011#(<= main_~i~1 2)} assume true; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:13,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {10011#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10011#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:13,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {10011#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:13,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {10012#(<= main_~i~1 3)} assume true; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:13,776 INFO L273 TraceCheckUtils]: 16: Hoare triple {10012#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10012#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:13,777 INFO L273 TraceCheckUtils]: 17: Hoare triple {10012#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:13,777 INFO L273 TraceCheckUtils]: 18: Hoare triple {10013#(<= main_~i~1 4)} assume true; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:13,778 INFO L273 TraceCheckUtils]: 19: Hoare triple {10013#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10013#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:13,778 INFO L273 TraceCheckUtils]: 20: Hoare triple {10013#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:13,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {10014#(<= main_~i~1 5)} assume true; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:13,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {10014#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10014#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:13,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {10014#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:13,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {10015#(<= main_~i~1 6)} assume true; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:13,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {10015#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10015#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:13,782 INFO L273 TraceCheckUtils]: 26: Hoare triple {10015#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:13,782 INFO L273 TraceCheckUtils]: 27: Hoare triple {10016#(<= main_~i~1 7)} assume true; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:13,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {10016#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10016#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:13,784 INFO L273 TraceCheckUtils]: 29: Hoare triple {10016#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:13,784 INFO L273 TraceCheckUtils]: 30: Hoare triple {10017#(<= main_~i~1 8)} assume true; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:13,785 INFO L273 TraceCheckUtils]: 31: Hoare triple {10017#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10017#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:13,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {10017#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:13,786 INFO L273 TraceCheckUtils]: 33: Hoare triple {10018#(<= main_~i~1 9)} assume true; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:13,786 INFO L273 TraceCheckUtils]: 34: Hoare triple {10018#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10018#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:13,787 INFO L273 TraceCheckUtils]: 35: Hoare triple {10018#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:13,788 INFO L273 TraceCheckUtils]: 36: Hoare triple {10019#(<= main_~i~1 10)} assume true; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:13,788 INFO L273 TraceCheckUtils]: 37: Hoare triple {10019#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10019#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:13,789 INFO L273 TraceCheckUtils]: 38: Hoare triple {10019#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:13,790 INFO L273 TraceCheckUtils]: 39: Hoare triple {10020#(<= main_~i~1 11)} assume true; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:13,790 INFO L273 TraceCheckUtils]: 40: Hoare triple {10020#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10020#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:13,791 INFO L273 TraceCheckUtils]: 41: Hoare triple {10020#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:13,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {10021#(<= main_~i~1 12)} assume true; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:13,792 INFO L273 TraceCheckUtils]: 43: Hoare triple {10021#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10021#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:13,793 INFO L273 TraceCheckUtils]: 44: Hoare triple {10021#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:13,793 INFO L273 TraceCheckUtils]: 45: Hoare triple {10022#(<= main_~i~1 13)} assume true; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:13,794 INFO L273 TraceCheckUtils]: 46: Hoare triple {10022#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10022#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:13,794 INFO L273 TraceCheckUtils]: 47: Hoare triple {10022#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:13,795 INFO L273 TraceCheckUtils]: 48: Hoare triple {10023#(<= main_~i~1 14)} assume true; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:13,795 INFO L273 TraceCheckUtils]: 49: Hoare triple {10023#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10023#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:13,796 INFO L273 TraceCheckUtils]: 50: Hoare triple {10023#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:13,797 INFO L273 TraceCheckUtils]: 51: Hoare triple {10024#(<= main_~i~1 15)} assume true; {10024#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:13,797 INFO L273 TraceCheckUtils]: 52: Hoare triple {10024#(<= main_~i~1 15)} assume !(~i~1 < 1000); {10008#false} is VALID [2018-11-14 17:09:13,797 INFO L256 TraceCheckUtils]: 53: Hoare triple {10008#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:09:13,798 INFO L273 TraceCheckUtils]: 54: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:09:13,798 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,798 INFO L273 TraceCheckUtils]: 56: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,798 INFO L273 TraceCheckUtils]: 57: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,798 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,799 INFO L273 TraceCheckUtils]: 59: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,799 INFO L273 TraceCheckUtils]: 60: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,799 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,799 INFO L273 TraceCheckUtils]: 62: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,799 INFO L273 TraceCheckUtils]: 63: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,800 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,800 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,800 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,800 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,801 INFO L273 TraceCheckUtils]: 69: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,801 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,801 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 1000); {10007#true} is VALID [2018-11-14 17:09:13,801 INFO L273 TraceCheckUtils]: 72: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:09:13,801 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,802 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10008#false} #73#return; {10008#false} is VALID [2018-11-14 17:09:13,802 INFO L273 TraceCheckUtils]: 75: Hoare triple {10008#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10008#false} is VALID [2018-11-14 17:09:13,802 INFO L256 TraceCheckUtils]: 76: Hoare triple {10008#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:09:13,802 INFO L273 TraceCheckUtils]: 77: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:09:13,802 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,802 INFO L273 TraceCheckUtils]: 79: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,802 INFO L273 TraceCheckUtils]: 80: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,803 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,803 INFO L273 TraceCheckUtils]: 82: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,803 INFO L273 TraceCheckUtils]: 83: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,803 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,803 INFO L273 TraceCheckUtils]: 85: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,803 INFO L273 TraceCheckUtils]: 86: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,803 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,803 INFO L273 TraceCheckUtils]: 88: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,803 INFO L273 TraceCheckUtils]: 89: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,804 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,804 INFO L273 TraceCheckUtils]: 91: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,804 INFO L273 TraceCheckUtils]: 92: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,804 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,804 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 1000); {10007#true} is VALID [2018-11-14 17:09:13,804 INFO L273 TraceCheckUtils]: 95: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:09:13,804 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,804 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10008#false} #75#return; {10008#false} is VALID [2018-11-14 17:09:13,805 INFO L273 TraceCheckUtils]: 98: Hoare triple {10008#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10008#false} is VALID [2018-11-14 17:09:13,805 INFO L273 TraceCheckUtils]: 99: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:13,805 INFO L273 TraceCheckUtils]: 100: Hoare triple {10008#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 17:09:13,805 INFO L273 TraceCheckUtils]: 101: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 17:09:13,805 INFO L273 TraceCheckUtils]: 102: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:13,805 INFO L273 TraceCheckUtils]: 103: Hoare triple {10008#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 17:09:13,805 INFO L273 TraceCheckUtils]: 104: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 17:09:13,805 INFO L273 TraceCheckUtils]: 105: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:13,805 INFO L273 TraceCheckUtils]: 106: Hoare triple {10008#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10008#false} is VALID [2018-11-14 17:09:13,806 INFO L273 TraceCheckUtils]: 107: Hoare triple {10008#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10008#false} is VALID [2018-11-14 17:09:13,806 INFO L273 TraceCheckUtils]: 108: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:13,806 INFO L273 TraceCheckUtils]: 109: Hoare triple {10008#false} assume !(~i~2 < 999); {10008#false} is VALID [2018-11-14 17:09:13,806 INFO L273 TraceCheckUtils]: 110: Hoare triple {10008#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {10008#false} is VALID [2018-11-14 17:09:13,806 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:09:13,806 INFO L273 TraceCheckUtils]: 112: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:09:13,806 INFO L273 TraceCheckUtils]: 113: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,806 INFO L273 TraceCheckUtils]: 114: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,806 INFO L273 TraceCheckUtils]: 115: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,807 INFO L273 TraceCheckUtils]: 116: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,807 INFO L273 TraceCheckUtils]: 117: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,807 INFO L273 TraceCheckUtils]: 118: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,807 INFO L273 TraceCheckUtils]: 119: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,807 INFO L273 TraceCheckUtils]: 120: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,807 INFO L273 TraceCheckUtils]: 121: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,807 INFO L273 TraceCheckUtils]: 122: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,807 INFO L273 TraceCheckUtils]: 123: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,807 INFO L273 TraceCheckUtils]: 124: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,808 INFO L273 TraceCheckUtils]: 125: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,808 INFO L273 TraceCheckUtils]: 126: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:13,808 INFO L273 TraceCheckUtils]: 127: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:13,808 INFO L273 TraceCheckUtils]: 128: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,808 INFO L273 TraceCheckUtils]: 129: Hoare triple {10007#true} assume !(~i~0 < 1000); {10007#true} is VALID [2018-11-14 17:09:13,808 INFO L273 TraceCheckUtils]: 130: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:09:13,808 INFO L273 TraceCheckUtils]: 131: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:13,808 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10007#true} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 17:09:13,808 INFO L273 TraceCheckUtils]: 133: Hoare triple {10008#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10008#false} is VALID [2018-11-14 17:09:13,809 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 17:09:13,809 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 17:09:13,817 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-11-14 17:09:13,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:13,818 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-14 17:09:13,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:09:13,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 17:09:13,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:13,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:14,071 INFO L256 TraceCheckUtils]: 0: Hoare triple {10007#true} call ULTIMATE.init(); {10007#true} is VALID [2018-11-14 17:09:14,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {10007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10007#true} is VALID [2018-11-14 17:09:14,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10007#true} {10007#true} #69#return; {10007#true} is VALID [2018-11-14 17:09:14,072 INFO L256 TraceCheckUtils]: 4: Hoare triple {10007#true} call #t~ret13 := main(); {10007#true} is VALID [2018-11-14 17:09:14,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {10007#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10007#true} is VALID [2018-11-14 17:09:14,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,074 INFO L273 TraceCheckUtils]: 15: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,074 INFO L273 TraceCheckUtils]: 17: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 22: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 23: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 24: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,076 INFO L273 TraceCheckUtils]: 35: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,076 INFO L273 TraceCheckUtils]: 36: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,077 INFO L273 TraceCheckUtils]: 39: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,077 INFO L273 TraceCheckUtils]: 41: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,077 INFO L273 TraceCheckUtils]: 42: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,077 INFO L273 TraceCheckUtils]: 43: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,077 INFO L273 TraceCheckUtils]: 44: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L273 TraceCheckUtils]: 45: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L273 TraceCheckUtils]: 46: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L273 TraceCheckUtils]: 47: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L273 TraceCheckUtils]: 48: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L273 TraceCheckUtils]: 49: Hoare triple {10007#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L273 TraceCheckUtils]: 50: Hoare triple {10007#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L273 TraceCheckUtils]: 51: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L273 TraceCheckUtils]: 52: Hoare triple {10007#true} assume !(~i~1 < 1000); {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L256 TraceCheckUtils]: 53: Hoare triple {10007#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:09:14,078 INFO L273 TraceCheckUtils]: 54: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:09:14,079 INFO L273 TraceCheckUtils]: 55: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,079 INFO L273 TraceCheckUtils]: 57: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,079 INFO L273 TraceCheckUtils]: 58: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,079 INFO L273 TraceCheckUtils]: 59: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,079 INFO L273 TraceCheckUtils]: 60: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,079 INFO L273 TraceCheckUtils]: 61: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,079 INFO L273 TraceCheckUtils]: 62: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,079 INFO L273 TraceCheckUtils]: 63: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,080 INFO L273 TraceCheckUtils]: 64: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,080 INFO L273 TraceCheckUtils]: 65: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,080 INFO L273 TraceCheckUtils]: 66: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,080 INFO L273 TraceCheckUtils]: 67: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,080 INFO L273 TraceCheckUtils]: 68: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,080 INFO L273 TraceCheckUtils]: 69: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,080 INFO L273 TraceCheckUtils]: 70: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,080 INFO L273 TraceCheckUtils]: 71: Hoare triple {10007#true} assume !(~i~0 < 1000); {10007#true} is VALID [2018-11-14 17:09:14,080 INFO L273 TraceCheckUtils]: 72: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:09:14,081 INFO L273 TraceCheckUtils]: 73: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,081 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {10007#true} {10007#true} #73#return; {10007#true} is VALID [2018-11-14 17:09:14,081 INFO L273 TraceCheckUtils]: 75: Hoare triple {10007#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10007#true} is VALID [2018-11-14 17:09:14,081 INFO L256 TraceCheckUtils]: 76: Hoare triple {10007#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10007#true} is VALID [2018-11-14 17:09:14,081 INFO L273 TraceCheckUtils]: 77: Hoare triple {10007#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10007#true} is VALID [2018-11-14 17:09:14,081 INFO L273 TraceCheckUtils]: 78: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,081 INFO L273 TraceCheckUtils]: 79: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,081 INFO L273 TraceCheckUtils]: 80: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,081 INFO L273 TraceCheckUtils]: 81: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,082 INFO L273 TraceCheckUtils]: 82: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,082 INFO L273 TraceCheckUtils]: 83: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,082 INFO L273 TraceCheckUtils]: 84: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,082 INFO L273 TraceCheckUtils]: 85: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,082 INFO L273 TraceCheckUtils]: 86: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,082 INFO L273 TraceCheckUtils]: 87: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,082 INFO L273 TraceCheckUtils]: 88: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,082 INFO L273 TraceCheckUtils]: 89: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,082 INFO L273 TraceCheckUtils]: 90: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,083 INFO L273 TraceCheckUtils]: 91: Hoare triple {10007#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10007#true} is VALID [2018-11-14 17:09:14,083 INFO L273 TraceCheckUtils]: 92: Hoare triple {10007#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10007#true} is VALID [2018-11-14 17:09:14,083 INFO L273 TraceCheckUtils]: 93: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,083 INFO L273 TraceCheckUtils]: 94: Hoare triple {10007#true} assume !(~i~0 < 1000); {10007#true} is VALID [2018-11-14 17:09:14,083 INFO L273 TraceCheckUtils]: 95: Hoare triple {10007#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10007#true} is VALID [2018-11-14 17:09:14,083 INFO L273 TraceCheckUtils]: 96: Hoare triple {10007#true} assume true; {10007#true} is VALID [2018-11-14 17:09:14,083 INFO L268 TraceCheckUtils]: 97: Hoare quadruple {10007#true} {10007#true} #75#return; {10007#true} is VALID [2018-11-14 17:09:14,084 INFO L273 TraceCheckUtils]: 98: Hoare triple {10007#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:14,084 INFO L273 TraceCheckUtils]: 99: Hoare triple {10322#(<= main_~i~2 0)} assume true; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:14,084 INFO L273 TraceCheckUtils]: 100: Hoare triple {10322#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10322#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:14,085 INFO L273 TraceCheckUtils]: 101: Hoare triple {10322#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:14,085 INFO L273 TraceCheckUtils]: 102: Hoare triple {10332#(<= main_~i~2 1)} assume true; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:14,085 INFO L273 TraceCheckUtils]: 103: Hoare triple {10332#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10332#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:14,086 INFO L273 TraceCheckUtils]: 104: Hoare triple {10332#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:14,086 INFO L273 TraceCheckUtils]: 105: Hoare triple {10342#(<= main_~i~2 2)} assume true; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:14,086 INFO L273 TraceCheckUtils]: 106: Hoare triple {10342#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10342#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:14,087 INFO L273 TraceCheckUtils]: 107: Hoare triple {10342#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:14,088 INFO L273 TraceCheckUtils]: 108: Hoare triple {10352#(<= main_~i~2 3)} assume true; {10352#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:14,088 INFO L273 TraceCheckUtils]: 109: Hoare triple {10352#(<= main_~i~2 3)} assume !(~i~2 < 999); {10008#false} is VALID [2018-11-14 17:09:14,106 INFO L273 TraceCheckUtils]: 110: Hoare triple {10008#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {10008#false} is VALID [2018-11-14 17:09:14,106 INFO L256 TraceCheckUtils]: 111: Hoare triple {10008#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10008#false} is VALID [2018-11-14 17:09:14,106 INFO L273 TraceCheckUtils]: 112: Hoare triple {10008#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10008#false} is VALID [2018-11-14 17:09:14,106 INFO L273 TraceCheckUtils]: 113: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:14,107 INFO L273 TraceCheckUtils]: 114: Hoare triple {10008#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:09:14,107 INFO L273 TraceCheckUtils]: 115: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:09:14,107 INFO L273 TraceCheckUtils]: 116: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:14,107 INFO L273 TraceCheckUtils]: 117: Hoare triple {10008#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:09:14,107 INFO L273 TraceCheckUtils]: 118: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:09:14,107 INFO L273 TraceCheckUtils]: 119: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:14,107 INFO L273 TraceCheckUtils]: 120: Hoare triple {10008#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:09:14,109 INFO L273 TraceCheckUtils]: 121: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:09:14,109 INFO L273 TraceCheckUtils]: 122: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:14,109 INFO L273 TraceCheckUtils]: 123: Hoare triple {10008#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:09:14,109 INFO L273 TraceCheckUtils]: 124: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:09:14,109 INFO L273 TraceCheckUtils]: 125: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:14,109 INFO L273 TraceCheckUtils]: 126: Hoare triple {10008#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10008#false} is VALID [2018-11-14 17:09:14,110 INFO L273 TraceCheckUtils]: 127: Hoare triple {10008#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10008#false} is VALID [2018-11-14 17:09:14,110 INFO L273 TraceCheckUtils]: 128: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:14,110 INFO L273 TraceCheckUtils]: 129: Hoare triple {10008#false} assume !(~i~0 < 1000); {10008#false} is VALID [2018-11-14 17:09:14,110 INFO L273 TraceCheckUtils]: 130: Hoare triple {10008#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10008#false} is VALID [2018-11-14 17:09:14,110 INFO L273 TraceCheckUtils]: 131: Hoare triple {10008#false} assume true; {10008#false} is VALID [2018-11-14 17:09:14,110 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {10008#false} {10008#false} #77#return; {10008#false} is VALID [2018-11-14 17:09:14,111 INFO L273 TraceCheckUtils]: 133: Hoare triple {10008#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10008#false} is VALID [2018-11-14 17:09:14,111 INFO L273 TraceCheckUtils]: 134: Hoare triple {10008#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10008#false} is VALID [2018-11-14 17:09:14,111 INFO L273 TraceCheckUtils]: 135: Hoare triple {10008#false} assume !false; {10008#false} is VALID [2018-11-14 17:09:14,118 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 202 proven. 15 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2018-11-14 17:09:14,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:14,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 22 [2018-11-14 17:09:14,139 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 17:09:14,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:14,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 17:09:14,246 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-14 17:09:14,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 17:09:14,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 17:09:14,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:09:14,247 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 22 states. [2018-11-14 17:09:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:14,680 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-11-14 17:09:14,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:09:14,680 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 136 [2018-11-14 17:09:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:14,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:09:14,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 17:09:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:09:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 118 transitions. [2018-11-14 17:09:14,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 118 transitions. [2018-11-14 17:09:15,242 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-14 17:09:15,245 INFO L225 Difference]: With dead ends: 145 [2018-11-14 17:09:15,245 INFO L226 Difference]: Without dead ends: 103 [2018-11-14 17:09:15,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:09:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-14 17:09:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-11-14 17:09:15,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:15,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 101 states. [2018-11-14 17:09:15,278 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 101 states. [2018-11-14 17:09:15,278 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 101 states. [2018-11-14 17:09:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:15,281 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 17:09:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 17:09:15,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:15,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:15,283 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 103 states. [2018-11-14 17:09:15,283 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 103 states. [2018-11-14 17:09:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:15,285 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-11-14 17:09:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-14 17:09:15,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:15,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:15,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:15,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 17:09:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2018-11-14 17:09:15,289 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 136 [2018-11-14 17:09:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:15,289 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2018-11-14 17:09:15,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 17:09:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2018-11-14 17:09:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-14 17:09:15,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:15,290 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 16, 16, 15, 15, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:09:15,291 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:15,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash -542134491, now seen corresponding path program 16 times [2018-11-14 17:09:15,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:15,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:15,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:15,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:15,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:16,195 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 17:09:16,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {10974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10974#true} is VALID [2018-11-14 17:09:16,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 17:09:16,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 17:09:16,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {10974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10976#(= main_~i~1 0)} is VALID [2018-11-14 17:09:16,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {10976#(= main_~i~1 0)} assume true; {10976#(= main_~i~1 0)} is VALID [2018-11-14 17:09:16,198 INFO L273 TraceCheckUtils]: 7: Hoare triple {10976#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10976#(= main_~i~1 0)} is VALID [2018-11-14 17:09:16,199 INFO L273 TraceCheckUtils]: 8: Hoare triple {10976#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:16,199 INFO L273 TraceCheckUtils]: 9: Hoare triple {10977#(<= main_~i~1 1)} assume true; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:16,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {10977#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10977#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:16,200 INFO L273 TraceCheckUtils]: 11: Hoare triple {10977#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:16,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {10978#(<= main_~i~1 2)} assume true; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:16,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {10978#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10978#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:16,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {10978#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:16,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {10979#(<= main_~i~1 3)} assume true; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:16,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {10979#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10979#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:16,202 INFO L273 TraceCheckUtils]: 17: Hoare triple {10979#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:16,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {10980#(<= main_~i~1 4)} assume true; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:16,203 INFO L273 TraceCheckUtils]: 19: Hoare triple {10980#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10980#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:16,204 INFO L273 TraceCheckUtils]: 20: Hoare triple {10980#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:16,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {10981#(<= main_~i~1 5)} assume true; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:16,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {10981#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10981#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:16,205 INFO L273 TraceCheckUtils]: 23: Hoare triple {10981#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:16,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {10982#(<= main_~i~1 6)} assume true; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:16,206 INFO L273 TraceCheckUtils]: 25: Hoare triple {10982#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10982#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:16,207 INFO L273 TraceCheckUtils]: 26: Hoare triple {10982#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:16,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {10983#(<= main_~i~1 7)} assume true; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:16,208 INFO L273 TraceCheckUtils]: 28: Hoare triple {10983#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10983#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:16,209 INFO L273 TraceCheckUtils]: 29: Hoare triple {10983#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:16,209 INFO L273 TraceCheckUtils]: 30: Hoare triple {10984#(<= main_~i~1 8)} assume true; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:16,210 INFO L273 TraceCheckUtils]: 31: Hoare triple {10984#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10984#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:16,211 INFO L273 TraceCheckUtils]: 32: Hoare triple {10984#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:16,211 INFO L273 TraceCheckUtils]: 33: Hoare triple {10985#(<= main_~i~1 9)} assume true; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:16,212 INFO L273 TraceCheckUtils]: 34: Hoare triple {10985#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10985#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:16,212 INFO L273 TraceCheckUtils]: 35: Hoare triple {10985#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:16,213 INFO L273 TraceCheckUtils]: 36: Hoare triple {10986#(<= main_~i~1 10)} assume true; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:16,213 INFO L273 TraceCheckUtils]: 37: Hoare triple {10986#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10986#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:16,214 INFO L273 TraceCheckUtils]: 38: Hoare triple {10986#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:16,215 INFO L273 TraceCheckUtils]: 39: Hoare triple {10987#(<= main_~i~1 11)} assume true; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:16,215 INFO L273 TraceCheckUtils]: 40: Hoare triple {10987#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10987#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:16,216 INFO L273 TraceCheckUtils]: 41: Hoare triple {10987#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:16,217 INFO L273 TraceCheckUtils]: 42: Hoare triple {10988#(<= main_~i~1 12)} assume true; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:16,217 INFO L273 TraceCheckUtils]: 43: Hoare triple {10988#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10988#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:16,218 INFO L273 TraceCheckUtils]: 44: Hoare triple {10988#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:16,218 INFO L273 TraceCheckUtils]: 45: Hoare triple {10989#(<= main_~i~1 13)} assume true; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:16,219 INFO L273 TraceCheckUtils]: 46: Hoare triple {10989#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10989#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:16,220 INFO L273 TraceCheckUtils]: 47: Hoare triple {10989#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:16,220 INFO L273 TraceCheckUtils]: 48: Hoare triple {10990#(<= main_~i~1 14)} assume true; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:16,221 INFO L273 TraceCheckUtils]: 49: Hoare triple {10990#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10990#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:16,221 INFO L273 TraceCheckUtils]: 50: Hoare triple {10990#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:16,222 INFO L273 TraceCheckUtils]: 51: Hoare triple {10991#(<= main_~i~1 15)} assume true; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:16,222 INFO L273 TraceCheckUtils]: 52: Hoare triple {10991#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10991#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:16,223 INFO L273 TraceCheckUtils]: 53: Hoare triple {10991#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:16,224 INFO L273 TraceCheckUtils]: 54: Hoare triple {10992#(<= main_~i~1 16)} assume true; {10992#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:16,224 INFO L273 TraceCheckUtils]: 55: Hoare triple {10992#(<= main_~i~1 16)} assume !(~i~1 < 1000); {10975#false} is VALID [2018-11-14 17:09:16,225 INFO L256 TraceCheckUtils]: 56: Hoare triple {10975#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:09:16,225 INFO L273 TraceCheckUtils]: 57: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:09:16,225 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,225 INFO L273 TraceCheckUtils]: 59: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,225 INFO L273 TraceCheckUtils]: 60: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,226 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,226 INFO L273 TraceCheckUtils]: 62: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,226 INFO L273 TraceCheckUtils]: 63: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,226 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,226 INFO L273 TraceCheckUtils]: 65: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,226 INFO L273 TraceCheckUtils]: 66: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,227 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,227 INFO L273 TraceCheckUtils]: 68: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,227 INFO L273 TraceCheckUtils]: 69: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,227 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,227 INFO L273 TraceCheckUtils]: 71: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,228 INFO L273 TraceCheckUtils]: 72: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,228 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,228 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 1000); {10974#true} is VALID [2018-11-14 17:09:16,228 INFO L273 TraceCheckUtils]: 75: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:09:16,228 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,229 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10975#false} #73#return; {10975#false} is VALID [2018-11-14 17:09:16,229 INFO L273 TraceCheckUtils]: 78: Hoare triple {10975#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10975#false} is VALID [2018-11-14 17:09:16,229 INFO L256 TraceCheckUtils]: 79: Hoare triple {10975#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:09:16,229 INFO L273 TraceCheckUtils]: 80: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:09:16,229 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,229 INFO L273 TraceCheckUtils]: 82: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,229 INFO L273 TraceCheckUtils]: 83: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,229 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,230 INFO L273 TraceCheckUtils]: 85: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,230 INFO L273 TraceCheckUtils]: 86: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,230 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,230 INFO L273 TraceCheckUtils]: 88: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,230 INFO L273 TraceCheckUtils]: 89: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,230 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,230 INFO L273 TraceCheckUtils]: 91: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,230 INFO L273 TraceCheckUtils]: 92: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,230 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,231 INFO L273 TraceCheckUtils]: 94: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,231 INFO L273 TraceCheckUtils]: 95: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,231 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,231 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 1000); {10974#true} is VALID [2018-11-14 17:09:16,231 INFO L273 TraceCheckUtils]: 98: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:09:16,231 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,231 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10975#false} #75#return; {10975#false} is VALID [2018-11-14 17:09:16,231 INFO L273 TraceCheckUtils]: 101: Hoare triple {10975#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10975#false} is VALID [2018-11-14 17:09:16,231 INFO L273 TraceCheckUtils]: 102: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:09:16,232 INFO L273 TraceCheckUtils]: 103: Hoare triple {10975#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 17:09:16,232 INFO L273 TraceCheckUtils]: 104: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 17:09:16,232 INFO L273 TraceCheckUtils]: 105: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:09:16,232 INFO L273 TraceCheckUtils]: 106: Hoare triple {10975#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 17:09:16,232 INFO L273 TraceCheckUtils]: 107: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 17:09:16,232 INFO L273 TraceCheckUtils]: 108: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:09:16,232 INFO L273 TraceCheckUtils]: 109: Hoare triple {10975#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 17:09:16,232 INFO L273 TraceCheckUtils]: 110: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 17:09:16,232 INFO L273 TraceCheckUtils]: 111: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:09:16,233 INFO L273 TraceCheckUtils]: 112: Hoare triple {10975#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10975#false} is VALID [2018-11-14 17:09:16,233 INFO L273 TraceCheckUtils]: 113: Hoare triple {10975#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10975#false} is VALID [2018-11-14 17:09:16,233 INFO L273 TraceCheckUtils]: 114: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:09:16,233 INFO L273 TraceCheckUtils]: 115: Hoare triple {10975#false} assume !(~i~2 < 999); {10975#false} is VALID [2018-11-14 17:09:16,233 INFO L273 TraceCheckUtils]: 116: Hoare triple {10975#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {10975#false} is VALID [2018-11-14 17:09:16,233 INFO L256 TraceCheckUtils]: 117: Hoare triple {10975#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:09:16,233 INFO L273 TraceCheckUtils]: 118: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:09:16,233 INFO L273 TraceCheckUtils]: 119: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,234 INFO L273 TraceCheckUtils]: 120: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,234 INFO L273 TraceCheckUtils]: 121: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,234 INFO L273 TraceCheckUtils]: 122: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,234 INFO L273 TraceCheckUtils]: 123: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,234 INFO L273 TraceCheckUtils]: 124: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,234 INFO L273 TraceCheckUtils]: 125: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,234 INFO L273 TraceCheckUtils]: 126: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,234 INFO L273 TraceCheckUtils]: 127: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,234 INFO L273 TraceCheckUtils]: 128: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,235 INFO L273 TraceCheckUtils]: 129: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,235 INFO L273 TraceCheckUtils]: 130: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,235 INFO L273 TraceCheckUtils]: 131: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,235 INFO L273 TraceCheckUtils]: 132: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,235 INFO L273 TraceCheckUtils]: 133: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,235 INFO L273 TraceCheckUtils]: 134: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,235 INFO L273 TraceCheckUtils]: 135: Hoare triple {10974#true} assume !(~i~0 < 1000); {10974#true} is VALID [2018-11-14 17:09:16,235 INFO L273 TraceCheckUtils]: 136: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:09:16,235 INFO L273 TraceCheckUtils]: 137: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,236 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10974#true} {10975#false} #77#return; {10975#false} is VALID [2018-11-14 17:09:16,236 INFO L273 TraceCheckUtils]: 139: Hoare triple {10975#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10975#false} is VALID [2018-11-14 17:09:16,236 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 17:09:16,236 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 17:09:16,245 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 449 trivial. 0 not checked. [2018-11-14 17:09:16,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:16,245 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-14 17:09:16,255 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:09:16,306 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:09:16,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:16,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:16,599 INFO L256 TraceCheckUtils]: 0: Hoare triple {10974#true} call ULTIMATE.init(); {10974#true} is VALID [2018-11-14 17:09:16,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {10974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10974#true} is VALID [2018-11-14 17:09:16,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10974#true} {10974#true} #69#return; {10974#true} is VALID [2018-11-14 17:09:16,600 INFO L256 TraceCheckUtils]: 4: Hoare triple {10974#true} call #t~ret13 := main(); {10974#true} is VALID [2018-11-14 17:09:16,600 INFO L273 TraceCheckUtils]: 5: Hoare triple {10974#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {10974#true} is VALID [2018-11-14 17:09:16,601 INFO L273 TraceCheckUtils]: 6: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,602 INFO L273 TraceCheckUtils]: 14: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,603 INFO L273 TraceCheckUtils]: 22: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,603 INFO L273 TraceCheckUtils]: 26: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,603 INFO L273 TraceCheckUtils]: 27: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,603 INFO L273 TraceCheckUtils]: 28: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,604 INFO L273 TraceCheckUtils]: 29: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,604 INFO L273 TraceCheckUtils]: 30: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,604 INFO L273 TraceCheckUtils]: 31: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,604 INFO L273 TraceCheckUtils]: 33: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,604 INFO L273 TraceCheckUtils]: 34: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,604 INFO L273 TraceCheckUtils]: 35: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,605 INFO L273 TraceCheckUtils]: 38: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,605 INFO L273 TraceCheckUtils]: 40: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,605 INFO L273 TraceCheckUtils]: 41: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,605 INFO L273 TraceCheckUtils]: 42: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,605 INFO L273 TraceCheckUtils]: 43: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,605 INFO L273 TraceCheckUtils]: 44: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,606 INFO L273 TraceCheckUtils]: 48: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,606 INFO L273 TraceCheckUtils]: 49: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,606 INFO L273 TraceCheckUtils]: 50: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,606 INFO L273 TraceCheckUtils]: 51: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,606 INFO L273 TraceCheckUtils]: 52: Hoare triple {10974#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {10974#true} is VALID [2018-11-14 17:09:16,606 INFO L273 TraceCheckUtils]: 53: Hoare triple {10974#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {10974#true} is VALID [2018-11-14 17:09:16,606 INFO L273 TraceCheckUtils]: 54: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,606 INFO L273 TraceCheckUtils]: 55: Hoare triple {10974#true} assume !(~i~1 < 1000); {10974#true} is VALID [2018-11-14 17:09:16,607 INFO L256 TraceCheckUtils]: 56: Hoare triple {10974#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:09:16,607 INFO L273 TraceCheckUtils]: 57: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:09:16,607 INFO L273 TraceCheckUtils]: 58: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,607 INFO L273 TraceCheckUtils]: 59: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,607 INFO L273 TraceCheckUtils]: 60: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,607 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,607 INFO L273 TraceCheckUtils]: 62: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,607 INFO L273 TraceCheckUtils]: 63: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,607 INFO L273 TraceCheckUtils]: 64: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,608 INFO L273 TraceCheckUtils]: 65: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,608 INFO L273 TraceCheckUtils]: 66: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,608 INFO L273 TraceCheckUtils]: 67: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,608 INFO L273 TraceCheckUtils]: 68: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,608 INFO L273 TraceCheckUtils]: 69: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,608 INFO L273 TraceCheckUtils]: 70: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,608 INFO L273 TraceCheckUtils]: 71: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,608 INFO L273 TraceCheckUtils]: 72: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,608 INFO L273 TraceCheckUtils]: 73: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,609 INFO L273 TraceCheckUtils]: 74: Hoare triple {10974#true} assume !(~i~0 < 1000); {10974#true} is VALID [2018-11-14 17:09:16,609 INFO L273 TraceCheckUtils]: 75: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:09:16,609 INFO L273 TraceCheckUtils]: 76: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,609 INFO L268 TraceCheckUtils]: 77: Hoare quadruple {10974#true} {10974#true} #73#return; {10974#true} is VALID [2018-11-14 17:09:16,609 INFO L273 TraceCheckUtils]: 78: Hoare triple {10974#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {10974#true} is VALID [2018-11-14 17:09:16,609 INFO L256 TraceCheckUtils]: 79: Hoare triple {10974#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:09:16,609 INFO L273 TraceCheckUtils]: 80: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {10974#true} is VALID [2018-11-14 17:09:16,609 INFO L273 TraceCheckUtils]: 81: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,609 INFO L273 TraceCheckUtils]: 82: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,610 INFO L273 TraceCheckUtils]: 83: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,610 INFO L273 TraceCheckUtils]: 84: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,610 INFO L273 TraceCheckUtils]: 85: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,610 INFO L273 TraceCheckUtils]: 86: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,610 INFO L273 TraceCheckUtils]: 87: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,610 INFO L273 TraceCheckUtils]: 88: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,610 INFO L273 TraceCheckUtils]: 89: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,610 INFO L273 TraceCheckUtils]: 90: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,610 INFO L273 TraceCheckUtils]: 91: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,611 INFO L273 TraceCheckUtils]: 92: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,611 INFO L273 TraceCheckUtils]: 93: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,611 INFO L273 TraceCheckUtils]: 94: Hoare triple {10974#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {10974#true} is VALID [2018-11-14 17:09:16,611 INFO L273 TraceCheckUtils]: 95: Hoare triple {10974#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {10974#true} is VALID [2018-11-14 17:09:16,611 INFO L273 TraceCheckUtils]: 96: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,611 INFO L273 TraceCheckUtils]: 97: Hoare triple {10974#true} assume !(~i~0 < 1000); {10974#true} is VALID [2018-11-14 17:09:16,612 INFO L273 TraceCheckUtils]: 98: Hoare triple {10974#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10974#true} is VALID [2018-11-14 17:09:16,612 INFO L273 TraceCheckUtils]: 99: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,612 INFO L268 TraceCheckUtils]: 100: Hoare quadruple {10974#true} {10974#true} #75#return; {10974#true} is VALID [2018-11-14 17:09:16,612 INFO L273 TraceCheckUtils]: 101: Hoare triple {10974#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {10974#true} is VALID [2018-11-14 17:09:16,612 INFO L273 TraceCheckUtils]: 102: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,612 INFO L273 TraceCheckUtils]: 103: Hoare triple {10974#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 17:09:16,613 INFO L273 TraceCheckUtils]: 104: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 17:09:16,613 INFO L273 TraceCheckUtils]: 105: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,613 INFO L273 TraceCheckUtils]: 106: Hoare triple {10974#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 17:09:16,613 INFO L273 TraceCheckUtils]: 107: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 17:09:16,613 INFO L273 TraceCheckUtils]: 108: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,614 INFO L273 TraceCheckUtils]: 109: Hoare triple {10974#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 17:09:16,614 INFO L273 TraceCheckUtils]: 110: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 17:09:16,614 INFO L273 TraceCheckUtils]: 111: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,614 INFO L273 TraceCheckUtils]: 112: Hoare triple {10974#true} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {10974#true} is VALID [2018-11-14 17:09:16,614 INFO L273 TraceCheckUtils]: 113: Hoare triple {10974#true} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {10974#true} is VALID [2018-11-14 17:09:16,614 INFO L273 TraceCheckUtils]: 114: Hoare triple {10974#true} assume true; {10974#true} is VALID [2018-11-14 17:09:16,615 INFO L273 TraceCheckUtils]: 115: Hoare triple {10974#true} assume !(~i~2 < 999); {10974#true} is VALID [2018-11-14 17:09:16,615 INFO L273 TraceCheckUtils]: 116: Hoare triple {10974#true} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {10974#true} is VALID [2018-11-14 17:09:16,615 INFO L256 TraceCheckUtils]: 117: Hoare triple {10974#true} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {10974#true} is VALID [2018-11-14 17:09:16,634 INFO L273 TraceCheckUtils]: 118: Hoare triple {10974#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11350#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:16,648 INFO L273 TraceCheckUtils]: 119: Hoare triple {11350#(<= xor_~i~0 1)} assume true; {11350#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:16,656 INFO L273 TraceCheckUtils]: 120: Hoare triple {11350#(<= xor_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11350#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:16,670 INFO L273 TraceCheckUtils]: 121: Hoare triple {11350#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11360#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:16,684 INFO L273 TraceCheckUtils]: 122: Hoare triple {11360#(<= xor_~i~0 2)} assume true; {11360#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:16,692 INFO L273 TraceCheckUtils]: 123: Hoare triple {11360#(<= xor_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11360#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:16,701 INFO L273 TraceCheckUtils]: 124: Hoare triple {11360#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11370#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:16,715 INFO L273 TraceCheckUtils]: 125: Hoare triple {11370#(<= xor_~i~0 3)} assume true; {11370#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:16,723 INFO L273 TraceCheckUtils]: 126: Hoare triple {11370#(<= xor_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11370#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:16,736 INFO L273 TraceCheckUtils]: 127: Hoare triple {11370#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11380#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:16,749 INFO L273 TraceCheckUtils]: 128: Hoare triple {11380#(<= xor_~i~0 4)} assume true; {11380#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:16,763 INFO L273 TraceCheckUtils]: 129: Hoare triple {11380#(<= xor_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11380#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:16,772 INFO L273 TraceCheckUtils]: 130: Hoare triple {11380#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11390#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:16,784 INFO L273 TraceCheckUtils]: 131: Hoare triple {11390#(<= xor_~i~0 5)} assume true; {11390#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:16,797 INFO L273 TraceCheckUtils]: 132: Hoare triple {11390#(<= xor_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11390#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:16,809 INFO L273 TraceCheckUtils]: 133: Hoare triple {11390#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11400#(<= xor_~i~0 6)} is VALID [2018-11-14 17:09:16,822 INFO L273 TraceCheckUtils]: 134: Hoare triple {11400#(<= xor_~i~0 6)} assume true; {11400#(<= xor_~i~0 6)} is VALID [2018-11-14 17:09:16,831 INFO L273 TraceCheckUtils]: 135: Hoare triple {11400#(<= xor_~i~0 6)} assume !(~i~0 < 1000); {10975#false} is VALID [2018-11-14 17:09:16,831 INFO L273 TraceCheckUtils]: 136: Hoare triple {10975#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {10975#false} is VALID [2018-11-14 17:09:16,831 INFO L273 TraceCheckUtils]: 137: Hoare triple {10975#false} assume true; {10975#false} is VALID [2018-11-14 17:09:16,831 INFO L268 TraceCheckUtils]: 138: Hoare quadruple {10975#false} {10974#true} #77#return; {10975#false} is VALID [2018-11-14 17:09:16,831 INFO L273 TraceCheckUtils]: 139: Hoare triple {10975#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {10975#false} is VALID [2018-11-14 17:09:16,832 INFO L273 TraceCheckUtils]: 140: Hoare triple {10975#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {10975#false} is VALID [2018-11-14 17:09:16,832 INFO L273 TraceCheckUtils]: 141: Hoare triple {10975#false} assume !false; {10975#false} is VALID [2018-11-14 17:09:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 200 proven. 40 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2018-11-14 17:09:16,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:16,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8] total 25 [2018-11-14 17:09:16,864 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 17:09:16,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:16,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 17:09:16,970 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-14 17:09:16,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 17:09:16,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 17:09:16,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:09:16,971 INFO L87 Difference]: Start difference. First operand 101 states and 105 transitions. Second operand 25 states. [2018-11-14 17:09:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:17,979 INFO L93 Difference]: Finished difference Result 154 states and 166 transitions. [2018-11-14 17:09:17,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:09:17,980 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 142 [2018-11-14 17:09:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:17,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:09:17,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 17:09:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 17:09:17,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 130 transitions. [2018-11-14 17:09:17,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 130 transitions. [2018-11-14 17:09:18,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:18,698 INFO L225 Difference]: With dead ends: 154 [2018-11-14 17:09:18,698 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 17:09:18,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-11-14 17:09:18,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 17:09:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-11-14 17:09:18,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:18,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 107 states. [2018-11-14 17:09:18,723 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 107 states. [2018-11-14 17:09:18,723 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 107 states. [2018-11-14 17:09:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:18,726 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:09:18,726 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:09:18,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:18,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:18,727 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 109 states. [2018-11-14 17:09:18,727 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 109 states. [2018-11-14 17:09:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:18,729 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2018-11-14 17:09:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2018-11-14 17:09:18,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:18,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:18,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:18,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 17:09:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2018-11-14 17:09:18,733 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 142 [2018-11-14 17:09:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:18,733 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-11-14 17:09:18,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 17:09:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2018-11-14 17:09:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-14 17:09:18,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:18,735 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 17, 17, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:09:18,735 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:18,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1209501706, now seen corresponding path program 17 times [2018-11-14 17:09:18,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:18,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:18,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:18,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:18,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:19,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 17:09:19,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {11994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11994#true} is VALID [2018-11-14 17:09:19,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 17:09:19,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 17:09:19,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {11994#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11996#(= main_~i~1 0)} is VALID [2018-11-14 17:09:19,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {11996#(= main_~i~1 0)} assume true; {11996#(= main_~i~1 0)} is VALID [2018-11-14 17:09:19,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {11996#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11996#(= main_~i~1 0)} is VALID [2018-11-14 17:09:19,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {11996#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:19,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {11997#(<= main_~i~1 1)} assume true; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:19,677 INFO L273 TraceCheckUtils]: 10: Hoare triple {11997#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11997#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:19,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {11997#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:19,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {11998#(<= main_~i~1 2)} assume true; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:19,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {11998#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11998#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:19,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {11998#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:19,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {11999#(<= main_~i~1 3)} assume true; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:19,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {11999#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11999#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:19,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {11999#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:19,681 INFO L273 TraceCheckUtils]: 18: Hoare triple {12000#(<= main_~i~1 4)} assume true; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:19,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {12000#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12000#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:19,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {12000#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:19,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {12001#(<= main_~i~1 5)} assume true; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:19,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {12001#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12001#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:19,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {12001#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:19,684 INFO L273 TraceCheckUtils]: 24: Hoare triple {12002#(<= main_~i~1 6)} assume true; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:19,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {12002#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12002#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:19,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {12002#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:19,686 INFO L273 TraceCheckUtils]: 27: Hoare triple {12003#(<= main_~i~1 7)} assume true; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:19,686 INFO L273 TraceCheckUtils]: 28: Hoare triple {12003#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12003#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:19,687 INFO L273 TraceCheckUtils]: 29: Hoare triple {12003#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:19,688 INFO L273 TraceCheckUtils]: 30: Hoare triple {12004#(<= main_~i~1 8)} assume true; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:19,688 INFO L273 TraceCheckUtils]: 31: Hoare triple {12004#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12004#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:19,689 INFO L273 TraceCheckUtils]: 32: Hoare triple {12004#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:19,689 INFO L273 TraceCheckUtils]: 33: Hoare triple {12005#(<= main_~i~1 9)} assume true; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:19,690 INFO L273 TraceCheckUtils]: 34: Hoare triple {12005#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12005#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:19,690 INFO L273 TraceCheckUtils]: 35: Hoare triple {12005#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:19,691 INFO L273 TraceCheckUtils]: 36: Hoare triple {12006#(<= main_~i~1 10)} assume true; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:19,691 INFO L273 TraceCheckUtils]: 37: Hoare triple {12006#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12006#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:19,692 INFO L273 TraceCheckUtils]: 38: Hoare triple {12006#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:19,692 INFO L273 TraceCheckUtils]: 39: Hoare triple {12007#(<= main_~i~1 11)} assume true; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:19,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {12007#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12007#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:19,694 INFO L273 TraceCheckUtils]: 41: Hoare triple {12007#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:19,694 INFO L273 TraceCheckUtils]: 42: Hoare triple {12008#(<= main_~i~1 12)} assume true; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:19,695 INFO L273 TraceCheckUtils]: 43: Hoare triple {12008#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12008#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:19,695 INFO L273 TraceCheckUtils]: 44: Hoare triple {12008#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:19,696 INFO L273 TraceCheckUtils]: 45: Hoare triple {12009#(<= main_~i~1 13)} assume true; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:19,696 INFO L273 TraceCheckUtils]: 46: Hoare triple {12009#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12009#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:19,697 INFO L273 TraceCheckUtils]: 47: Hoare triple {12009#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:19,698 INFO L273 TraceCheckUtils]: 48: Hoare triple {12010#(<= main_~i~1 14)} assume true; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:19,698 INFO L273 TraceCheckUtils]: 49: Hoare triple {12010#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12010#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:19,699 INFO L273 TraceCheckUtils]: 50: Hoare triple {12010#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:19,699 INFO L273 TraceCheckUtils]: 51: Hoare triple {12011#(<= main_~i~1 15)} assume true; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:19,700 INFO L273 TraceCheckUtils]: 52: Hoare triple {12011#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12011#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:19,700 INFO L273 TraceCheckUtils]: 53: Hoare triple {12011#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:19,701 INFO L273 TraceCheckUtils]: 54: Hoare triple {12012#(<= main_~i~1 16)} assume true; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:19,701 INFO L273 TraceCheckUtils]: 55: Hoare triple {12012#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {12012#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:19,702 INFO L273 TraceCheckUtils]: 56: Hoare triple {12012#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:19,703 INFO L273 TraceCheckUtils]: 57: Hoare triple {12013#(<= main_~i~1 17)} assume true; {12013#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:19,703 INFO L273 TraceCheckUtils]: 58: Hoare triple {12013#(<= main_~i~1 17)} assume !(~i~1 < 1000); {11995#false} is VALID [2018-11-14 17:09:19,704 INFO L256 TraceCheckUtils]: 59: Hoare triple {11995#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:09:19,704 INFO L273 TraceCheckUtils]: 60: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 17:09:19,704 INFO L273 TraceCheckUtils]: 61: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,704 INFO L273 TraceCheckUtils]: 63: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,705 INFO L273 TraceCheckUtils]: 64: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,705 INFO L273 TraceCheckUtils]: 65: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,705 INFO L273 TraceCheckUtils]: 66: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,705 INFO L273 TraceCheckUtils]: 67: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,705 INFO L273 TraceCheckUtils]: 68: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,706 INFO L273 TraceCheckUtils]: 69: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,706 INFO L273 TraceCheckUtils]: 70: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,706 INFO L273 TraceCheckUtils]: 71: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,706 INFO L273 TraceCheckUtils]: 72: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,706 INFO L273 TraceCheckUtils]: 73: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,706 INFO L273 TraceCheckUtils]: 74: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,707 INFO L273 TraceCheckUtils]: 75: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,707 INFO L273 TraceCheckUtils]: 76: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,707 INFO L273 TraceCheckUtils]: 77: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,707 INFO L273 TraceCheckUtils]: 78: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,707 INFO L273 TraceCheckUtils]: 79: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,707 INFO L273 TraceCheckUtils]: 80: Hoare triple {11994#true} assume !(~i~0 < 1000); {11994#true} is VALID [2018-11-14 17:09:19,708 INFO L273 TraceCheckUtils]: 81: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 17:09:19,708 INFO L273 TraceCheckUtils]: 82: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,708 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11994#true} {11995#false} #73#return; {11995#false} is VALID [2018-11-14 17:09:19,708 INFO L273 TraceCheckUtils]: 84: Hoare triple {11995#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {11995#false} is VALID [2018-11-14 17:09:19,708 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:09:19,708 INFO L273 TraceCheckUtils]: 86: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 17:09:19,708 INFO L273 TraceCheckUtils]: 87: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,708 INFO L273 TraceCheckUtils]: 88: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,708 INFO L273 TraceCheckUtils]: 89: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,709 INFO L273 TraceCheckUtils]: 90: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,709 INFO L273 TraceCheckUtils]: 91: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,709 INFO L273 TraceCheckUtils]: 92: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,709 INFO L273 TraceCheckUtils]: 93: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,709 INFO L273 TraceCheckUtils]: 94: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,709 INFO L273 TraceCheckUtils]: 95: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,709 INFO L273 TraceCheckUtils]: 96: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,709 INFO L273 TraceCheckUtils]: 97: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,709 INFO L273 TraceCheckUtils]: 98: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 99: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 100: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 101: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 102: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 103: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 104: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 105: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 106: Hoare triple {11994#true} assume !(~i~0 < 1000); {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 107: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 17:09:19,710 INFO L273 TraceCheckUtils]: 108: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,711 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11994#true} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 17:09:19,711 INFO L273 TraceCheckUtils]: 110: Hoare triple {11995#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11995#false} is VALID [2018-11-14 17:09:19,711 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:19,711 INFO L273 TraceCheckUtils]: 112: Hoare triple {11995#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:09:19,711 INFO L273 TraceCheckUtils]: 113: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:09:19,711 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:19,711 INFO L273 TraceCheckUtils]: 115: Hoare triple {11995#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:09:19,711 INFO L273 TraceCheckUtils]: 116: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:09:19,711 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:19,712 INFO L273 TraceCheckUtils]: 118: Hoare triple {11995#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:09:19,712 INFO L273 TraceCheckUtils]: 119: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:09:19,712 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:19,712 INFO L273 TraceCheckUtils]: 121: Hoare triple {11995#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:09:19,712 INFO L273 TraceCheckUtils]: 122: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:09:19,712 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:19,712 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 999); {11995#false} is VALID [2018-11-14 17:09:19,712 INFO L273 TraceCheckUtils]: 125: Hoare triple {11995#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {11995#false} is VALID [2018-11-14 17:09:19,712 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:09:19,713 INFO L273 TraceCheckUtils]: 127: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11994#true} is VALID [2018-11-14 17:09:19,713 INFO L273 TraceCheckUtils]: 128: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,713 INFO L273 TraceCheckUtils]: 129: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,713 INFO L273 TraceCheckUtils]: 130: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,713 INFO L273 TraceCheckUtils]: 131: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,713 INFO L273 TraceCheckUtils]: 132: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,713 INFO L273 TraceCheckUtils]: 133: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,713 INFO L273 TraceCheckUtils]: 134: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,713 INFO L273 TraceCheckUtils]: 135: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,714 INFO L273 TraceCheckUtils]: 136: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,714 INFO L273 TraceCheckUtils]: 137: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,714 INFO L273 TraceCheckUtils]: 138: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,714 INFO L273 TraceCheckUtils]: 139: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,714 INFO L273 TraceCheckUtils]: 140: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,714 INFO L273 TraceCheckUtils]: 141: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,714 INFO L273 TraceCheckUtils]: 142: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,714 INFO L273 TraceCheckUtils]: 143: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,714 INFO L273 TraceCheckUtils]: 144: Hoare triple {11994#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11994#true} is VALID [2018-11-14 17:09:19,715 INFO L273 TraceCheckUtils]: 145: Hoare triple {11994#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11994#true} is VALID [2018-11-14 17:09:19,715 INFO L273 TraceCheckUtils]: 146: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,715 INFO L273 TraceCheckUtils]: 147: Hoare triple {11994#true} assume !(~i~0 < 1000); {11994#true} is VALID [2018-11-14 17:09:19,715 INFO L273 TraceCheckUtils]: 148: Hoare triple {11994#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11994#true} is VALID [2018-11-14 17:09:19,715 INFO L273 TraceCheckUtils]: 149: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:19,715 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11994#true} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 17:09:19,715 INFO L273 TraceCheckUtils]: 151: Hoare triple {11995#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11995#false} is VALID [2018-11-14 17:09:19,715 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 17:09:19,715 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 17:09:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2018-11-14 17:09:19,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:19,729 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-14 17:09:19,740 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:09:20,514 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-11-14 17:09:20,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:20,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:20,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {11994#true} call ULTIMATE.init(); {11994#true} is VALID [2018-11-14 17:09:20,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {11994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11994#true} is VALID [2018-11-14 17:09:20,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11994#true} {11994#true} #69#return; {11994#true} is VALID [2018-11-14 17:09:20,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {11994#true} call #t~ret13 := main(); {11994#true} is VALID [2018-11-14 17:09:20,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {11994#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {11994#true} is VALID [2018-11-14 17:09:20,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,806 INFO L273 TraceCheckUtils]: 17: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,806 INFO L273 TraceCheckUtils]: 18: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,807 INFO L273 TraceCheckUtils]: 20: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,807 INFO L273 TraceCheckUtils]: 22: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,807 INFO L273 TraceCheckUtils]: 23: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,807 INFO L273 TraceCheckUtils]: 24: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,807 INFO L273 TraceCheckUtils]: 25: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,808 INFO L273 TraceCheckUtils]: 26: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,808 INFO L273 TraceCheckUtils]: 30: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,808 INFO L273 TraceCheckUtils]: 31: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,809 INFO L273 TraceCheckUtils]: 32: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,809 INFO L273 TraceCheckUtils]: 33: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,809 INFO L273 TraceCheckUtils]: 34: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,809 INFO L273 TraceCheckUtils]: 35: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,809 INFO L273 TraceCheckUtils]: 36: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,809 INFO L273 TraceCheckUtils]: 37: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,810 INFO L273 TraceCheckUtils]: 39: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,810 INFO L273 TraceCheckUtils]: 40: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,810 INFO L273 TraceCheckUtils]: 41: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,810 INFO L273 TraceCheckUtils]: 42: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,811 INFO L273 TraceCheckUtils]: 44: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,811 INFO L273 TraceCheckUtils]: 45: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,811 INFO L273 TraceCheckUtils]: 46: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,811 INFO L273 TraceCheckUtils]: 47: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,811 INFO L273 TraceCheckUtils]: 48: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,811 INFO L273 TraceCheckUtils]: 49: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,812 INFO L273 TraceCheckUtils]: 50: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,812 INFO L273 TraceCheckUtils]: 51: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,812 INFO L273 TraceCheckUtils]: 52: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,812 INFO L273 TraceCheckUtils]: 53: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,812 INFO L273 TraceCheckUtils]: 54: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,812 INFO L273 TraceCheckUtils]: 55: Hoare triple {11994#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {11994#true} is VALID [2018-11-14 17:09:20,812 INFO L273 TraceCheckUtils]: 56: Hoare triple {11994#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {11994#true} is VALID [2018-11-14 17:09:20,813 INFO L273 TraceCheckUtils]: 57: Hoare triple {11994#true} assume true; {11994#true} is VALID [2018-11-14 17:09:20,813 INFO L273 TraceCheckUtils]: 58: Hoare triple {11994#true} assume !(~i~1 < 1000); {11994#true} is VALID [2018-11-14 17:09:20,813 INFO L256 TraceCheckUtils]: 59: Hoare triple {11994#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {11994#true} is VALID [2018-11-14 17:09:20,825 INFO L273 TraceCheckUtils]: 60: Hoare triple {11994#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {12197#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:20,833 INFO L273 TraceCheckUtils]: 61: Hoare triple {12197#(<= xor_~i~0 1)} assume true; {12197#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:20,839 INFO L273 TraceCheckUtils]: 62: Hoare triple {12197#(<= xor_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12197#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:20,840 INFO L273 TraceCheckUtils]: 63: Hoare triple {12197#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12207#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:20,840 INFO L273 TraceCheckUtils]: 64: Hoare triple {12207#(<= xor_~i~0 2)} assume true; {12207#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:20,840 INFO L273 TraceCheckUtils]: 65: Hoare triple {12207#(<= xor_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12207#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:20,841 INFO L273 TraceCheckUtils]: 66: Hoare triple {12207#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12217#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:20,841 INFO L273 TraceCheckUtils]: 67: Hoare triple {12217#(<= xor_~i~0 3)} assume true; {12217#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:20,841 INFO L273 TraceCheckUtils]: 68: Hoare triple {12217#(<= xor_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12217#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:20,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {12217#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12227#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:20,842 INFO L273 TraceCheckUtils]: 70: Hoare triple {12227#(<= xor_~i~0 4)} assume true; {12227#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:20,842 INFO L273 TraceCheckUtils]: 71: Hoare triple {12227#(<= xor_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12227#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:20,843 INFO L273 TraceCheckUtils]: 72: Hoare triple {12227#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12237#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:20,843 INFO L273 TraceCheckUtils]: 73: Hoare triple {12237#(<= xor_~i~0 5)} assume true; {12237#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:20,843 INFO L273 TraceCheckUtils]: 74: Hoare triple {12237#(<= xor_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12237#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:20,844 INFO L273 TraceCheckUtils]: 75: Hoare triple {12237#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12247#(<= xor_~i~0 6)} is VALID [2018-11-14 17:09:20,844 INFO L273 TraceCheckUtils]: 76: Hoare triple {12247#(<= xor_~i~0 6)} assume true; {12247#(<= xor_~i~0 6)} is VALID [2018-11-14 17:09:20,845 INFO L273 TraceCheckUtils]: 77: Hoare triple {12247#(<= xor_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {12247#(<= xor_~i~0 6)} is VALID [2018-11-14 17:09:20,846 INFO L273 TraceCheckUtils]: 78: Hoare triple {12247#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {12257#(<= xor_~i~0 7)} is VALID [2018-11-14 17:09:20,846 INFO L273 TraceCheckUtils]: 79: Hoare triple {12257#(<= xor_~i~0 7)} assume true; {12257#(<= xor_~i~0 7)} is VALID [2018-11-14 17:09:20,847 INFO L273 TraceCheckUtils]: 80: Hoare triple {12257#(<= xor_~i~0 7)} assume !(~i~0 < 1000); {11995#false} is VALID [2018-11-14 17:09:20,847 INFO L273 TraceCheckUtils]: 81: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 17:09:20,847 INFO L273 TraceCheckUtils]: 82: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,847 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {11995#false} {11994#true} #73#return; {11995#false} is VALID [2018-11-14 17:09:20,848 INFO L273 TraceCheckUtils]: 84: Hoare triple {11995#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {11995#false} is VALID [2018-11-14 17:09:20,848 INFO L256 TraceCheckUtils]: 85: Hoare triple {11995#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 17:09:20,848 INFO L273 TraceCheckUtils]: 86: Hoare triple {11995#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11995#false} is VALID [2018-11-14 17:09:20,848 INFO L273 TraceCheckUtils]: 87: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,848 INFO L273 TraceCheckUtils]: 88: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,849 INFO L273 TraceCheckUtils]: 89: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,849 INFO L273 TraceCheckUtils]: 90: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,849 INFO L273 TraceCheckUtils]: 91: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,849 INFO L273 TraceCheckUtils]: 92: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,849 INFO L273 TraceCheckUtils]: 93: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,849 INFO L273 TraceCheckUtils]: 94: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,850 INFO L273 TraceCheckUtils]: 95: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,850 INFO L273 TraceCheckUtils]: 96: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,850 INFO L273 TraceCheckUtils]: 97: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,850 INFO L273 TraceCheckUtils]: 98: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,850 INFO L273 TraceCheckUtils]: 99: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,850 INFO L273 TraceCheckUtils]: 100: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,850 INFO L273 TraceCheckUtils]: 101: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,850 INFO L273 TraceCheckUtils]: 102: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,850 INFO L273 TraceCheckUtils]: 103: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L273 TraceCheckUtils]: 104: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L273 TraceCheckUtils]: 105: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L273 TraceCheckUtils]: 106: Hoare triple {11995#false} assume !(~i~0 < 1000); {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L273 TraceCheckUtils]: 107: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L273 TraceCheckUtils]: 108: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {11995#false} {11995#false} #75#return; {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L273 TraceCheckUtils]: 110: Hoare triple {11995#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L273 TraceCheckUtils]: 111: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L273 TraceCheckUtils]: 112: Hoare triple {11995#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:09:20,851 INFO L273 TraceCheckUtils]: 113: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:09:20,852 INFO L273 TraceCheckUtils]: 114: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,852 INFO L273 TraceCheckUtils]: 115: Hoare triple {11995#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:09:20,852 INFO L273 TraceCheckUtils]: 116: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:09:20,852 INFO L273 TraceCheckUtils]: 117: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,852 INFO L273 TraceCheckUtils]: 118: Hoare triple {11995#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:09:20,852 INFO L273 TraceCheckUtils]: 119: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:09:20,852 INFO L273 TraceCheckUtils]: 120: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,852 INFO L273 TraceCheckUtils]: 121: Hoare triple {11995#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {11995#false} is VALID [2018-11-14 17:09:20,852 INFO L273 TraceCheckUtils]: 122: Hoare triple {11995#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {11995#false} is VALID [2018-11-14 17:09:20,853 INFO L273 TraceCheckUtils]: 123: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,853 INFO L273 TraceCheckUtils]: 124: Hoare triple {11995#false} assume !(~i~2 < 999); {11995#false} is VALID [2018-11-14 17:09:20,853 INFO L273 TraceCheckUtils]: 125: Hoare triple {11995#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {11995#false} is VALID [2018-11-14 17:09:20,853 INFO L256 TraceCheckUtils]: 126: Hoare triple {11995#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {11995#false} is VALID [2018-11-14 17:09:20,853 INFO L273 TraceCheckUtils]: 127: Hoare triple {11995#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {11995#false} is VALID [2018-11-14 17:09:20,853 INFO L273 TraceCheckUtils]: 128: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,853 INFO L273 TraceCheckUtils]: 129: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,853 INFO L273 TraceCheckUtils]: 130: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,853 INFO L273 TraceCheckUtils]: 131: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 132: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 133: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 134: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 135: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 136: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 137: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 138: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 139: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 140: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,854 INFO L273 TraceCheckUtils]: 141: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,855 INFO L273 TraceCheckUtils]: 142: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,855 INFO L273 TraceCheckUtils]: 143: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,855 INFO L273 TraceCheckUtils]: 144: Hoare triple {11995#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {11995#false} is VALID [2018-11-14 17:09:20,855 INFO L273 TraceCheckUtils]: 145: Hoare triple {11995#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {11995#false} is VALID [2018-11-14 17:09:20,855 INFO L273 TraceCheckUtils]: 146: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,855 INFO L273 TraceCheckUtils]: 147: Hoare triple {11995#false} assume !(~i~0 < 1000); {11995#false} is VALID [2018-11-14 17:09:20,855 INFO L273 TraceCheckUtils]: 148: Hoare triple {11995#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {11995#false} is VALID [2018-11-14 17:09:20,855 INFO L273 TraceCheckUtils]: 149: Hoare triple {11995#false} assume true; {11995#false} is VALID [2018-11-14 17:09:20,855 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {11995#false} {11995#false} #77#return; {11995#false} is VALID [2018-11-14 17:09:20,856 INFO L273 TraceCheckUtils]: 151: Hoare triple {11995#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {11995#false} is VALID [2018-11-14 17:09:20,856 INFO L273 TraceCheckUtils]: 152: Hoare triple {11995#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {11995#false} is VALID [2018-11-14 17:09:20,856 INFO L273 TraceCheckUtils]: 153: Hoare triple {11995#false} assume !false; {11995#false} is VALID [2018-11-14 17:09:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 270 proven. 57 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2018-11-14 17:09:20,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:20,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2018-11-14 17:09:20,886 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 17:09:20,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:20,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:09:20,988 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:20,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:09:20,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:09:20,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:09:20,990 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 27 states. [2018-11-14 17:09:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:21,779 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2018-11-14 17:09:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 17:09:21,779 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 154 [2018-11-14 17:09:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:09:21,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 17:09:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:09:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2018-11-14 17:09:21,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 136 transitions. [2018-11-14 17:09:22,305 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-14 17:09:22,308 INFO L225 Difference]: With dead ends: 163 [2018-11-14 17:09:22,308 INFO L226 Difference]: Without dead ends: 115 [2018-11-14 17:09:22,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:09:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-14 17:09:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-14 17:09:22,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:22,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 113 states. [2018-11-14 17:09:22,436 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 113 states. [2018-11-14 17:09:22,436 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 113 states. [2018-11-14 17:09:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:22,439 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 17:09:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 17:09:22,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:22,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:22,440 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 115 states. [2018-11-14 17:09:22,440 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 115 states. [2018-11-14 17:09:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:22,443 INFO L93 Difference]: Finished difference Result 115 states and 119 transitions. [2018-11-14 17:09:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2018-11-14 17:09:22,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:22,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:22,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:22,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:22,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 17:09:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2018-11-14 17:09:22,447 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 154 [2018-11-14 17:09:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:22,447 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2018-11-14 17:09:22,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:09:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2018-11-14 17:09:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-14 17:09:22,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:22,449 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 19, 18, 18, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:09:22,449 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:22,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2094815685, now seen corresponding path program 18 times [2018-11-14 17:09:22,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:22,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:22,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:22,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:23,206 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 17:09:23,206 INFO L273 TraceCheckUtils]: 1: Hoare triple {13084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13084#true} is VALID [2018-11-14 17:09:23,206 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 17:09:23,207 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 17:09:23,207 INFO L273 TraceCheckUtils]: 5: Hoare triple {13084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13086#(= main_~i~1 0)} is VALID [2018-11-14 17:09:23,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {13086#(= main_~i~1 0)} assume true; {13086#(= main_~i~1 0)} is VALID [2018-11-14 17:09:23,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {13086#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13086#(= main_~i~1 0)} is VALID [2018-11-14 17:09:23,209 INFO L273 TraceCheckUtils]: 8: Hoare triple {13086#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:23,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {13087#(<= main_~i~1 1)} assume true; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:23,210 INFO L273 TraceCheckUtils]: 10: Hoare triple {13087#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13087#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:23,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {13087#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:23,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {13088#(<= main_~i~1 2)} assume true; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:23,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {13088#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13088#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:23,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {13088#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:23,212 INFO L273 TraceCheckUtils]: 15: Hoare triple {13089#(<= main_~i~1 3)} assume true; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:23,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {13089#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13089#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:23,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {13089#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:23,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {13090#(<= main_~i~1 4)} assume true; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:23,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {13090#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13090#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:23,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {13090#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:23,215 INFO L273 TraceCheckUtils]: 21: Hoare triple {13091#(<= main_~i~1 5)} assume true; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:23,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {13091#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13091#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:23,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {13091#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:23,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {13092#(<= main_~i~1 6)} assume true; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:23,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {13092#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13092#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:23,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {13092#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:23,218 INFO L273 TraceCheckUtils]: 27: Hoare triple {13093#(<= main_~i~1 7)} assume true; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:23,219 INFO L273 TraceCheckUtils]: 28: Hoare triple {13093#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13093#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:23,219 INFO L273 TraceCheckUtils]: 29: Hoare triple {13093#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:23,220 INFO L273 TraceCheckUtils]: 30: Hoare triple {13094#(<= main_~i~1 8)} assume true; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:23,220 INFO L273 TraceCheckUtils]: 31: Hoare triple {13094#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13094#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:23,221 INFO L273 TraceCheckUtils]: 32: Hoare triple {13094#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:23,222 INFO L273 TraceCheckUtils]: 33: Hoare triple {13095#(<= main_~i~1 9)} assume true; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:23,222 INFO L273 TraceCheckUtils]: 34: Hoare triple {13095#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13095#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:23,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {13095#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:23,223 INFO L273 TraceCheckUtils]: 36: Hoare triple {13096#(<= main_~i~1 10)} assume true; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:23,224 INFO L273 TraceCheckUtils]: 37: Hoare triple {13096#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13096#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:23,225 INFO L273 TraceCheckUtils]: 38: Hoare triple {13096#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:23,225 INFO L273 TraceCheckUtils]: 39: Hoare triple {13097#(<= main_~i~1 11)} assume true; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:23,226 INFO L273 TraceCheckUtils]: 40: Hoare triple {13097#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13097#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:23,226 INFO L273 TraceCheckUtils]: 41: Hoare triple {13097#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:23,227 INFO L273 TraceCheckUtils]: 42: Hoare triple {13098#(<= main_~i~1 12)} assume true; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:23,227 INFO L273 TraceCheckUtils]: 43: Hoare triple {13098#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13098#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:23,231 INFO L273 TraceCheckUtils]: 44: Hoare triple {13098#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:23,231 INFO L273 TraceCheckUtils]: 45: Hoare triple {13099#(<= main_~i~1 13)} assume true; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:23,232 INFO L273 TraceCheckUtils]: 46: Hoare triple {13099#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13099#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:23,232 INFO L273 TraceCheckUtils]: 47: Hoare triple {13099#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:23,232 INFO L273 TraceCheckUtils]: 48: Hoare triple {13100#(<= main_~i~1 14)} assume true; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:23,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {13100#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13100#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:23,233 INFO L273 TraceCheckUtils]: 50: Hoare triple {13100#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:23,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {13101#(<= main_~i~1 15)} assume true; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:23,234 INFO L273 TraceCheckUtils]: 52: Hoare triple {13101#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13101#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:23,234 INFO L273 TraceCheckUtils]: 53: Hoare triple {13101#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:23,234 INFO L273 TraceCheckUtils]: 54: Hoare triple {13102#(<= main_~i~1 16)} assume true; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:23,235 INFO L273 TraceCheckUtils]: 55: Hoare triple {13102#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13102#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:23,235 INFO L273 TraceCheckUtils]: 56: Hoare triple {13102#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:23,236 INFO L273 TraceCheckUtils]: 57: Hoare triple {13103#(<= main_~i~1 17)} assume true; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:23,236 INFO L273 TraceCheckUtils]: 58: Hoare triple {13103#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13103#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:23,237 INFO L273 TraceCheckUtils]: 59: Hoare triple {13103#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:23,238 INFO L273 TraceCheckUtils]: 60: Hoare triple {13104#(<= main_~i~1 18)} assume true; {13104#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:23,238 INFO L273 TraceCheckUtils]: 61: Hoare triple {13104#(<= main_~i~1 18)} assume !(~i~1 < 1000); {13085#false} is VALID [2018-11-14 17:09:23,238 INFO L256 TraceCheckUtils]: 62: Hoare triple {13085#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:09:23,239 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:09:23,239 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,239 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,239 INFO L273 TraceCheckUtils]: 66: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,240 INFO L273 TraceCheckUtils]: 68: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,240 INFO L273 TraceCheckUtils]: 69: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,240 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,240 INFO L273 TraceCheckUtils]: 71: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,240 INFO L273 TraceCheckUtils]: 72: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,241 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,241 INFO L273 TraceCheckUtils]: 74: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,241 INFO L273 TraceCheckUtils]: 75: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,241 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,241 INFO L273 TraceCheckUtils]: 77: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,241 INFO L273 TraceCheckUtils]: 78: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,241 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,241 INFO L273 TraceCheckUtils]: 80: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,242 INFO L273 TraceCheckUtils]: 81: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,242 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,242 INFO L273 TraceCheckUtils]: 83: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,242 INFO L273 TraceCheckUtils]: 84: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,242 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,242 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 1000); {13084#true} is VALID [2018-11-14 17:09:23,242 INFO L273 TraceCheckUtils]: 87: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:09:23,242 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,242 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13085#false} #73#return; {13085#false} is VALID [2018-11-14 17:09:23,243 INFO L273 TraceCheckUtils]: 90: Hoare triple {13085#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {13085#false} is VALID [2018-11-14 17:09:23,243 INFO L256 TraceCheckUtils]: 91: Hoare triple {13085#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:09:23,243 INFO L273 TraceCheckUtils]: 92: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:09:23,243 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,243 INFO L273 TraceCheckUtils]: 94: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,243 INFO L273 TraceCheckUtils]: 95: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,243 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,243 INFO L273 TraceCheckUtils]: 97: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,243 INFO L273 TraceCheckUtils]: 98: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 100: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 101: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 103: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 104: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 106: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 107: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,244 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,245 INFO L273 TraceCheckUtils]: 109: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,245 INFO L273 TraceCheckUtils]: 110: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,245 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,245 INFO L273 TraceCheckUtils]: 112: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,245 INFO L273 TraceCheckUtils]: 113: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,245 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,245 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 1000); {13084#true} is VALID [2018-11-14 17:09:23,245 INFO L273 TraceCheckUtils]: 116: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:09:23,245 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,246 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13085#false} #75#return; {13085#false} is VALID [2018-11-14 17:09:23,246 INFO L273 TraceCheckUtils]: 119: Hoare triple {13085#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13085#false} is VALID [2018-11-14 17:09:23,246 INFO L273 TraceCheckUtils]: 120: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:23,246 INFO L273 TraceCheckUtils]: 121: Hoare triple {13085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 17:09:23,246 INFO L273 TraceCheckUtils]: 122: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 17:09:23,246 INFO L273 TraceCheckUtils]: 123: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:23,246 INFO L273 TraceCheckUtils]: 124: Hoare triple {13085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 17:09:23,246 INFO L273 TraceCheckUtils]: 125: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 17:09:23,246 INFO L273 TraceCheckUtils]: 126: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:23,247 INFO L273 TraceCheckUtils]: 127: Hoare triple {13085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 17:09:23,247 INFO L273 TraceCheckUtils]: 128: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 17:09:23,247 INFO L273 TraceCheckUtils]: 129: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:23,247 INFO L273 TraceCheckUtils]: 130: Hoare triple {13085#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13085#false} is VALID [2018-11-14 17:09:23,247 INFO L273 TraceCheckUtils]: 131: Hoare triple {13085#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13085#false} is VALID [2018-11-14 17:09:23,247 INFO L273 TraceCheckUtils]: 132: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:23,247 INFO L273 TraceCheckUtils]: 133: Hoare triple {13085#false} assume !(~i~2 < 999); {13085#false} is VALID [2018-11-14 17:09:23,247 INFO L273 TraceCheckUtils]: 134: Hoare triple {13085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {13085#false} is VALID [2018-11-14 17:09:23,247 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:09:23,247 INFO L273 TraceCheckUtils]: 136: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:09:23,248 INFO L273 TraceCheckUtils]: 137: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,248 INFO L273 TraceCheckUtils]: 138: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,248 INFO L273 TraceCheckUtils]: 139: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,248 INFO L273 TraceCheckUtils]: 140: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,248 INFO L273 TraceCheckUtils]: 141: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,248 INFO L273 TraceCheckUtils]: 142: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,248 INFO L273 TraceCheckUtils]: 143: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,248 INFO L273 TraceCheckUtils]: 144: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,248 INFO L273 TraceCheckUtils]: 145: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,249 INFO L273 TraceCheckUtils]: 146: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,249 INFO L273 TraceCheckUtils]: 147: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,249 INFO L273 TraceCheckUtils]: 148: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,249 INFO L273 TraceCheckUtils]: 149: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,249 INFO L273 TraceCheckUtils]: 150: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,249 INFO L273 TraceCheckUtils]: 151: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,250 INFO L273 TraceCheckUtils]: 152: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,250 INFO L273 TraceCheckUtils]: 153: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,250 INFO L273 TraceCheckUtils]: 154: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,250 INFO L273 TraceCheckUtils]: 155: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,250 INFO L273 TraceCheckUtils]: 156: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:23,250 INFO L273 TraceCheckUtils]: 157: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:23,251 INFO L273 TraceCheckUtils]: 158: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,251 INFO L273 TraceCheckUtils]: 159: Hoare triple {13084#true} assume !(~i~0 < 1000); {13084#true} is VALID [2018-11-14 17:09:23,251 INFO L273 TraceCheckUtils]: 160: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:09:23,251 INFO L273 TraceCheckUtils]: 161: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:23,251 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13084#true} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 17:09:23,251 INFO L273 TraceCheckUtils]: 163: Hoare triple {13085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13085#false} is VALID [2018-11-14 17:09:23,251 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 17:09:23,252 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 17:09:23,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-11-14 17:09:23,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:23,265 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-14 17:09:23,273 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:09:23,768 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-14 17:09:23,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:23,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:24,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {13084#true} call ULTIMATE.init(); {13084#true} is VALID [2018-11-14 17:09:24,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {13084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13084#true} is VALID [2018-11-14 17:09:24,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13084#true} {13084#true} #69#return; {13084#true} is VALID [2018-11-14 17:09:24,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {13084#true} call #t~ret13 := main(); {13084#true} is VALID [2018-11-14 17:09:24,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {13084#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {13084#true} is VALID [2018-11-14 17:09:24,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 7: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 10: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 12: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 13: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 14: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 15: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,043 INFO L273 TraceCheckUtils]: 21: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,043 INFO L273 TraceCheckUtils]: 22: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 27: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 29: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 30: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 31: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 32: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 33: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 34: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,045 INFO L273 TraceCheckUtils]: 36: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,045 INFO L273 TraceCheckUtils]: 37: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,045 INFO L273 TraceCheckUtils]: 38: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,045 INFO L273 TraceCheckUtils]: 39: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,045 INFO L273 TraceCheckUtils]: 40: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,045 INFO L273 TraceCheckUtils]: 41: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,045 INFO L273 TraceCheckUtils]: 42: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,045 INFO L273 TraceCheckUtils]: 43: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,046 INFO L273 TraceCheckUtils]: 44: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,046 INFO L273 TraceCheckUtils]: 45: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,046 INFO L273 TraceCheckUtils]: 46: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,046 INFO L273 TraceCheckUtils]: 47: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,046 INFO L273 TraceCheckUtils]: 48: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,046 INFO L273 TraceCheckUtils]: 49: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,046 INFO L273 TraceCheckUtils]: 50: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,047 INFO L273 TraceCheckUtils]: 52: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,047 INFO L273 TraceCheckUtils]: 53: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,047 INFO L273 TraceCheckUtils]: 54: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,047 INFO L273 TraceCheckUtils]: 55: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,047 INFO L273 TraceCheckUtils]: 56: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,048 INFO L273 TraceCheckUtils]: 57: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,048 INFO L273 TraceCheckUtils]: 58: Hoare triple {13084#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {13084#true} is VALID [2018-11-14 17:09:24,048 INFO L273 TraceCheckUtils]: 59: Hoare triple {13084#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {13084#true} is VALID [2018-11-14 17:09:24,048 INFO L273 TraceCheckUtils]: 60: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,048 INFO L273 TraceCheckUtils]: 61: Hoare triple {13084#true} assume !(~i~1 < 1000); {13084#true} is VALID [2018-11-14 17:09:24,048 INFO L256 TraceCheckUtils]: 62: Hoare triple {13084#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:09:24,049 INFO L273 TraceCheckUtils]: 63: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:09:24,049 INFO L273 TraceCheckUtils]: 64: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,049 INFO L273 TraceCheckUtils]: 65: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,049 INFO L273 TraceCheckUtils]: 66: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,049 INFO L273 TraceCheckUtils]: 67: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,049 INFO L273 TraceCheckUtils]: 68: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,049 INFO L273 TraceCheckUtils]: 69: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,049 INFO L273 TraceCheckUtils]: 70: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 71: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 72: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 73: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 74: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 75: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 76: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 77: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 78: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 79: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,050 INFO L273 TraceCheckUtils]: 80: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,051 INFO L273 TraceCheckUtils]: 81: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,051 INFO L273 TraceCheckUtils]: 82: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,051 INFO L273 TraceCheckUtils]: 83: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,051 INFO L273 TraceCheckUtils]: 84: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,051 INFO L273 TraceCheckUtils]: 85: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,051 INFO L273 TraceCheckUtils]: 86: Hoare triple {13084#true} assume !(~i~0 < 1000); {13084#true} is VALID [2018-11-14 17:09:24,051 INFO L273 TraceCheckUtils]: 87: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:09:24,051 INFO L273 TraceCheckUtils]: 88: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,051 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {13084#true} {13084#true} #73#return; {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L273 TraceCheckUtils]: 90: Hoare triple {13084#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L256 TraceCheckUtils]: 91: Hoare triple {13084#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L273 TraceCheckUtils]: 92: Hoare triple {13084#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L273 TraceCheckUtils]: 93: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L273 TraceCheckUtils]: 94: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L273 TraceCheckUtils]: 95: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L273 TraceCheckUtils]: 96: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L273 TraceCheckUtils]: 97: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L273 TraceCheckUtils]: 98: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,052 INFO L273 TraceCheckUtils]: 99: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,053 INFO L273 TraceCheckUtils]: 100: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,053 INFO L273 TraceCheckUtils]: 101: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,053 INFO L273 TraceCheckUtils]: 102: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,053 INFO L273 TraceCheckUtils]: 103: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,053 INFO L273 TraceCheckUtils]: 104: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,053 INFO L273 TraceCheckUtils]: 105: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,053 INFO L273 TraceCheckUtils]: 106: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,053 INFO L273 TraceCheckUtils]: 107: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,053 INFO L273 TraceCheckUtils]: 108: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L273 TraceCheckUtils]: 109: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L273 TraceCheckUtils]: 110: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L273 TraceCheckUtils]: 111: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L273 TraceCheckUtils]: 112: Hoare triple {13084#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L273 TraceCheckUtils]: 113: Hoare triple {13084#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L273 TraceCheckUtils]: 114: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L273 TraceCheckUtils]: 115: Hoare triple {13084#true} assume !(~i~0 < 1000); {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L273 TraceCheckUtils]: 116: Hoare triple {13084#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L273 TraceCheckUtils]: 117: Hoare triple {13084#true} assume true; {13084#true} is VALID [2018-11-14 17:09:24,054 INFO L268 TraceCheckUtils]: 118: Hoare quadruple {13084#true} {13084#true} #75#return; {13084#true} is VALID [2018-11-14 17:09:24,055 INFO L273 TraceCheckUtils]: 119: Hoare triple {13084#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:24,055 INFO L273 TraceCheckUtils]: 120: Hoare triple {13465#(<= main_~i~2 0)} assume true; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:24,056 INFO L273 TraceCheckUtils]: 121: Hoare triple {13465#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13465#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:24,056 INFO L273 TraceCheckUtils]: 122: Hoare triple {13465#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:24,056 INFO L273 TraceCheckUtils]: 123: Hoare triple {13475#(<= main_~i~2 1)} assume true; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:24,057 INFO L273 TraceCheckUtils]: 124: Hoare triple {13475#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13475#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:24,057 INFO L273 TraceCheckUtils]: 125: Hoare triple {13475#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:24,057 INFO L273 TraceCheckUtils]: 126: Hoare triple {13485#(<= main_~i~2 2)} assume true; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:24,058 INFO L273 TraceCheckUtils]: 127: Hoare triple {13485#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13485#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:24,059 INFO L273 TraceCheckUtils]: 128: Hoare triple {13485#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:24,059 INFO L273 TraceCheckUtils]: 129: Hoare triple {13495#(<= main_~i~2 3)} assume true; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:24,060 INFO L273 TraceCheckUtils]: 130: Hoare triple {13495#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {13495#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:24,060 INFO L273 TraceCheckUtils]: 131: Hoare triple {13495#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {13505#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:24,061 INFO L273 TraceCheckUtils]: 132: Hoare triple {13505#(<= main_~i~2 4)} assume true; {13505#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:24,061 INFO L273 TraceCheckUtils]: 133: Hoare triple {13505#(<= main_~i~2 4)} assume !(~i~2 < 999); {13085#false} is VALID [2018-11-14 17:09:24,062 INFO L273 TraceCheckUtils]: 134: Hoare triple {13085#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {13085#false} is VALID [2018-11-14 17:09:24,062 INFO L256 TraceCheckUtils]: 135: Hoare triple {13085#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {13085#false} is VALID [2018-11-14 17:09:24,062 INFO L273 TraceCheckUtils]: 136: Hoare triple {13085#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {13085#false} is VALID [2018-11-14 17:09:24,062 INFO L273 TraceCheckUtils]: 137: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:24,062 INFO L273 TraceCheckUtils]: 138: Hoare triple {13085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:09:24,062 INFO L273 TraceCheckUtils]: 139: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:09:24,063 INFO L273 TraceCheckUtils]: 140: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:24,063 INFO L273 TraceCheckUtils]: 141: Hoare triple {13085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:09:24,063 INFO L273 TraceCheckUtils]: 142: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:09:24,063 INFO L273 TraceCheckUtils]: 143: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:24,063 INFO L273 TraceCheckUtils]: 144: Hoare triple {13085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:09:24,063 INFO L273 TraceCheckUtils]: 145: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:09:24,064 INFO L273 TraceCheckUtils]: 146: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:24,064 INFO L273 TraceCheckUtils]: 147: Hoare triple {13085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:09:24,064 INFO L273 TraceCheckUtils]: 148: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:09:24,064 INFO L273 TraceCheckUtils]: 149: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:24,064 INFO L273 TraceCheckUtils]: 150: Hoare triple {13085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:09:24,064 INFO L273 TraceCheckUtils]: 151: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:09:24,064 INFO L273 TraceCheckUtils]: 152: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:24,064 INFO L273 TraceCheckUtils]: 153: Hoare triple {13085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:09:24,064 INFO L273 TraceCheckUtils]: 154: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:09:24,065 INFO L273 TraceCheckUtils]: 155: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:24,065 INFO L273 TraceCheckUtils]: 156: Hoare triple {13085#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {13085#false} is VALID [2018-11-14 17:09:24,065 INFO L273 TraceCheckUtils]: 157: Hoare triple {13085#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {13085#false} is VALID [2018-11-14 17:09:24,065 INFO L273 TraceCheckUtils]: 158: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:24,065 INFO L273 TraceCheckUtils]: 159: Hoare triple {13085#false} assume !(~i~0 < 1000); {13085#false} is VALID [2018-11-14 17:09:24,065 INFO L273 TraceCheckUtils]: 160: Hoare triple {13085#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {13085#false} is VALID [2018-11-14 17:09:24,066 INFO L273 TraceCheckUtils]: 161: Hoare triple {13085#false} assume true; {13085#false} is VALID [2018-11-14 17:09:24,066 INFO L268 TraceCheckUtils]: 162: Hoare quadruple {13085#false} {13085#false} #77#return; {13085#false} is VALID [2018-11-14 17:09:24,066 INFO L273 TraceCheckUtils]: 163: Hoare triple {13085#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {13085#false} is VALID [2018-11-14 17:09:24,066 INFO L273 TraceCheckUtils]: 164: Hoare triple {13085#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {13085#false} is VALID [2018-11-14 17:09:24,066 INFO L273 TraceCheckUtils]: 165: Hoare triple {13085#false} assume !false; {13085#false} is VALID [2018-11-14 17:09:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 362 proven. 26 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2018-11-14 17:09:24,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:24,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2018-11-14 17:09:24,099 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2018-11-14 17:09:24,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:24,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:09:24,205 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-14 17:09:24,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:09:24,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:09:24,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:09:24,206 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 26 states. [2018-11-14 17:09:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:24,819 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2018-11-14 17:09:24,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:09:24,819 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 166 [2018-11-14 17:09:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:09:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-14 17:09:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:09:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 130 transitions. [2018-11-14 17:09:24,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 130 transitions. [2018-11-14 17:09:24,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:24,959 INFO L225 Difference]: With dead ends: 172 [2018-11-14 17:09:24,959 INFO L226 Difference]: Without dead ends: 121 [2018-11-14 17:09:24,960 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:09:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-14 17:09:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-11-14 17:09:24,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:24,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 119 states. [2018-11-14 17:09:24,995 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 119 states. [2018-11-14 17:09:24,995 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 119 states. [2018-11-14 17:09:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:24,998 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 17:09:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 17:09:24,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:24,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:24,999 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 121 states. [2018-11-14 17:09:25,000 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 121 states. [2018-11-14 17:09:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:25,002 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 17:09:25,002 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 17:09:25,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:25,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:25,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:25,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-14 17:09:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2018-11-14 17:09:25,005 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 166 [2018-11-14 17:09:25,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:25,005 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2018-11-14 17:09:25,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:09:25,005 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2018-11-14 17:09:25,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-14 17:09:25,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:25,007 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 20, 19, 19, 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] [2018-11-14 17:09:25,007 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:25,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:25,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1361262355, now seen corresponding path program 19 times [2018-11-14 17:09:25,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:25,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:25,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:25,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:25,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:25,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {14241#true} call ULTIMATE.init(); {14241#true} is VALID [2018-11-14 17:09:25,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {14241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14241#true} is VALID [2018-11-14 17:09:25,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14241#true} {14241#true} #69#return; {14241#true} is VALID [2018-11-14 17:09:25,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {14241#true} call #t~ret13 := main(); {14241#true} is VALID [2018-11-14 17:09:25,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {14241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14243#(= main_~i~1 0)} is VALID [2018-11-14 17:09:25,366 INFO L273 TraceCheckUtils]: 6: Hoare triple {14243#(= main_~i~1 0)} assume true; {14243#(= main_~i~1 0)} is VALID [2018-11-14 17:09:25,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {14243#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14243#(= main_~i~1 0)} is VALID [2018-11-14 17:09:25,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {14243#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:25,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {14244#(<= main_~i~1 1)} assume true; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:25,368 INFO L273 TraceCheckUtils]: 10: Hoare triple {14244#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:25,369 INFO L273 TraceCheckUtils]: 11: Hoare triple {14244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:25,369 INFO L273 TraceCheckUtils]: 12: Hoare triple {14245#(<= main_~i~1 2)} assume true; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:25,369 INFO L273 TraceCheckUtils]: 13: Hoare triple {14245#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:25,370 INFO L273 TraceCheckUtils]: 14: Hoare triple {14245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:25,370 INFO L273 TraceCheckUtils]: 15: Hoare triple {14246#(<= main_~i~1 3)} assume true; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:25,371 INFO L273 TraceCheckUtils]: 16: Hoare triple {14246#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:25,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {14246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:25,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {14247#(<= main_~i~1 4)} assume true; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:25,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {14247#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:25,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {14247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:25,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {14248#(<= main_~i~1 5)} assume true; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:25,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {14248#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:25,375 INFO L273 TraceCheckUtils]: 23: Hoare triple {14248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:25,376 INFO L273 TraceCheckUtils]: 24: Hoare triple {14249#(<= main_~i~1 6)} assume true; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:25,376 INFO L273 TraceCheckUtils]: 25: Hoare triple {14249#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:25,377 INFO L273 TraceCheckUtils]: 26: Hoare triple {14249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:25,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {14250#(<= main_~i~1 7)} assume true; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:25,378 INFO L273 TraceCheckUtils]: 28: Hoare triple {14250#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:25,379 INFO L273 TraceCheckUtils]: 29: Hoare triple {14250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:25,379 INFO L273 TraceCheckUtils]: 30: Hoare triple {14251#(<= main_~i~1 8)} assume true; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:25,380 INFO L273 TraceCheckUtils]: 31: Hoare triple {14251#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:25,380 INFO L273 TraceCheckUtils]: 32: Hoare triple {14251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:25,381 INFO L273 TraceCheckUtils]: 33: Hoare triple {14252#(<= main_~i~1 9)} assume true; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:25,381 INFO L273 TraceCheckUtils]: 34: Hoare triple {14252#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:25,382 INFO L273 TraceCheckUtils]: 35: Hoare triple {14252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:25,382 INFO L273 TraceCheckUtils]: 36: Hoare triple {14253#(<= main_~i~1 10)} assume true; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:25,383 INFO L273 TraceCheckUtils]: 37: Hoare triple {14253#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:25,384 INFO L273 TraceCheckUtils]: 38: Hoare triple {14253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:25,384 INFO L273 TraceCheckUtils]: 39: Hoare triple {14254#(<= main_~i~1 11)} assume true; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:25,385 INFO L273 TraceCheckUtils]: 40: Hoare triple {14254#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:25,385 INFO L273 TraceCheckUtils]: 41: Hoare triple {14254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:25,386 INFO L273 TraceCheckUtils]: 42: Hoare triple {14255#(<= main_~i~1 12)} assume true; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:25,386 INFO L273 TraceCheckUtils]: 43: Hoare triple {14255#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:25,392 INFO L273 TraceCheckUtils]: 44: Hoare triple {14255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:25,393 INFO L273 TraceCheckUtils]: 45: Hoare triple {14256#(<= main_~i~1 13)} assume true; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:25,393 INFO L273 TraceCheckUtils]: 46: Hoare triple {14256#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:25,393 INFO L273 TraceCheckUtils]: 47: Hoare triple {14256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:25,394 INFO L273 TraceCheckUtils]: 48: Hoare triple {14257#(<= main_~i~1 14)} assume true; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:25,394 INFO L273 TraceCheckUtils]: 49: Hoare triple {14257#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:25,394 INFO L273 TraceCheckUtils]: 50: Hoare triple {14257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:25,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {14258#(<= main_~i~1 15)} assume true; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:25,395 INFO L273 TraceCheckUtils]: 52: Hoare triple {14258#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:25,395 INFO L273 TraceCheckUtils]: 53: Hoare triple {14258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:25,396 INFO L273 TraceCheckUtils]: 54: Hoare triple {14259#(<= main_~i~1 16)} assume true; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:25,396 INFO L273 TraceCheckUtils]: 55: Hoare triple {14259#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:25,397 INFO L273 TraceCheckUtils]: 56: Hoare triple {14259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:25,397 INFO L273 TraceCheckUtils]: 57: Hoare triple {14260#(<= main_~i~1 17)} assume true; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:25,398 INFO L273 TraceCheckUtils]: 58: Hoare triple {14260#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:25,398 INFO L273 TraceCheckUtils]: 59: Hoare triple {14260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:25,399 INFO L273 TraceCheckUtils]: 60: Hoare triple {14261#(<= main_~i~1 18)} assume true; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:25,399 INFO L273 TraceCheckUtils]: 61: Hoare triple {14261#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:25,400 INFO L273 TraceCheckUtils]: 62: Hoare triple {14261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:25,401 INFO L273 TraceCheckUtils]: 63: Hoare triple {14262#(<= main_~i~1 19)} assume true; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:25,401 INFO L273 TraceCheckUtils]: 64: Hoare triple {14262#(<= main_~i~1 19)} assume !(~i~1 < 1000); {14242#false} is VALID [2018-11-14 17:09:25,401 INFO L256 TraceCheckUtils]: 65: Hoare triple {14242#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 17:09:25,402 INFO L273 TraceCheckUtils]: 66: Hoare triple {14241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14241#true} is VALID [2018-11-14 17:09:25,402 INFO L273 TraceCheckUtils]: 67: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,402 INFO L273 TraceCheckUtils]: 68: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,402 INFO L273 TraceCheckUtils]: 69: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,402 INFO L273 TraceCheckUtils]: 70: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,403 INFO L273 TraceCheckUtils]: 71: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,403 INFO L273 TraceCheckUtils]: 72: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,403 INFO L273 TraceCheckUtils]: 73: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,403 INFO L273 TraceCheckUtils]: 74: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,403 INFO L273 TraceCheckUtils]: 75: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,404 INFO L273 TraceCheckUtils]: 76: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,404 INFO L273 TraceCheckUtils]: 77: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,404 INFO L273 TraceCheckUtils]: 78: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,404 INFO L273 TraceCheckUtils]: 79: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,404 INFO L273 TraceCheckUtils]: 80: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,404 INFO L273 TraceCheckUtils]: 81: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,404 INFO L273 TraceCheckUtils]: 82: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,404 INFO L273 TraceCheckUtils]: 83: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,405 INFO L273 TraceCheckUtils]: 84: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,405 INFO L273 TraceCheckUtils]: 85: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,405 INFO L273 TraceCheckUtils]: 86: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,405 INFO L273 TraceCheckUtils]: 87: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,405 INFO L273 TraceCheckUtils]: 88: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,405 INFO L273 TraceCheckUtils]: 89: Hoare triple {14241#true} assume !(~i~0 < 1000); {14241#true} is VALID [2018-11-14 17:09:25,405 INFO L273 TraceCheckUtils]: 90: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 17:09:25,405 INFO L273 TraceCheckUtils]: 91: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,405 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {14241#true} {14242#false} #73#return; {14242#false} is VALID [2018-11-14 17:09:25,406 INFO L273 TraceCheckUtils]: 93: Hoare triple {14242#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {14242#false} is VALID [2018-11-14 17:09:25,406 INFO L256 TraceCheckUtils]: 94: Hoare triple {14242#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 17:09:25,406 INFO L273 TraceCheckUtils]: 95: Hoare triple {14241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14241#true} is VALID [2018-11-14 17:09:25,406 INFO L273 TraceCheckUtils]: 96: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,406 INFO L273 TraceCheckUtils]: 97: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,406 INFO L273 TraceCheckUtils]: 98: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,406 INFO L273 TraceCheckUtils]: 99: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,406 INFO L273 TraceCheckUtils]: 100: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,406 INFO L273 TraceCheckUtils]: 101: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,407 INFO L273 TraceCheckUtils]: 102: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,407 INFO L273 TraceCheckUtils]: 103: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,407 INFO L273 TraceCheckUtils]: 104: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,407 INFO L273 TraceCheckUtils]: 105: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,407 INFO L273 TraceCheckUtils]: 106: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,407 INFO L273 TraceCheckUtils]: 107: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,407 INFO L273 TraceCheckUtils]: 108: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,407 INFO L273 TraceCheckUtils]: 109: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,407 INFO L273 TraceCheckUtils]: 110: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,408 INFO L273 TraceCheckUtils]: 111: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,408 INFO L273 TraceCheckUtils]: 112: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,408 INFO L273 TraceCheckUtils]: 113: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,408 INFO L273 TraceCheckUtils]: 114: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,408 INFO L273 TraceCheckUtils]: 115: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,408 INFO L273 TraceCheckUtils]: 116: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,408 INFO L273 TraceCheckUtils]: 117: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,408 INFO L273 TraceCheckUtils]: 118: Hoare triple {14241#true} assume !(~i~0 < 1000); {14241#true} is VALID [2018-11-14 17:09:25,408 INFO L273 TraceCheckUtils]: 119: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 17:09:25,409 INFO L273 TraceCheckUtils]: 120: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,409 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {14241#true} {14242#false} #75#return; {14242#false} is VALID [2018-11-14 17:09:25,409 INFO L273 TraceCheckUtils]: 122: Hoare triple {14242#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14242#false} is VALID [2018-11-14 17:09:25,409 INFO L273 TraceCheckUtils]: 123: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,409 INFO L273 TraceCheckUtils]: 124: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,409 INFO L273 TraceCheckUtils]: 125: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,409 INFO L273 TraceCheckUtils]: 126: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,409 INFO L273 TraceCheckUtils]: 127: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,409 INFO L273 TraceCheckUtils]: 128: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,409 INFO L273 TraceCheckUtils]: 129: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,410 INFO L273 TraceCheckUtils]: 130: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,410 INFO L273 TraceCheckUtils]: 131: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,410 INFO L273 TraceCheckUtils]: 132: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,410 INFO L273 TraceCheckUtils]: 133: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,410 INFO L273 TraceCheckUtils]: 134: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,410 INFO L273 TraceCheckUtils]: 135: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,410 INFO L273 TraceCheckUtils]: 136: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,410 INFO L273 TraceCheckUtils]: 137: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,410 INFO L273 TraceCheckUtils]: 138: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,411 INFO L273 TraceCheckUtils]: 139: Hoare triple {14242#false} assume !(~i~2 < 999); {14242#false} is VALID [2018-11-14 17:09:25,411 INFO L273 TraceCheckUtils]: 140: Hoare triple {14242#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {14242#false} is VALID [2018-11-14 17:09:25,411 INFO L256 TraceCheckUtils]: 141: Hoare triple {14242#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {14241#true} is VALID [2018-11-14 17:09:25,411 INFO L273 TraceCheckUtils]: 142: Hoare triple {14241#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14241#true} is VALID [2018-11-14 17:09:25,411 INFO L273 TraceCheckUtils]: 143: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,411 INFO L273 TraceCheckUtils]: 144: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,411 INFO L273 TraceCheckUtils]: 145: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,411 INFO L273 TraceCheckUtils]: 146: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,411 INFO L273 TraceCheckUtils]: 147: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,411 INFO L273 TraceCheckUtils]: 148: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,412 INFO L273 TraceCheckUtils]: 149: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,412 INFO L273 TraceCheckUtils]: 150: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,412 INFO L273 TraceCheckUtils]: 151: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,412 INFO L273 TraceCheckUtils]: 152: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,412 INFO L273 TraceCheckUtils]: 153: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,412 INFO L273 TraceCheckUtils]: 154: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,412 INFO L273 TraceCheckUtils]: 155: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,412 INFO L273 TraceCheckUtils]: 156: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,412 INFO L273 TraceCheckUtils]: 157: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 158: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 159: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 160: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 161: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 162: Hoare triple {14241#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 163: Hoare triple {14241#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 164: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 165: Hoare triple {14241#true} assume !(~i~0 < 1000); {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 166: Hoare triple {14241#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14241#true} is VALID [2018-11-14 17:09:25,413 INFO L273 TraceCheckUtils]: 167: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,414 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {14241#true} {14242#false} #77#return; {14242#false} is VALID [2018-11-14 17:09:25,414 INFO L273 TraceCheckUtils]: 169: Hoare triple {14242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14242#false} is VALID [2018-11-14 17:09:25,414 INFO L273 TraceCheckUtils]: 170: Hoare triple {14242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14242#false} is VALID [2018-11-14 17:09:25,414 INFO L273 TraceCheckUtils]: 171: Hoare triple {14242#false} assume !false; {14242#false} is VALID [2018-11-14 17:09:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:09:25,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:25,427 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-14 17:09:25,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:09:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:25,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:25,841 INFO L256 TraceCheckUtils]: 0: Hoare triple {14241#true} call ULTIMATE.init(); {14241#true} is VALID [2018-11-14 17:09:25,841 INFO L273 TraceCheckUtils]: 1: Hoare triple {14241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14241#true} is VALID [2018-11-14 17:09:25,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {14241#true} assume true; {14241#true} is VALID [2018-11-14 17:09:25,842 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14241#true} {14241#true} #69#return; {14241#true} is VALID [2018-11-14 17:09:25,842 INFO L256 TraceCheckUtils]: 4: Hoare triple {14241#true} call #t~ret13 := main(); {14241#true} is VALID [2018-11-14 17:09:25,843 INFO L273 TraceCheckUtils]: 5: Hoare triple {14241#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:25,843 INFO L273 TraceCheckUtils]: 6: Hoare triple {14281#(<= main_~i~1 0)} assume true; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:25,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {14281#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14281#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:25,844 INFO L273 TraceCheckUtils]: 8: Hoare triple {14281#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:25,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {14244#(<= main_~i~1 1)} assume true; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:25,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {14244#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14244#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:25,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {14244#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:25,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {14245#(<= main_~i~1 2)} assume true; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:25,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {14245#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14245#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:25,846 INFO L273 TraceCheckUtils]: 14: Hoare triple {14245#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:25,847 INFO L273 TraceCheckUtils]: 15: Hoare triple {14246#(<= main_~i~1 3)} assume true; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:25,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {14246#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14246#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:25,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {14246#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:25,848 INFO L273 TraceCheckUtils]: 18: Hoare triple {14247#(<= main_~i~1 4)} assume true; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:25,849 INFO L273 TraceCheckUtils]: 19: Hoare triple {14247#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14247#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:25,850 INFO L273 TraceCheckUtils]: 20: Hoare triple {14247#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:25,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {14248#(<= main_~i~1 5)} assume true; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:25,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {14248#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14248#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:25,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {14248#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:25,852 INFO L273 TraceCheckUtils]: 24: Hoare triple {14249#(<= main_~i~1 6)} assume true; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:25,852 INFO L273 TraceCheckUtils]: 25: Hoare triple {14249#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14249#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:25,853 INFO L273 TraceCheckUtils]: 26: Hoare triple {14249#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:25,854 INFO L273 TraceCheckUtils]: 27: Hoare triple {14250#(<= main_~i~1 7)} assume true; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:25,854 INFO L273 TraceCheckUtils]: 28: Hoare triple {14250#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14250#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:25,855 INFO L273 TraceCheckUtils]: 29: Hoare triple {14250#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:25,855 INFO L273 TraceCheckUtils]: 30: Hoare triple {14251#(<= main_~i~1 8)} assume true; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:25,856 INFO L273 TraceCheckUtils]: 31: Hoare triple {14251#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14251#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:25,857 INFO L273 TraceCheckUtils]: 32: Hoare triple {14251#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:25,857 INFO L273 TraceCheckUtils]: 33: Hoare triple {14252#(<= main_~i~1 9)} assume true; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:25,858 INFO L273 TraceCheckUtils]: 34: Hoare triple {14252#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14252#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:25,858 INFO L273 TraceCheckUtils]: 35: Hoare triple {14252#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:25,859 INFO L273 TraceCheckUtils]: 36: Hoare triple {14253#(<= main_~i~1 10)} assume true; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:25,859 INFO L273 TraceCheckUtils]: 37: Hoare triple {14253#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14253#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:25,860 INFO L273 TraceCheckUtils]: 38: Hoare triple {14253#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:25,861 INFO L273 TraceCheckUtils]: 39: Hoare triple {14254#(<= main_~i~1 11)} assume true; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:25,861 INFO L273 TraceCheckUtils]: 40: Hoare triple {14254#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14254#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:25,862 INFO L273 TraceCheckUtils]: 41: Hoare triple {14254#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:25,862 INFO L273 TraceCheckUtils]: 42: Hoare triple {14255#(<= main_~i~1 12)} assume true; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:25,863 INFO L273 TraceCheckUtils]: 43: Hoare triple {14255#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14255#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:25,863 INFO L273 TraceCheckUtils]: 44: Hoare triple {14255#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:25,864 INFO L273 TraceCheckUtils]: 45: Hoare triple {14256#(<= main_~i~1 13)} assume true; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:25,864 INFO L273 TraceCheckUtils]: 46: Hoare triple {14256#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14256#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:25,865 INFO L273 TraceCheckUtils]: 47: Hoare triple {14256#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:25,866 INFO L273 TraceCheckUtils]: 48: Hoare triple {14257#(<= main_~i~1 14)} assume true; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:25,866 INFO L273 TraceCheckUtils]: 49: Hoare triple {14257#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14257#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:25,867 INFO L273 TraceCheckUtils]: 50: Hoare triple {14257#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:25,867 INFO L273 TraceCheckUtils]: 51: Hoare triple {14258#(<= main_~i~1 15)} assume true; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:25,868 INFO L273 TraceCheckUtils]: 52: Hoare triple {14258#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14258#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:25,869 INFO L273 TraceCheckUtils]: 53: Hoare triple {14258#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:25,869 INFO L273 TraceCheckUtils]: 54: Hoare triple {14259#(<= main_~i~1 16)} assume true; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:25,870 INFO L273 TraceCheckUtils]: 55: Hoare triple {14259#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14259#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:25,870 INFO L273 TraceCheckUtils]: 56: Hoare triple {14259#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:25,871 INFO L273 TraceCheckUtils]: 57: Hoare triple {14260#(<= main_~i~1 17)} assume true; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:25,871 INFO L273 TraceCheckUtils]: 58: Hoare triple {14260#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14260#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:25,872 INFO L273 TraceCheckUtils]: 59: Hoare triple {14260#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:25,873 INFO L273 TraceCheckUtils]: 60: Hoare triple {14261#(<= main_~i~1 18)} assume true; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:25,873 INFO L273 TraceCheckUtils]: 61: Hoare triple {14261#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {14261#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:25,874 INFO L273 TraceCheckUtils]: 62: Hoare triple {14261#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:25,874 INFO L273 TraceCheckUtils]: 63: Hoare triple {14262#(<= main_~i~1 19)} assume true; {14262#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:25,875 INFO L273 TraceCheckUtils]: 64: Hoare triple {14262#(<= main_~i~1 19)} assume !(~i~1 < 1000); {14242#false} is VALID [2018-11-14 17:09:25,875 INFO L256 TraceCheckUtils]: 65: Hoare triple {14242#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 17:09:25,875 INFO L273 TraceCheckUtils]: 66: Hoare triple {14242#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14242#false} is VALID [2018-11-14 17:09:25,876 INFO L273 TraceCheckUtils]: 67: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,876 INFO L273 TraceCheckUtils]: 68: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,876 INFO L273 TraceCheckUtils]: 69: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,876 INFO L273 TraceCheckUtils]: 70: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,876 INFO L273 TraceCheckUtils]: 71: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,877 INFO L273 TraceCheckUtils]: 72: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,877 INFO L273 TraceCheckUtils]: 74: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,877 INFO L273 TraceCheckUtils]: 75: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,877 INFO L273 TraceCheckUtils]: 76: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,878 INFO L273 TraceCheckUtils]: 77: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,878 INFO L273 TraceCheckUtils]: 78: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,878 INFO L273 TraceCheckUtils]: 79: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,878 INFO L273 TraceCheckUtils]: 80: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,878 INFO L273 TraceCheckUtils]: 81: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,878 INFO L273 TraceCheckUtils]: 82: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,879 INFO L273 TraceCheckUtils]: 83: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,879 INFO L273 TraceCheckUtils]: 84: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,879 INFO L273 TraceCheckUtils]: 85: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,879 INFO L273 TraceCheckUtils]: 86: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,879 INFO L273 TraceCheckUtils]: 87: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,879 INFO L273 TraceCheckUtils]: 88: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,879 INFO L273 TraceCheckUtils]: 89: Hoare triple {14242#false} assume !(~i~0 < 1000); {14242#false} is VALID [2018-11-14 17:09:25,879 INFO L273 TraceCheckUtils]: 90: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 17:09:25,880 INFO L273 TraceCheckUtils]: 91: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,880 INFO L268 TraceCheckUtils]: 92: Hoare quadruple {14242#false} {14242#false} #73#return; {14242#false} is VALID [2018-11-14 17:09:25,880 INFO L273 TraceCheckUtils]: 93: Hoare triple {14242#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {14242#false} is VALID [2018-11-14 17:09:25,880 INFO L256 TraceCheckUtils]: 94: Hoare triple {14242#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 17:09:25,880 INFO L273 TraceCheckUtils]: 95: Hoare triple {14242#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14242#false} is VALID [2018-11-14 17:09:25,880 INFO L273 TraceCheckUtils]: 96: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,880 INFO L273 TraceCheckUtils]: 97: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,880 INFO L273 TraceCheckUtils]: 98: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,880 INFO L273 TraceCheckUtils]: 99: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,881 INFO L273 TraceCheckUtils]: 100: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,881 INFO L273 TraceCheckUtils]: 101: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,881 INFO L273 TraceCheckUtils]: 102: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,881 INFO L273 TraceCheckUtils]: 103: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,881 INFO L273 TraceCheckUtils]: 104: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,881 INFO L273 TraceCheckUtils]: 105: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,881 INFO L273 TraceCheckUtils]: 106: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,881 INFO L273 TraceCheckUtils]: 107: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,881 INFO L273 TraceCheckUtils]: 108: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 109: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 110: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 111: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 112: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 113: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 114: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 115: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 116: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 117: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,882 INFO L273 TraceCheckUtils]: 118: Hoare triple {14242#false} assume !(~i~0 < 1000); {14242#false} is VALID [2018-11-14 17:09:25,883 INFO L273 TraceCheckUtils]: 119: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 17:09:25,883 INFO L273 TraceCheckUtils]: 120: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,883 INFO L268 TraceCheckUtils]: 121: Hoare quadruple {14242#false} {14242#false} #75#return; {14242#false} is VALID [2018-11-14 17:09:25,883 INFO L273 TraceCheckUtils]: 122: Hoare triple {14242#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {14242#false} is VALID [2018-11-14 17:09:25,883 INFO L273 TraceCheckUtils]: 123: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,883 INFO L273 TraceCheckUtils]: 124: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,883 INFO L273 TraceCheckUtils]: 125: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,883 INFO L273 TraceCheckUtils]: 126: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,883 INFO L273 TraceCheckUtils]: 127: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,884 INFO L273 TraceCheckUtils]: 128: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,884 INFO L273 TraceCheckUtils]: 129: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,884 INFO L273 TraceCheckUtils]: 130: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,884 INFO L273 TraceCheckUtils]: 131: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,884 INFO L273 TraceCheckUtils]: 132: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,884 INFO L273 TraceCheckUtils]: 133: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,884 INFO L273 TraceCheckUtils]: 134: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,884 INFO L273 TraceCheckUtils]: 135: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,884 INFO L273 TraceCheckUtils]: 136: Hoare triple {14242#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L273 TraceCheckUtils]: 137: Hoare triple {14242#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L273 TraceCheckUtils]: 138: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L273 TraceCheckUtils]: 139: Hoare triple {14242#false} assume !(~i~2 < 999); {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L273 TraceCheckUtils]: 140: Hoare triple {14242#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L256 TraceCheckUtils]: 141: Hoare triple {14242#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L273 TraceCheckUtils]: 142: Hoare triple {14242#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L273 TraceCheckUtils]: 143: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L273 TraceCheckUtils]: 144: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L273 TraceCheckUtils]: 145: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,885 INFO L273 TraceCheckUtils]: 146: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,886 INFO L273 TraceCheckUtils]: 147: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,886 INFO L273 TraceCheckUtils]: 148: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,886 INFO L273 TraceCheckUtils]: 149: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,886 INFO L273 TraceCheckUtils]: 150: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,886 INFO L273 TraceCheckUtils]: 151: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,886 INFO L273 TraceCheckUtils]: 152: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,886 INFO L273 TraceCheckUtils]: 153: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,886 INFO L273 TraceCheckUtils]: 154: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,886 INFO L273 TraceCheckUtils]: 155: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,887 INFO L273 TraceCheckUtils]: 156: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,887 INFO L273 TraceCheckUtils]: 157: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,887 INFO L273 TraceCheckUtils]: 158: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,887 INFO L273 TraceCheckUtils]: 159: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,887 INFO L273 TraceCheckUtils]: 160: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,887 INFO L273 TraceCheckUtils]: 161: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,887 INFO L273 TraceCheckUtils]: 162: Hoare triple {14242#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {14242#false} is VALID [2018-11-14 17:09:25,887 INFO L273 TraceCheckUtils]: 163: Hoare triple {14242#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {14242#false} is VALID [2018-11-14 17:09:25,887 INFO L273 TraceCheckUtils]: 164: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,888 INFO L273 TraceCheckUtils]: 165: Hoare triple {14242#false} assume !(~i~0 < 1000); {14242#false} is VALID [2018-11-14 17:09:25,888 INFO L273 TraceCheckUtils]: 166: Hoare triple {14242#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {14242#false} is VALID [2018-11-14 17:09:25,888 INFO L273 TraceCheckUtils]: 167: Hoare triple {14242#false} assume true; {14242#false} is VALID [2018-11-14 17:09:25,888 INFO L268 TraceCheckUtils]: 168: Hoare quadruple {14242#false} {14242#false} #77#return; {14242#false} is VALID [2018-11-14 17:09:25,888 INFO L273 TraceCheckUtils]: 169: Hoare triple {14242#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {14242#false} is VALID [2018-11-14 17:09:25,888 INFO L273 TraceCheckUtils]: 170: Hoare triple {14242#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {14242#false} is VALID [2018-11-14 17:09:25,888 INFO L273 TraceCheckUtils]: 171: Hoare triple {14242#false} assume !false; {14242#false} is VALID [2018-11-14 17:09:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:09:25,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:25,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 17:09:25,924 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 172 [2018-11-14 17:09:25,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:25,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 17:09:26,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:26,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 17:09:26,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 17:09:26,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:09:26,019 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 23 states. [2018-11-14 17:09:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:26,824 INFO L93 Difference]: Finished difference Result 177 states and 185 transitions. [2018-11-14 17:09:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 17:09:26,824 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 172 [2018-11-14 17:09:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:09:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2018-11-14 17:09:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:09:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 117 transitions. [2018-11-14 17:09:26,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 117 transitions. [2018-11-14 17:09:26,932 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-14 17:09:26,935 INFO L225 Difference]: With dead ends: 177 [2018-11-14 17:09:26,935 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 17:09:26,936 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:09:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 17:09:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-11-14 17:09:26,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:26,995 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 122 states. [2018-11-14 17:09:26,995 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 122 states. [2018-11-14 17:09:26,995 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 122 states. [2018-11-14 17:09:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:26,998 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 17:09:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 17:09:26,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:26,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:26,999 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 123 states. [2018-11-14 17:09:26,999 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 123 states. [2018-11-14 17:09:27,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:27,001 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 17:09:27,001 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2018-11-14 17:09:27,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:27,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:27,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:27,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 17:09:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2018-11-14 17:09:27,004 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 172 [2018-11-14 17:09:27,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:27,005 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-11-14 17:09:27,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 17:09:27,005 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2018-11-14 17:09:27,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-14 17:09:27,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:27,006 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 21, 20, 20, 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] [2018-11-14 17:09:27,006 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:27,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:27,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1124485529, now seen corresponding path program 20 times [2018-11-14 17:09:27,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:27,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:27,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:09:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:27,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {15428#true} call ULTIMATE.init(); {15428#true} is VALID [2018-11-14 17:09:27,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {15428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15428#true} is VALID [2018-11-14 17:09:27,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15428#true} {15428#true} #69#return; {15428#true} is VALID [2018-11-14 17:09:27,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {15428#true} call #t~ret13 := main(); {15428#true} is VALID [2018-11-14 17:09:27,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {15428#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15430#(= main_~i~1 0)} is VALID [2018-11-14 17:09:27,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {15430#(= main_~i~1 0)} assume true; {15430#(= main_~i~1 0)} is VALID [2018-11-14 17:09:27,769 INFO L273 TraceCheckUtils]: 7: Hoare triple {15430#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15430#(= main_~i~1 0)} is VALID [2018-11-14 17:09:27,769 INFO L273 TraceCheckUtils]: 8: Hoare triple {15430#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:27,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {15431#(<= main_~i~1 1)} assume true; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:27,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {15431#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:27,770 INFO L273 TraceCheckUtils]: 11: Hoare triple {15431#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:27,771 INFO L273 TraceCheckUtils]: 12: Hoare triple {15432#(<= main_~i~1 2)} assume true; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:27,771 INFO L273 TraceCheckUtils]: 13: Hoare triple {15432#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:27,771 INFO L273 TraceCheckUtils]: 14: Hoare triple {15432#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:27,772 INFO L273 TraceCheckUtils]: 15: Hoare triple {15433#(<= main_~i~1 3)} assume true; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:27,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {15433#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:27,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {15433#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:27,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {15434#(<= main_~i~1 4)} assume true; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:27,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {15434#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:27,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {15434#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:27,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {15435#(<= main_~i~1 5)} assume true; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:27,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {15435#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:27,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {15435#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:27,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {15436#(<= main_~i~1 6)} assume true; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:27,777 INFO L273 TraceCheckUtils]: 25: Hoare triple {15436#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:27,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {15436#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:27,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {15437#(<= main_~i~1 7)} assume true; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:27,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {15437#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:27,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {15437#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:27,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {15438#(<= main_~i~1 8)} assume true; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:27,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {15438#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:27,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {15438#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:27,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {15439#(<= main_~i~1 9)} assume true; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:27,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {15439#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:27,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {15439#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:27,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {15440#(<= main_~i~1 10)} assume true; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:27,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {15440#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:27,785 INFO L273 TraceCheckUtils]: 38: Hoare triple {15440#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:27,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {15441#(<= main_~i~1 11)} assume true; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:27,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {15441#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:27,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {15441#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:27,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {15442#(<= main_~i~1 12)} assume true; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:27,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {15442#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:27,788 INFO L273 TraceCheckUtils]: 44: Hoare triple {15442#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:27,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {15443#(<= main_~i~1 13)} assume true; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:27,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {15443#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:27,790 INFO L273 TraceCheckUtils]: 47: Hoare triple {15443#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:27,790 INFO L273 TraceCheckUtils]: 48: Hoare triple {15444#(<= main_~i~1 14)} assume true; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:27,791 INFO L273 TraceCheckUtils]: 49: Hoare triple {15444#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:27,792 INFO L273 TraceCheckUtils]: 50: Hoare triple {15444#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:27,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {15445#(<= main_~i~1 15)} assume true; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:27,793 INFO L273 TraceCheckUtils]: 52: Hoare triple {15445#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:27,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {15445#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:27,794 INFO L273 TraceCheckUtils]: 54: Hoare triple {15446#(<= main_~i~1 16)} assume true; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:27,794 INFO L273 TraceCheckUtils]: 55: Hoare triple {15446#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:27,795 INFO L273 TraceCheckUtils]: 56: Hoare triple {15446#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:27,796 INFO L273 TraceCheckUtils]: 57: Hoare triple {15447#(<= main_~i~1 17)} assume true; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:27,796 INFO L273 TraceCheckUtils]: 58: Hoare triple {15447#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:27,797 INFO L273 TraceCheckUtils]: 59: Hoare triple {15447#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:27,797 INFO L273 TraceCheckUtils]: 60: Hoare triple {15448#(<= main_~i~1 18)} assume true; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:27,798 INFO L273 TraceCheckUtils]: 61: Hoare triple {15448#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:27,799 INFO L273 TraceCheckUtils]: 62: Hoare triple {15448#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:27,799 INFO L273 TraceCheckUtils]: 63: Hoare triple {15449#(<= main_~i~1 19)} assume true; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:27,800 INFO L273 TraceCheckUtils]: 64: Hoare triple {15449#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:27,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {15449#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:27,801 INFO L273 TraceCheckUtils]: 66: Hoare triple {15450#(<= main_~i~1 20)} assume true; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:27,802 INFO L273 TraceCheckUtils]: 67: Hoare triple {15450#(<= main_~i~1 20)} assume !(~i~1 < 1000); {15429#false} is VALID [2018-11-14 17:09:27,802 INFO L256 TraceCheckUtils]: 68: Hoare triple {15429#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 17:09:27,802 INFO L273 TraceCheckUtils]: 69: Hoare triple {15428#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15428#true} is VALID [2018-11-14 17:09:27,802 INFO L273 TraceCheckUtils]: 70: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,802 INFO L273 TraceCheckUtils]: 71: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,803 INFO L273 TraceCheckUtils]: 72: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,803 INFO L273 TraceCheckUtils]: 73: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,803 INFO L273 TraceCheckUtils]: 74: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,803 INFO L273 TraceCheckUtils]: 75: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,803 INFO L273 TraceCheckUtils]: 76: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,803 INFO L273 TraceCheckUtils]: 77: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,804 INFO L273 TraceCheckUtils]: 78: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,804 INFO L273 TraceCheckUtils]: 79: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,804 INFO L273 TraceCheckUtils]: 80: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,804 INFO L273 TraceCheckUtils]: 81: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,804 INFO L273 TraceCheckUtils]: 82: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,805 INFO L273 TraceCheckUtils]: 83: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,805 INFO L273 TraceCheckUtils]: 84: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,805 INFO L273 TraceCheckUtils]: 85: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,805 INFO L273 TraceCheckUtils]: 86: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,805 INFO L273 TraceCheckUtils]: 87: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,805 INFO L273 TraceCheckUtils]: 88: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,805 INFO L273 TraceCheckUtils]: 89: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,805 INFO L273 TraceCheckUtils]: 90: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,805 INFO L273 TraceCheckUtils]: 91: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,806 INFO L273 TraceCheckUtils]: 92: Hoare triple {15428#true} assume !(~i~0 < 1000); {15428#true} is VALID [2018-11-14 17:09:27,806 INFO L273 TraceCheckUtils]: 93: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 17:09:27,806 INFO L273 TraceCheckUtils]: 94: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,806 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15428#true} {15429#false} #73#return; {15429#false} is VALID [2018-11-14 17:09:27,806 INFO L273 TraceCheckUtils]: 96: Hoare triple {15429#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {15429#false} is VALID [2018-11-14 17:09:27,806 INFO L256 TraceCheckUtils]: 97: Hoare triple {15429#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 17:09:27,806 INFO L273 TraceCheckUtils]: 98: Hoare triple {15428#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15428#true} is VALID [2018-11-14 17:09:27,806 INFO L273 TraceCheckUtils]: 99: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,806 INFO L273 TraceCheckUtils]: 100: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,807 INFO L273 TraceCheckUtils]: 101: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,807 INFO L273 TraceCheckUtils]: 102: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,807 INFO L273 TraceCheckUtils]: 103: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,807 INFO L273 TraceCheckUtils]: 104: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,807 INFO L273 TraceCheckUtils]: 105: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,807 INFO L273 TraceCheckUtils]: 106: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,807 INFO L273 TraceCheckUtils]: 107: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,807 INFO L273 TraceCheckUtils]: 108: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,807 INFO L273 TraceCheckUtils]: 109: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,808 INFO L273 TraceCheckUtils]: 110: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,808 INFO L273 TraceCheckUtils]: 111: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,808 INFO L273 TraceCheckUtils]: 112: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,808 INFO L273 TraceCheckUtils]: 113: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,808 INFO L273 TraceCheckUtils]: 114: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,808 INFO L273 TraceCheckUtils]: 115: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,808 INFO L273 TraceCheckUtils]: 116: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,808 INFO L273 TraceCheckUtils]: 117: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,808 INFO L273 TraceCheckUtils]: 118: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,809 INFO L273 TraceCheckUtils]: 119: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,809 INFO L273 TraceCheckUtils]: 120: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,809 INFO L273 TraceCheckUtils]: 121: Hoare triple {15428#true} assume !(~i~0 < 1000); {15428#true} is VALID [2018-11-14 17:09:27,809 INFO L273 TraceCheckUtils]: 122: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 17:09:27,809 INFO L273 TraceCheckUtils]: 123: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,809 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {15428#true} {15429#false} #75#return; {15429#false} is VALID [2018-11-14 17:09:27,809 INFO L273 TraceCheckUtils]: 125: Hoare triple {15429#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15429#false} is VALID [2018-11-14 17:09:27,809 INFO L273 TraceCheckUtils]: 126: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:27,809 INFO L273 TraceCheckUtils]: 127: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 128: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 129: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 130: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 131: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 132: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 133: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 134: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 135: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 136: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:27,810 INFO L273 TraceCheckUtils]: 137: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:27,811 INFO L273 TraceCheckUtils]: 138: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:27,811 INFO L273 TraceCheckUtils]: 139: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:27,811 INFO L273 TraceCheckUtils]: 140: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:27,811 INFO L273 TraceCheckUtils]: 141: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:27,811 INFO L273 TraceCheckUtils]: 142: Hoare triple {15429#false} assume !(~i~2 < 999); {15429#false} is VALID [2018-11-14 17:09:27,811 INFO L273 TraceCheckUtils]: 143: Hoare triple {15429#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {15429#false} is VALID [2018-11-14 17:09:27,811 INFO L256 TraceCheckUtils]: 144: Hoare triple {15429#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {15428#true} is VALID [2018-11-14 17:09:27,811 INFO L273 TraceCheckUtils]: 145: Hoare triple {15428#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15428#true} is VALID [2018-11-14 17:09:27,811 INFO L273 TraceCheckUtils]: 146: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,812 INFO L273 TraceCheckUtils]: 147: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,812 INFO L273 TraceCheckUtils]: 148: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,812 INFO L273 TraceCheckUtils]: 149: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,812 INFO L273 TraceCheckUtils]: 150: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,812 INFO L273 TraceCheckUtils]: 151: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,812 INFO L273 TraceCheckUtils]: 152: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,812 INFO L273 TraceCheckUtils]: 153: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,812 INFO L273 TraceCheckUtils]: 154: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,812 INFO L273 TraceCheckUtils]: 155: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 156: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 157: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 158: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 159: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 160: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 161: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 162: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 163: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 164: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,813 INFO L273 TraceCheckUtils]: 165: Hoare triple {15428#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15428#true} is VALID [2018-11-14 17:09:27,814 INFO L273 TraceCheckUtils]: 166: Hoare triple {15428#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15428#true} is VALID [2018-11-14 17:09:27,814 INFO L273 TraceCheckUtils]: 167: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,814 INFO L273 TraceCheckUtils]: 168: Hoare triple {15428#true} assume !(~i~0 < 1000); {15428#true} is VALID [2018-11-14 17:09:27,814 INFO L273 TraceCheckUtils]: 169: Hoare triple {15428#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15428#true} is VALID [2018-11-14 17:09:27,814 INFO L273 TraceCheckUtils]: 170: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:27,814 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {15428#true} {15429#false} #77#return; {15429#false} is VALID [2018-11-14 17:09:27,814 INFO L273 TraceCheckUtils]: 172: Hoare triple {15429#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15429#false} is VALID [2018-11-14 17:09:27,814 INFO L273 TraceCheckUtils]: 173: Hoare triple {15429#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15429#false} is VALID [2018-11-14 17:09:27,814 INFO L273 TraceCheckUtils]: 174: Hoare triple {15429#false} assume !false; {15429#false} is VALID [2018-11-14 17:09:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:09:27,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:27,829 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-14 17:09:27,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:09:27,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:09:27,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:27,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:29,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {15428#true} call ULTIMATE.init(); {15428#true} is VALID [2018-11-14 17:09:29,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {15428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15428#true} is VALID [2018-11-14 17:09:29,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {15428#true} assume true; {15428#true} is VALID [2018-11-14 17:09:29,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15428#true} {15428#true} #69#return; {15428#true} is VALID [2018-11-14 17:09:29,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {15428#true} call #t~ret13 := main(); {15428#true} is VALID [2018-11-14 17:09:29,560 INFO L273 TraceCheckUtils]: 5: Hoare triple {15428#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:29,560 INFO L273 TraceCheckUtils]: 6: Hoare triple {15469#(<= main_~i~1 0)} assume true; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:29,560 INFO L273 TraceCheckUtils]: 7: Hoare triple {15469#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15469#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:29,561 INFO L273 TraceCheckUtils]: 8: Hoare triple {15469#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:29,561 INFO L273 TraceCheckUtils]: 9: Hoare triple {15431#(<= main_~i~1 1)} assume true; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:29,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {15431#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15431#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:29,562 INFO L273 TraceCheckUtils]: 11: Hoare triple {15431#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:29,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {15432#(<= main_~i~1 2)} assume true; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:29,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {15432#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15432#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:29,564 INFO L273 TraceCheckUtils]: 14: Hoare triple {15432#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:29,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {15433#(<= main_~i~1 3)} assume true; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:29,565 INFO L273 TraceCheckUtils]: 16: Hoare triple {15433#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15433#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:29,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {15433#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:29,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {15434#(<= main_~i~1 4)} assume true; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:29,566 INFO L273 TraceCheckUtils]: 19: Hoare triple {15434#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15434#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:29,567 INFO L273 TraceCheckUtils]: 20: Hoare triple {15434#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:29,568 INFO L273 TraceCheckUtils]: 21: Hoare triple {15435#(<= main_~i~1 5)} assume true; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:29,568 INFO L273 TraceCheckUtils]: 22: Hoare triple {15435#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15435#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:29,569 INFO L273 TraceCheckUtils]: 23: Hoare triple {15435#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:29,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {15436#(<= main_~i~1 6)} assume true; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:29,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {15436#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15436#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:29,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {15436#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:29,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {15437#(<= main_~i~1 7)} assume true; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:29,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {15437#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15437#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:29,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {15437#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:29,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {15438#(<= main_~i~1 8)} assume true; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:29,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {15438#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15438#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:29,574 INFO L273 TraceCheckUtils]: 32: Hoare triple {15438#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:29,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {15439#(<= main_~i~1 9)} assume true; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:29,575 INFO L273 TraceCheckUtils]: 34: Hoare triple {15439#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15439#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:29,576 INFO L273 TraceCheckUtils]: 35: Hoare triple {15439#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:29,576 INFO L273 TraceCheckUtils]: 36: Hoare triple {15440#(<= main_~i~1 10)} assume true; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:29,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {15440#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15440#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:29,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {15440#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:29,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {15441#(<= main_~i~1 11)} assume true; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:29,579 INFO L273 TraceCheckUtils]: 40: Hoare triple {15441#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15441#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:29,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {15441#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:29,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {15442#(<= main_~i~1 12)} assume true; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:29,580 INFO L273 TraceCheckUtils]: 43: Hoare triple {15442#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15442#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:29,581 INFO L273 TraceCheckUtils]: 44: Hoare triple {15442#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:29,582 INFO L273 TraceCheckUtils]: 45: Hoare triple {15443#(<= main_~i~1 13)} assume true; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:29,582 INFO L273 TraceCheckUtils]: 46: Hoare triple {15443#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15443#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:29,583 INFO L273 TraceCheckUtils]: 47: Hoare triple {15443#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:29,583 INFO L273 TraceCheckUtils]: 48: Hoare triple {15444#(<= main_~i~1 14)} assume true; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:29,584 INFO L273 TraceCheckUtils]: 49: Hoare triple {15444#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15444#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:29,584 INFO L273 TraceCheckUtils]: 50: Hoare triple {15444#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:29,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {15445#(<= main_~i~1 15)} assume true; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:29,585 INFO L273 TraceCheckUtils]: 52: Hoare triple {15445#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15445#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:29,586 INFO L273 TraceCheckUtils]: 53: Hoare triple {15445#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:29,587 INFO L273 TraceCheckUtils]: 54: Hoare triple {15446#(<= main_~i~1 16)} assume true; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:29,587 INFO L273 TraceCheckUtils]: 55: Hoare triple {15446#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15446#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:29,588 INFO L273 TraceCheckUtils]: 56: Hoare triple {15446#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:29,588 INFO L273 TraceCheckUtils]: 57: Hoare triple {15447#(<= main_~i~1 17)} assume true; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:29,589 INFO L273 TraceCheckUtils]: 58: Hoare triple {15447#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15447#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:29,590 INFO L273 TraceCheckUtils]: 59: Hoare triple {15447#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:29,590 INFO L273 TraceCheckUtils]: 60: Hoare triple {15448#(<= main_~i~1 18)} assume true; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:29,591 INFO L273 TraceCheckUtils]: 61: Hoare triple {15448#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15448#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:29,591 INFO L273 TraceCheckUtils]: 62: Hoare triple {15448#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:29,592 INFO L273 TraceCheckUtils]: 63: Hoare triple {15449#(<= main_~i~1 19)} assume true; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:29,592 INFO L273 TraceCheckUtils]: 64: Hoare triple {15449#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {15449#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:29,593 INFO L273 TraceCheckUtils]: 65: Hoare triple {15449#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:29,612 INFO L273 TraceCheckUtils]: 66: Hoare triple {15450#(<= main_~i~1 20)} assume true; {15450#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:29,621 INFO L273 TraceCheckUtils]: 67: Hoare triple {15450#(<= main_~i~1 20)} assume !(~i~1 < 1000); {15429#false} is VALID [2018-11-14 17:09:29,621 INFO L256 TraceCheckUtils]: 68: Hoare triple {15429#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 17:09:29,621 INFO L273 TraceCheckUtils]: 69: Hoare triple {15429#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15429#false} is VALID [2018-11-14 17:09:29,621 INFO L273 TraceCheckUtils]: 70: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,622 INFO L273 TraceCheckUtils]: 71: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,622 INFO L273 TraceCheckUtils]: 72: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,622 INFO L273 TraceCheckUtils]: 73: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,622 INFO L273 TraceCheckUtils]: 74: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,622 INFO L273 TraceCheckUtils]: 75: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,622 INFO L273 TraceCheckUtils]: 76: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,622 INFO L273 TraceCheckUtils]: 77: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,623 INFO L273 TraceCheckUtils]: 78: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,623 INFO L273 TraceCheckUtils]: 79: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,623 INFO L273 TraceCheckUtils]: 80: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,623 INFO L273 TraceCheckUtils]: 81: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,623 INFO L273 TraceCheckUtils]: 82: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,623 INFO L273 TraceCheckUtils]: 83: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,623 INFO L273 TraceCheckUtils]: 84: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,624 INFO L273 TraceCheckUtils]: 85: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,624 INFO L273 TraceCheckUtils]: 86: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,624 INFO L273 TraceCheckUtils]: 87: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,624 INFO L273 TraceCheckUtils]: 88: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,624 INFO L273 TraceCheckUtils]: 89: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,624 INFO L273 TraceCheckUtils]: 90: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,625 INFO L273 TraceCheckUtils]: 91: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,625 INFO L273 TraceCheckUtils]: 92: Hoare triple {15429#false} assume !(~i~0 < 1000); {15429#false} is VALID [2018-11-14 17:09:29,625 INFO L273 TraceCheckUtils]: 93: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 17:09:29,625 INFO L273 TraceCheckUtils]: 94: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,625 INFO L268 TraceCheckUtils]: 95: Hoare quadruple {15429#false} {15429#false} #73#return; {15429#false} is VALID [2018-11-14 17:09:29,625 INFO L273 TraceCheckUtils]: 96: Hoare triple {15429#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {15429#false} is VALID [2018-11-14 17:09:29,625 INFO L256 TraceCheckUtils]: 97: Hoare triple {15429#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 17:09:29,626 INFO L273 TraceCheckUtils]: 98: Hoare triple {15429#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15429#false} is VALID [2018-11-14 17:09:29,626 INFO L273 TraceCheckUtils]: 99: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,626 INFO L273 TraceCheckUtils]: 100: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,626 INFO L273 TraceCheckUtils]: 101: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,626 INFO L273 TraceCheckUtils]: 102: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,626 INFO L273 TraceCheckUtils]: 103: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,626 INFO L273 TraceCheckUtils]: 104: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,627 INFO L273 TraceCheckUtils]: 105: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,627 INFO L273 TraceCheckUtils]: 106: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,627 INFO L273 TraceCheckUtils]: 107: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,627 INFO L273 TraceCheckUtils]: 108: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,627 INFO L273 TraceCheckUtils]: 109: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,627 INFO L273 TraceCheckUtils]: 110: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,628 INFO L273 TraceCheckUtils]: 111: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,628 INFO L273 TraceCheckUtils]: 112: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,628 INFO L273 TraceCheckUtils]: 113: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,628 INFO L273 TraceCheckUtils]: 114: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,628 INFO L273 TraceCheckUtils]: 115: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,628 INFO L273 TraceCheckUtils]: 116: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,628 INFO L273 TraceCheckUtils]: 117: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,629 INFO L273 TraceCheckUtils]: 118: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,629 INFO L273 TraceCheckUtils]: 119: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,629 INFO L273 TraceCheckUtils]: 120: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,629 INFO L273 TraceCheckUtils]: 121: Hoare triple {15429#false} assume !(~i~0 < 1000); {15429#false} is VALID [2018-11-14 17:09:29,629 INFO L273 TraceCheckUtils]: 122: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 17:09:29,629 INFO L273 TraceCheckUtils]: 123: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,629 INFO L268 TraceCheckUtils]: 124: Hoare quadruple {15429#false} {15429#false} #75#return; {15429#false} is VALID [2018-11-14 17:09:29,630 INFO L273 TraceCheckUtils]: 125: Hoare triple {15429#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {15429#false} is VALID [2018-11-14 17:09:29,630 INFO L273 TraceCheckUtils]: 126: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,630 INFO L273 TraceCheckUtils]: 127: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:29,630 INFO L273 TraceCheckUtils]: 128: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:29,630 INFO L273 TraceCheckUtils]: 129: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,630 INFO L273 TraceCheckUtils]: 130: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:29,630 INFO L273 TraceCheckUtils]: 131: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:29,631 INFO L273 TraceCheckUtils]: 132: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,631 INFO L273 TraceCheckUtils]: 133: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:29,631 INFO L273 TraceCheckUtils]: 134: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:29,631 INFO L273 TraceCheckUtils]: 135: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,631 INFO L273 TraceCheckUtils]: 136: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:29,631 INFO L273 TraceCheckUtils]: 137: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:29,632 INFO L273 TraceCheckUtils]: 138: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,632 INFO L273 TraceCheckUtils]: 139: Hoare triple {15429#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {15429#false} is VALID [2018-11-14 17:09:29,632 INFO L273 TraceCheckUtils]: 140: Hoare triple {15429#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {15429#false} is VALID [2018-11-14 17:09:29,632 INFO L273 TraceCheckUtils]: 141: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,632 INFO L273 TraceCheckUtils]: 142: Hoare triple {15429#false} assume !(~i~2 < 999); {15429#false} is VALID [2018-11-14 17:09:29,632 INFO L273 TraceCheckUtils]: 143: Hoare triple {15429#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {15429#false} is VALID [2018-11-14 17:09:29,632 INFO L256 TraceCheckUtils]: 144: Hoare triple {15429#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {15429#false} is VALID [2018-11-14 17:09:29,633 INFO L273 TraceCheckUtils]: 145: Hoare triple {15429#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {15429#false} is VALID [2018-11-14 17:09:29,633 INFO L273 TraceCheckUtils]: 146: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,633 INFO L273 TraceCheckUtils]: 147: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,633 INFO L273 TraceCheckUtils]: 148: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,633 INFO L273 TraceCheckUtils]: 149: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,633 INFO L273 TraceCheckUtils]: 150: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,633 INFO L273 TraceCheckUtils]: 151: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,634 INFO L273 TraceCheckUtils]: 152: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,634 INFO L273 TraceCheckUtils]: 153: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,634 INFO L273 TraceCheckUtils]: 154: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,634 INFO L273 TraceCheckUtils]: 155: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,634 INFO L273 TraceCheckUtils]: 156: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,634 INFO L273 TraceCheckUtils]: 157: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,634 INFO L273 TraceCheckUtils]: 158: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,635 INFO L273 TraceCheckUtils]: 159: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,635 INFO L273 TraceCheckUtils]: 160: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,635 INFO L273 TraceCheckUtils]: 161: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,635 INFO L273 TraceCheckUtils]: 162: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,635 INFO L273 TraceCheckUtils]: 163: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,635 INFO L273 TraceCheckUtils]: 164: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,636 INFO L273 TraceCheckUtils]: 165: Hoare triple {15429#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {15429#false} is VALID [2018-11-14 17:09:29,636 INFO L273 TraceCheckUtils]: 166: Hoare triple {15429#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {15429#false} is VALID [2018-11-14 17:09:29,636 INFO L273 TraceCheckUtils]: 167: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,636 INFO L273 TraceCheckUtils]: 168: Hoare triple {15429#false} assume !(~i~0 < 1000); {15429#false} is VALID [2018-11-14 17:09:29,636 INFO L273 TraceCheckUtils]: 169: Hoare triple {15429#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {15429#false} is VALID [2018-11-14 17:09:29,636 INFO L273 TraceCheckUtils]: 170: Hoare triple {15429#false} assume true; {15429#false} is VALID [2018-11-14 17:09:29,636 INFO L268 TraceCheckUtils]: 171: Hoare quadruple {15429#false} {15429#false} #77#return; {15429#false} is VALID [2018-11-14 17:09:29,637 INFO L273 TraceCheckUtils]: 172: Hoare triple {15429#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {15429#false} is VALID [2018-11-14 17:09:29,637 INFO L273 TraceCheckUtils]: 173: Hoare triple {15429#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {15429#false} is VALID [2018-11-14 17:09:29,637 INFO L273 TraceCheckUtils]: 174: Hoare triple {15429#false} assume !false; {15429#false} is VALID [2018-11-14 17:09:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:09:29,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:29,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 17:09:29,675 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 17:09:29,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:29,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:09:29,781 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-14 17:09:29,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:09:29,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:09:29,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:09:29,783 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand 24 states. [2018-11-14 17:09:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:30,465 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-14 17:09:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:09:30,465 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-14 17:09:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:09:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:09:30,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:09:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 120 transitions. [2018-11-14 17:09:30,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 120 transitions. [2018-11-14 17:09:30,577 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-14 17:09:30,580 INFO L225 Difference]: With dead ends: 180 [2018-11-14 17:09:30,580 INFO L226 Difference]: Without dead ends: 126 [2018-11-14 17:09:30,581 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:09:30,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-14 17:09:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-11-14 17:09:30,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:30,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 125 states. [2018-11-14 17:09:30,628 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 125 states. [2018-11-14 17:09:30,628 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 125 states. [2018-11-14 17:09:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:30,630 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 17:09:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 17:09:30,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:30,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:30,631 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 126 states. [2018-11-14 17:09:30,631 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 126 states. [2018-11-14 17:09:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:30,633 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2018-11-14 17:09:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2018-11-14 17:09:30,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:30,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:30,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:30,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:30,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-14 17:09:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-11-14 17:09:30,637 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 175 [2018-11-14 17:09:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:30,637 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-11-14 17:09:30,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:09:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2018-11-14 17:09:30,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-14 17:09:30,638 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:30,639 INFO L375 BasicCegarLoop]: trace histogram [24, 22, 21, 21, 21, 21, 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] [2018-11-14 17:09:30,639 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:30,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:30,639 INFO L82 PathProgramCache]: Analyzing trace with hash 357637805, now seen corresponding path program 21 times [2018-11-14 17:09:30,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:30,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:30,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:30,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:30,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:31,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {16639#true} call ULTIMATE.init(); {16639#true} is VALID [2018-11-14 17:09:31,127 INFO L273 TraceCheckUtils]: 1: Hoare triple {16639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16639#true} is VALID [2018-11-14 17:09:31,128 INFO L273 TraceCheckUtils]: 2: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,128 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16639#true} {16639#true} #69#return; {16639#true} is VALID [2018-11-14 17:09:31,128 INFO L256 TraceCheckUtils]: 4: Hoare triple {16639#true} call #t~ret13 := main(); {16639#true} is VALID [2018-11-14 17:09:31,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {16639#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16641#(= main_~i~1 0)} is VALID [2018-11-14 17:09:31,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {16641#(= main_~i~1 0)} assume true; {16641#(= main_~i~1 0)} is VALID [2018-11-14 17:09:31,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {16641#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16641#(= main_~i~1 0)} is VALID [2018-11-14 17:09:31,130 INFO L273 TraceCheckUtils]: 8: Hoare triple {16641#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:31,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {16642#(<= main_~i~1 1)} assume true; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:31,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {16642#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16642#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:31,131 INFO L273 TraceCheckUtils]: 11: Hoare triple {16642#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:31,131 INFO L273 TraceCheckUtils]: 12: Hoare triple {16643#(<= main_~i~1 2)} assume true; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:31,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {16643#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16643#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:31,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {16643#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:31,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {16644#(<= main_~i~1 3)} assume true; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:31,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {16644#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16644#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:31,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {16644#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:31,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {16645#(<= main_~i~1 4)} assume true; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:31,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {16645#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16645#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:31,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {16645#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:31,136 INFO L273 TraceCheckUtils]: 21: Hoare triple {16646#(<= main_~i~1 5)} assume true; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:31,136 INFO L273 TraceCheckUtils]: 22: Hoare triple {16646#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16646#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:31,137 INFO L273 TraceCheckUtils]: 23: Hoare triple {16646#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:31,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {16647#(<= main_~i~1 6)} assume true; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:31,138 INFO L273 TraceCheckUtils]: 25: Hoare triple {16647#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16647#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:31,139 INFO L273 TraceCheckUtils]: 26: Hoare triple {16647#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:31,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {16648#(<= main_~i~1 7)} assume true; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:31,140 INFO L273 TraceCheckUtils]: 28: Hoare triple {16648#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16648#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:31,141 INFO L273 TraceCheckUtils]: 29: Hoare triple {16648#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:31,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {16649#(<= main_~i~1 8)} assume true; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:31,142 INFO L273 TraceCheckUtils]: 31: Hoare triple {16649#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16649#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:31,142 INFO L273 TraceCheckUtils]: 32: Hoare triple {16649#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:31,143 INFO L273 TraceCheckUtils]: 33: Hoare triple {16650#(<= main_~i~1 9)} assume true; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:31,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {16650#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16650#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:31,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {16650#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:31,145 INFO L273 TraceCheckUtils]: 36: Hoare triple {16651#(<= main_~i~1 10)} assume true; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:31,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {16651#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16651#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:31,146 INFO L273 TraceCheckUtils]: 38: Hoare triple {16651#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:31,146 INFO L273 TraceCheckUtils]: 39: Hoare triple {16652#(<= main_~i~1 11)} assume true; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:31,147 INFO L273 TraceCheckUtils]: 40: Hoare triple {16652#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16652#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:31,147 INFO L273 TraceCheckUtils]: 41: Hoare triple {16652#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:31,148 INFO L273 TraceCheckUtils]: 42: Hoare triple {16653#(<= main_~i~1 12)} assume true; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:31,148 INFO L273 TraceCheckUtils]: 43: Hoare triple {16653#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16653#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:31,149 INFO L273 TraceCheckUtils]: 44: Hoare triple {16653#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:31,150 INFO L273 TraceCheckUtils]: 45: Hoare triple {16654#(<= main_~i~1 13)} assume true; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:31,150 INFO L273 TraceCheckUtils]: 46: Hoare triple {16654#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16654#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:31,151 INFO L273 TraceCheckUtils]: 47: Hoare triple {16654#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:31,151 INFO L273 TraceCheckUtils]: 48: Hoare triple {16655#(<= main_~i~1 14)} assume true; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:31,152 INFO L273 TraceCheckUtils]: 49: Hoare triple {16655#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16655#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:31,153 INFO L273 TraceCheckUtils]: 50: Hoare triple {16655#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:31,153 INFO L273 TraceCheckUtils]: 51: Hoare triple {16656#(<= main_~i~1 15)} assume true; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:31,154 INFO L273 TraceCheckUtils]: 52: Hoare triple {16656#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16656#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:31,154 INFO L273 TraceCheckUtils]: 53: Hoare triple {16656#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:31,155 INFO L273 TraceCheckUtils]: 54: Hoare triple {16657#(<= main_~i~1 16)} assume true; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:31,155 INFO L273 TraceCheckUtils]: 55: Hoare triple {16657#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16657#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:31,156 INFO L273 TraceCheckUtils]: 56: Hoare triple {16657#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:31,157 INFO L273 TraceCheckUtils]: 57: Hoare triple {16658#(<= main_~i~1 17)} assume true; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:31,157 INFO L273 TraceCheckUtils]: 58: Hoare triple {16658#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16658#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:31,158 INFO L273 TraceCheckUtils]: 59: Hoare triple {16658#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:31,158 INFO L273 TraceCheckUtils]: 60: Hoare triple {16659#(<= main_~i~1 18)} assume true; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:31,159 INFO L273 TraceCheckUtils]: 61: Hoare triple {16659#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16659#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:31,160 INFO L273 TraceCheckUtils]: 62: Hoare triple {16659#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:31,160 INFO L273 TraceCheckUtils]: 63: Hoare triple {16660#(<= main_~i~1 19)} assume true; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:31,160 INFO L273 TraceCheckUtils]: 64: Hoare triple {16660#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16660#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:31,161 INFO L273 TraceCheckUtils]: 65: Hoare triple {16660#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:31,162 INFO L273 TraceCheckUtils]: 66: Hoare triple {16661#(<= main_~i~1 20)} assume true; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:31,162 INFO L273 TraceCheckUtils]: 67: Hoare triple {16661#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16661#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:31,163 INFO L273 TraceCheckUtils]: 68: Hoare triple {16661#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16662#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:31,163 INFO L273 TraceCheckUtils]: 69: Hoare triple {16662#(<= main_~i~1 21)} assume true; {16662#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:31,164 INFO L273 TraceCheckUtils]: 70: Hoare triple {16662#(<= main_~i~1 21)} assume !(~i~1 < 1000); {16640#false} is VALID [2018-11-14 17:09:31,164 INFO L256 TraceCheckUtils]: 71: Hoare triple {16640#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:09:31,164 INFO L273 TraceCheckUtils]: 72: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:09:31,165 INFO L273 TraceCheckUtils]: 73: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,165 INFO L273 TraceCheckUtils]: 74: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,165 INFO L273 TraceCheckUtils]: 75: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,165 INFO L273 TraceCheckUtils]: 76: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,165 INFO L273 TraceCheckUtils]: 77: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,166 INFO L273 TraceCheckUtils]: 78: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,166 INFO L273 TraceCheckUtils]: 79: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,166 INFO L273 TraceCheckUtils]: 80: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,166 INFO L273 TraceCheckUtils]: 81: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,166 INFO L273 TraceCheckUtils]: 82: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,166 INFO L273 TraceCheckUtils]: 83: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,167 INFO L273 TraceCheckUtils]: 84: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,167 INFO L273 TraceCheckUtils]: 85: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,167 INFO L273 TraceCheckUtils]: 86: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,167 INFO L273 TraceCheckUtils]: 87: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,167 INFO L273 TraceCheckUtils]: 88: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,167 INFO L273 TraceCheckUtils]: 89: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,167 INFO L273 TraceCheckUtils]: 90: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,167 INFO L273 TraceCheckUtils]: 91: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,168 INFO L273 TraceCheckUtils]: 92: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,168 INFO L273 TraceCheckUtils]: 93: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,168 INFO L273 TraceCheckUtils]: 94: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,168 INFO L273 TraceCheckUtils]: 95: Hoare triple {16639#true} assume !(~i~0 < 1000); {16639#true} is VALID [2018-11-14 17:09:31,168 INFO L273 TraceCheckUtils]: 96: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:09:31,168 INFO L273 TraceCheckUtils]: 97: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,168 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {16639#true} {16640#false} #73#return; {16640#false} is VALID [2018-11-14 17:09:31,168 INFO L273 TraceCheckUtils]: 99: Hoare triple {16640#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {16640#false} is VALID [2018-11-14 17:09:31,168 INFO L256 TraceCheckUtils]: 100: Hoare triple {16640#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:09:31,169 INFO L273 TraceCheckUtils]: 101: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:09:31,169 INFO L273 TraceCheckUtils]: 102: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,169 INFO L273 TraceCheckUtils]: 103: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,169 INFO L273 TraceCheckUtils]: 104: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,169 INFO L273 TraceCheckUtils]: 105: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,169 INFO L273 TraceCheckUtils]: 106: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,169 INFO L273 TraceCheckUtils]: 107: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,169 INFO L273 TraceCheckUtils]: 108: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,169 INFO L273 TraceCheckUtils]: 109: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 110: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 111: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 112: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 113: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 114: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 115: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 116: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 117: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 118: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,170 INFO L273 TraceCheckUtils]: 119: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,171 INFO L273 TraceCheckUtils]: 120: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,171 INFO L273 TraceCheckUtils]: 121: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,171 INFO L273 TraceCheckUtils]: 122: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,171 INFO L273 TraceCheckUtils]: 123: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,171 INFO L273 TraceCheckUtils]: 124: Hoare triple {16639#true} assume !(~i~0 < 1000); {16639#true} is VALID [2018-11-14 17:09:31,171 INFO L273 TraceCheckUtils]: 125: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:09:31,171 INFO L273 TraceCheckUtils]: 126: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,171 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {16639#true} {16640#false} #75#return; {16640#false} is VALID [2018-11-14 17:09:31,171 INFO L273 TraceCheckUtils]: 128: Hoare triple {16640#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {16640#false} is VALID [2018-11-14 17:09:31,171 INFO L273 TraceCheckUtils]: 129: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,172 INFO L273 TraceCheckUtils]: 130: Hoare triple {16640#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:09:31,172 INFO L273 TraceCheckUtils]: 131: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:09:31,172 INFO L273 TraceCheckUtils]: 132: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,172 INFO L273 TraceCheckUtils]: 133: Hoare triple {16640#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:09:31,172 INFO L273 TraceCheckUtils]: 134: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:09:31,172 INFO L273 TraceCheckUtils]: 135: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,172 INFO L273 TraceCheckUtils]: 136: Hoare triple {16640#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:09:31,172 INFO L273 TraceCheckUtils]: 137: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:09:31,172 INFO L273 TraceCheckUtils]: 138: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,173 INFO L273 TraceCheckUtils]: 139: Hoare triple {16640#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:09:31,173 INFO L273 TraceCheckUtils]: 140: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:09:31,173 INFO L273 TraceCheckUtils]: 141: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,173 INFO L273 TraceCheckUtils]: 142: Hoare triple {16640#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {16640#false} is VALID [2018-11-14 17:09:31,173 INFO L273 TraceCheckUtils]: 143: Hoare triple {16640#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {16640#false} is VALID [2018-11-14 17:09:31,173 INFO L273 TraceCheckUtils]: 144: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,174 INFO L273 TraceCheckUtils]: 145: Hoare triple {16640#false} assume !(~i~2 < 999); {16640#false} is VALID [2018-11-14 17:09:31,174 INFO L273 TraceCheckUtils]: 146: Hoare triple {16640#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {16640#false} is VALID [2018-11-14 17:09:31,174 INFO L256 TraceCheckUtils]: 147: Hoare triple {16640#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:09:31,174 INFO L273 TraceCheckUtils]: 148: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:09:31,174 INFO L273 TraceCheckUtils]: 149: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,174 INFO L273 TraceCheckUtils]: 150: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,174 INFO L273 TraceCheckUtils]: 151: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,175 INFO L273 TraceCheckUtils]: 152: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,175 INFO L273 TraceCheckUtils]: 153: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,175 INFO L273 TraceCheckUtils]: 154: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,175 INFO L273 TraceCheckUtils]: 155: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,175 INFO L273 TraceCheckUtils]: 156: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,175 INFO L273 TraceCheckUtils]: 157: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,176 INFO L273 TraceCheckUtils]: 158: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,176 INFO L273 TraceCheckUtils]: 159: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,176 INFO L273 TraceCheckUtils]: 160: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,176 INFO L273 TraceCheckUtils]: 161: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,176 INFO L273 TraceCheckUtils]: 162: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,176 INFO L273 TraceCheckUtils]: 163: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,177 INFO L273 TraceCheckUtils]: 164: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,177 INFO L273 TraceCheckUtils]: 165: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,177 INFO L273 TraceCheckUtils]: 166: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,177 INFO L273 TraceCheckUtils]: 167: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,177 INFO L273 TraceCheckUtils]: 168: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,177 INFO L273 TraceCheckUtils]: 169: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,178 INFO L273 TraceCheckUtils]: 170: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,178 INFO L273 TraceCheckUtils]: 171: Hoare triple {16639#true} assume !(~i~0 < 1000); {16639#true} is VALID [2018-11-14 17:09:31,178 INFO L273 TraceCheckUtils]: 172: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:09:31,178 INFO L273 TraceCheckUtils]: 173: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,178 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {16639#true} {16640#false} #77#return; {16640#false} is VALID [2018-11-14 17:09:31,178 INFO L273 TraceCheckUtils]: 175: Hoare triple {16640#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16640#false} is VALID [2018-11-14 17:09:31,178 INFO L273 TraceCheckUtils]: 176: Hoare triple {16640#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16640#false} is VALID [2018-11-14 17:09:31,179 INFO L273 TraceCheckUtils]: 177: Hoare triple {16640#false} assume !false; {16640#false} is VALID [2018-11-14 17:09:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 814 trivial. 0 not checked. [2018-11-14 17:09:31,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:31,198 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-14 17:09:31,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:09:31,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-14 17:09:31,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:31,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:31,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {16639#true} call ULTIMATE.init(); {16639#true} is VALID [2018-11-14 17:09:31,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {16639#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16639#true} is VALID [2018-11-14 17:09:31,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16639#true} {16639#true} #69#return; {16639#true} is VALID [2018-11-14 17:09:31,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {16639#true} call #t~ret13 := main(); {16639#true} is VALID [2018-11-14 17:09:31,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {16639#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {16639#true} is VALID [2018-11-14 17:09:31,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,699 INFO L273 TraceCheckUtils]: 10: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,700 INFO L273 TraceCheckUtils]: 13: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,700 INFO L273 TraceCheckUtils]: 14: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,700 INFO L273 TraceCheckUtils]: 16: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,701 INFO L273 TraceCheckUtils]: 18: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,701 INFO L273 TraceCheckUtils]: 19: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,701 INFO L273 TraceCheckUtils]: 20: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,701 INFO L273 TraceCheckUtils]: 21: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,701 INFO L273 TraceCheckUtils]: 24: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,701 INFO L273 TraceCheckUtils]: 25: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 26: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 27: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 28: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 29: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 30: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 31: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 32: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 34: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,702 INFO L273 TraceCheckUtils]: 35: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 36: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 37: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 38: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 39: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 40: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 41: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 42: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 43: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 44: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,703 INFO L273 TraceCheckUtils]: 45: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 46: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 47: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 48: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 49: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 50: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 53: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,704 INFO L273 TraceCheckUtils]: 55: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,705 INFO L273 TraceCheckUtils]: 56: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,705 INFO L273 TraceCheckUtils]: 57: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,705 INFO L273 TraceCheckUtils]: 58: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,705 INFO L273 TraceCheckUtils]: 59: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,705 INFO L273 TraceCheckUtils]: 60: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,705 INFO L273 TraceCheckUtils]: 61: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,705 INFO L273 TraceCheckUtils]: 62: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,705 INFO L273 TraceCheckUtils]: 63: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,705 INFO L273 TraceCheckUtils]: 64: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16639#true} is VALID [2018-11-14 17:09:31,706 INFO L273 TraceCheckUtils]: 65: Hoare triple {16639#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16639#true} is VALID [2018-11-14 17:09:31,706 INFO L273 TraceCheckUtils]: 66: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,706 INFO L273 TraceCheckUtils]: 67: Hoare triple {16639#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {16867#(< main_~i~1 1000)} is VALID [2018-11-14 17:09:31,707 INFO L273 TraceCheckUtils]: 68: Hoare triple {16867#(< main_~i~1 1000)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {16871#(<= main_~i~1 1000)} is VALID [2018-11-14 17:09:31,707 INFO L273 TraceCheckUtils]: 69: Hoare triple {16871#(<= main_~i~1 1000)} assume true; {16871#(<= main_~i~1 1000)} is VALID [2018-11-14 17:09:31,707 INFO L273 TraceCheckUtils]: 70: Hoare triple {16871#(<= main_~i~1 1000)} assume !(~i~1 < 1000); {16639#true} is VALID [2018-11-14 17:09:31,707 INFO L256 TraceCheckUtils]: 71: Hoare triple {16639#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:09:31,707 INFO L273 TraceCheckUtils]: 72: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:09:31,708 INFO L273 TraceCheckUtils]: 73: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,708 INFO L273 TraceCheckUtils]: 74: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,708 INFO L273 TraceCheckUtils]: 75: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,708 INFO L273 TraceCheckUtils]: 76: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,708 INFO L273 TraceCheckUtils]: 77: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,708 INFO L273 TraceCheckUtils]: 78: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,708 INFO L273 TraceCheckUtils]: 79: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,708 INFO L273 TraceCheckUtils]: 80: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,708 INFO L273 TraceCheckUtils]: 81: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 82: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 83: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 84: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 85: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 86: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 87: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 88: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 89: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 90: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,709 INFO L273 TraceCheckUtils]: 91: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L273 TraceCheckUtils]: 92: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L273 TraceCheckUtils]: 93: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L273 TraceCheckUtils]: 94: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L273 TraceCheckUtils]: 95: Hoare triple {16639#true} assume !(~i~0 < 1000); {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L273 TraceCheckUtils]: 96: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L273 TraceCheckUtils]: 97: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L268 TraceCheckUtils]: 98: Hoare quadruple {16639#true} {16639#true} #73#return; {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L273 TraceCheckUtils]: 99: Hoare triple {16639#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L256 TraceCheckUtils]: 100: Hoare triple {16639#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {16639#true} is VALID [2018-11-14 17:09:31,710 INFO L273 TraceCheckUtils]: 101: Hoare triple {16639#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16639#true} is VALID [2018-11-14 17:09:31,711 INFO L273 TraceCheckUtils]: 102: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,711 INFO L273 TraceCheckUtils]: 103: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,711 INFO L273 TraceCheckUtils]: 104: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,711 INFO L273 TraceCheckUtils]: 105: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,711 INFO L273 TraceCheckUtils]: 106: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,711 INFO L273 TraceCheckUtils]: 107: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,711 INFO L273 TraceCheckUtils]: 108: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,711 INFO L273 TraceCheckUtils]: 109: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,711 INFO L273 TraceCheckUtils]: 110: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,712 INFO L273 TraceCheckUtils]: 111: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,712 INFO L273 TraceCheckUtils]: 112: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,712 INFO L273 TraceCheckUtils]: 113: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,712 INFO L273 TraceCheckUtils]: 114: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,712 INFO L273 TraceCheckUtils]: 115: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,712 INFO L273 TraceCheckUtils]: 116: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,712 INFO L273 TraceCheckUtils]: 117: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,712 INFO L273 TraceCheckUtils]: 118: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,713 INFO L273 TraceCheckUtils]: 119: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,713 INFO L273 TraceCheckUtils]: 120: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,713 INFO L273 TraceCheckUtils]: 121: Hoare triple {16639#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16639#true} is VALID [2018-11-14 17:09:31,713 INFO L273 TraceCheckUtils]: 122: Hoare triple {16639#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16639#true} is VALID [2018-11-14 17:09:31,713 INFO L273 TraceCheckUtils]: 123: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,713 INFO L273 TraceCheckUtils]: 124: Hoare triple {16639#true} assume !(~i~0 < 1000); {16639#true} is VALID [2018-11-14 17:09:31,713 INFO L273 TraceCheckUtils]: 125: Hoare triple {16639#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16639#true} is VALID [2018-11-14 17:09:31,713 INFO L273 TraceCheckUtils]: 126: Hoare triple {16639#true} assume true; {16639#true} is VALID [2018-11-14 17:09:31,714 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {16639#true} {16639#true} #75#return; {16639#true} is VALID [2018-11-14 17:09:31,714 INFO L273 TraceCheckUtils]: 128: Hoare triple {16639#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17052#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:31,714 INFO L273 TraceCheckUtils]: 129: Hoare triple {17052#(<= main_~i~2 0)} assume true; {17052#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:31,715 INFO L273 TraceCheckUtils]: 130: Hoare triple {17052#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17052#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:31,715 INFO L273 TraceCheckUtils]: 131: Hoare triple {17052#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17062#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:31,715 INFO L273 TraceCheckUtils]: 132: Hoare triple {17062#(<= main_~i~2 1)} assume true; {17062#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:31,716 INFO L273 TraceCheckUtils]: 133: Hoare triple {17062#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17062#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:31,716 INFO L273 TraceCheckUtils]: 134: Hoare triple {17062#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17072#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:31,717 INFO L273 TraceCheckUtils]: 135: Hoare triple {17072#(<= main_~i~2 2)} assume true; {17072#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:31,717 INFO L273 TraceCheckUtils]: 136: Hoare triple {17072#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17072#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:31,717 INFO L273 TraceCheckUtils]: 137: Hoare triple {17072#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17082#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:31,718 INFO L273 TraceCheckUtils]: 138: Hoare triple {17082#(<= main_~i~2 3)} assume true; {17082#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:31,718 INFO L273 TraceCheckUtils]: 139: Hoare triple {17082#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17082#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:31,718 INFO L273 TraceCheckUtils]: 140: Hoare triple {17082#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17092#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:31,719 INFO L273 TraceCheckUtils]: 141: Hoare triple {17092#(<= main_~i~2 4)} assume true; {17092#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:31,719 INFO L273 TraceCheckUtils]: 142: Hoare triple {17092#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17092#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:31,720 INFO L273 TraceCheckUtils]: 143: Hoare triple {17092#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17102#(<= main_~i~2 5)} is VALID [2018-11-14 17:09:31,721 INFO L273 TraceCheckUtils]: 144: Hoare triple {17102#(<= main_~i~2 5)} assume true; {17102#(<= main_~i~2 5)} is VALID [2018-11-14 17:09:31,721 INFO L273 TraceCheckUtils]: 145: Hoare triple {17102#(<= main_~i~2 5)} assume !(~i~2 < 999); {16640#false} is VALID [2018-11-14 17:09:31,722 INFO L273 TraceCheckUtils]: 146: Hoare triple {16640#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {16640#false} is VALID [2018-11-14 17:09:31,722 INFO L256 TraceCheckUtils]: 147: Hoare triple {16640#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {16640#false} is VALID [2018-11-14 17:09:31,722 INFO L273 TraceCheckUtils]: 148: Hoare triple {16640#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {16640#false} is VALID [2018-11-14 17:09:31,722 INFO L273 TraceCheckUtils]: 149: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,722 INFO L273 TraceCheckUtils]: 150: Hoare triple {16640#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:09:31,722 INFO L273 TraceCheckUtils]: 151: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:09:31,723 INFO L273 TraceCheckUtils]: 152: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,723 INFO L273 TraceCheckUtils]: 153: Hoare triple {16640#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:09:31,723 INFO L273 TraceCheckUtils]: 154: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:09:31,723 INFO L273 TraceCheckUtils]: 155: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,723 INFO L273 TraceCheckUtils]: 156: Hoare triple {16640#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:09:31,724 INFO L273 TraceCheckUtils]: 157: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:09:31,724 INFO L273 TraceCheckUtils]: 158: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,724 INFO L273 TraceCheckUtils]: 159: Hoare triple {16640#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:09:31,724 INFO L273 TraceCheckUtils]: 160: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:09:31,724 INFO L273 TraceCheckUtils]: 161: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,724 INFO L273 TraceCheckUtils]: 162: Hoare triple {16640#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:09:31,725 INFO L273 TraceCheckUtils]: 163: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:09:31,725 INFO L273 TraceCheckUtils]: 164: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,725 INFO L273 TraceCheckUtils]: 165: Hoare triple {16640#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:09:31,725 INFO L273 TraceCheckUtils]: 166: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:09:31,725 INFO L273 TraceCheckUtils]: 167: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,726 INFO L273 TraceCheckUtils]: 168: Hoare triple {16640#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {16640#false} is VALID [2018-11-14 17:09:31,726 INFO L273 TraceCheckUtils]: 169: Hoare triple {16640#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {16640#false} is VALID [2018-11-14 17:09:31,726 INFO L273 TraceCheckUtils]: 170: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,726 INFO L273 TraceCheckUtils]: 171: Hoare triple {16640#false} assume !(~i~0 < 1000); {16640#false} is VALID [2018-11-14 17:09:31,726 INFO L273 TraceCheckUtils]: 172: Hoare triple {16640#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {16640#false} is VALID [2018-11-14 17:09:31,726 INFO L273 TraceCheckUtils]: 173: Hoare triple {16640#false} assume true; {16640#false} is VALID [2018-11-14 17:09:31,726 INFO L268 TraceCheckUtils]: 174: Hoare quadruple {16640#false} {16640#false} #77#return; {16640#false} is VALID [2018-11-14 17:09:31,726 INFO L273 TraceCheckUtils]: 175: Hoare triple {16640#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {16640#false} is VALID [2018-11-14 17:09:31,727 INFO L273 TraceCheckUtils]: 176: Hoare triple {16640#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {16640#false} is VALID [2018-11-14 17:09:31,727 INFO L273 TraceCheckUtils]: 177: Hoare triple {16640#false} assume !false; {16640#false} is VALID [2018-11-14 17:09:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1486 backedges. 424 proven. 40 refuted. 0 times theorem prover too weak. 1022 trivial. 0 not checked. [2018-11-14 17:09:31,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:31,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 32 [2018-11-14 17:09:31,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 178 [2018-11-14 17:09:31,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:31,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 17:09:31,902 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-14 17:09:31,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 17:09:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 17:09:31,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=640, Unknown=0, NotChecked=0, Total=992 [2018-11-14 17:09:31,904 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 32 states. [2018-11-14 17:09:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:34,302 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-11-14 17:09:34,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 17:09:34,302 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 178 [2018-11-14 17:09:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:09:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 145 transitions. [2018-11-14 17:09:34,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 17:09:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 145 transitions. [2018-11-14 17:09:34,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 145 transitions. [2018-11-14 17:09:34,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:34,460 INFO L225 Difference]: With dead ends: 189 [2018-11-14 17:09:34,461 INFO L226 Difference]: Without dead ends: 135 [2018-11-14 17:09:34,462 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=1000, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:09:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-14 17:09:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-11-14 17:09:34,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:34,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand 134 states. [2018-11-14 17:09:34,516 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand 134 states. [2018-11-14 17:09:34,516 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 134 states. [2018-11-14 17:09:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:34,518 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-14 17:09:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-14 17:09:34,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:34,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:34,519 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 135 states. [2018-11-14 17:09:34,519 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 135 states. [2018-11-14 17:09:34,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:34,521 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-11-14 17:09:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2018-11-14 17:09:34,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:34,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:34,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:34,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 17:09:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-11-14 17:09:34,524 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 178 [2018-11-14 17:09:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:34,525 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-11-14 17:09:34,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 17:09:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-11-14 17:09:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-14 17:09:34,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:34,526 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 21, 21, 7, 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-14 17:09:34,527 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:34,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1172928385, now seen corresponding path program 22 times [2018-11-14 17:09:34,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:34,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:34,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:34,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:34,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:35,179 INFO L256 TraceCheckUtils]: 0: Hoare triple {17921#true} call ULTIMATE.init(); {17921#true} is VALID [2018-11-14 17:09:35,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {17921#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17921#true} is VALID [2018-11-14 17:09:35,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17921#true} {17921#true} #69#return; {17921#true} is VALID [2018-11-14 17:09:35,180 INFO L256 TraceCheckUtils]: 4: Hoare triple {17921#true} call #t~ret13 := main(); {17921#true} is VALID [2018-11-14 17:09:35,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {17921#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17923#(= main_~i~1 0)} is VALID [2018-11-14 17:09:35,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {17923#(= main_~i~1 0)} assume true; {17923#(= main_~i~1 0)} is VALID [2018-11-14 17:09:35,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {17923#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17923#(= main_~i~1 0)} is VALID [2018-11-14 17:09:35,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {17923#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17924#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:35,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {17924#(<= main_~i~1 1)} assume true; {17924#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:35,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {17924#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17924#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:35,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {17924#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17925#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:35,185 INFO L273 TraceCheckUtils]: 12: Hoare triple {17925#(<= main_~i~1 2)} assume true; {17925#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:35,185 INFO L273 TraceCheckUtils]: 13: Hoare triple {17925#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17925#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:35,186 INFO L273 TraceCheckUtils]: 14: Hoare triple {17925#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17926#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:35,186 INFO L273 TraceCheckUtils]: 15: Hoare triple {17926#(<= main_~i~1 3)} assume true; {17926#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:35,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {17926#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17926#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:35,188 INFO L273 TraceCheckUtils]: 17: Hoare triple {17926#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17927#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:35,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {17927#(<= main_~i~1 4)} assume true; {17927#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:35,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {17927#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17927#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:35,189 INFO L273 TraceCheckUtils]: 20: Hoare triple {17927#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17928#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:35,190 INFO L273 TraceCheckUtils]: 21: Hoare triple {17928#(<= main_~i~1 5)} assume true; {17928#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:35,190 INFO L273 TraceCheckUtils]: 22: Hoare triple {17928#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17928#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:35,191 INFO L273 TraceCheckUtils]: 23: Hoare triple {17928#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17929#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:35,192 INFO L273 TraceCheckUtils]: 24: Hoare triple {17929#(<= main_~i~1 6)} assume true; {17929#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:35,192 INFO L273 TraceCheckUtils]: 25: Hoare triple {17929#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17929#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:35,193 INFO L273 TraceCheckUtils]: 26: Hoare triple {17929#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17930#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:35,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {17930#(<= main_~i~1 7)} assume true; {17930#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:35,194 INFO L273 TraceCheckUtils]: 28: Hoare triple {17930#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17930#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:35,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {17930#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17931#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:35,195 INFO L273 TraceCheckUtils]: 30: Hoare triple {17931#(<= main_~i~1 8)} assume true; {17931#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:35,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {17931#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17931#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:35,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {17931#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17932#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:35,197 INFO L273 TraceCheckUtils]: 33: Hoare triple {17932#(<= main_~i~1 9)} assume true; {17932#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:35,197 INFO L273 TraceCheckUtils]: 34: Hoare triple {17932#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17932#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:35,198 INFO L273 TraceCheckUtils]: 35: Hoare triple {17932#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17933#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:35,199 INFO L273 TraceCheckUtils]: 36: Hoare triple {17933#(<= main_~i~1 10)} assume true; {17933#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:35,199 INFO L273 TraceCheckUtils]: 37: Hoare triple {17933#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17933#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:35,200 INFO L273 TraceCheckUtils]: 38: Hoare triple {17933#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17934#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:35,200 INFO L273 TraceCheckUtils]: 39: Hoare triple {17934#(<= main_~i~1 11)} assume true; {17934#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:35,201 INFO L273 TraceCheckUtils]: 40: Hoare triple {17934#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17934#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:35,202 INFO L273 TraceCheckUtils]: 41: Hoare triple {17934#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17935#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:35,202 INFO L273 TraceCheckUtils]: 42: Hoare triple {17935#(<= main_~i~1 12)} assume true; {17935#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:35,203 INFO L273 TraceCheckUtils]: 43: Hoare triple {17935#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17935#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:35,203 INFO L273 TraceCheckUtils]: 44: Hoare triple {17935#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17936#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:35,204 INFO L273 TraceCheckUtils]: 45: Hoare triple {17936#(<= main_~i~1 13)} assume true; {17936#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:35,204 INFO L273 TraceCheckUtils]: 46: Hoare triple {17936#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17936#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:35,205 INFO L273 TraceCheckUtils]: 47: Hoare triple {17936#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17937#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:35,206 INFO L273 TraceCheckUtils]: 48: Hoare triple {17937#(<= main_~i~1 14)} assume true; {17937#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:35,206 INFO L273 TraceCheckUtils]: 49: Hoare triple {17937#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17937#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:35,207 INFO L273 TraceCheckUtils]: 50: Hoare triple {17937#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17938#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:35,207 INFO L273 TraceCheckUtils]: 51: Hoare triple {17938#(<= main_~i~1 15)} assume true; {17938#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:35,208 INFO L273 TraceCheckUtils]: 52: Hoare triple {17938#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17938#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:35,208 INFO L273 TraceCheckUtils]: 53: Hoare triple {17938#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17939#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:35,209 INFO L273 TraceCheckUtils]: 54: Hoare triple {17939#(<= main_~i~1 16)} assume true; {17939#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:35,209 INFO L273 TraceCheckUtils]: 55: Hoare triple {17939#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17939#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:35,210 INFO L273 TraceCheckUtils]: 56: Hoare triple {17939#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17940#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:35,211 INFO L273 TraceCheckUtils]: 57: Hoare triple {17940#(<= main_~i~1 17)} assume true; {17940#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:35,211 INFO L273 TraceCheckUtils]: 58: Hoare triple {17940#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17940#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:35,212 INFO L273 TraceCheckUtils]: 59: Hoare triple {17940#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17941#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:35,212 INFO L273 TraceCheckUtils]: 60: Hoare triple {17941#(<= main_~i~1 18)} assume true; {17941#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:35,213 INFO L273 TraceCheckUtils]: 61: Hoare triple {17941#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17941#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:35,214 INFO L273 TraceCheckUtils]: 62: Hoare triple {17941#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17942#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:35,214 INFO L273 TraceCheckUtils]: 63: Hoare triple {17942#(<= main_~i~1 19)} assume true; {17942#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:35,215 INFO L273 TraceCheckUtils]: 64: Hoare triple {17942#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17942#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:35,215 INFO L273 TraceCheckUtils]: 65: Hoare triple {17942#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17943#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:35,216 INFO L273 TraceCheckUtils]: 66: Hoare triple {17943#(<= main_~i~1 20)} assume true; {17943#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:35,216 INFO L273 TraceCheckUtils]: 67: Hoare triple {17943#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17943#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:35,217 INFO L273 TraceCheckUtils]: 68: Hoare triple {17943#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17944#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:35,218 INFO L273 TraceCheckUtils]: 69: Hoare triple {17944#(<= main_~i~1 21)} assume true; {17944#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:35,218 INFO L273 TraceCheckUtils]: 70: Hoare triple {17944#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17944#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:35,219 INFO L273 TraceCheckUtils]: 71: Hoare triple {17944#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17945#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:35,219 INFO L273 TraceCheckUtils]: 72: Hoare triple {17945#(<= main_~i~1 22)} assume true; {17945#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:35,220 INFO L273 TraceCheckUtils]: 73: Hoare triple {17945#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17945#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:35,221 INFO L273 TraceCheckUtils]: 74: Hoare triple {17945#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17946#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:35,221 INFO L273 TraceCheckUtils]: 75: Hoare triple {17946#(<= main_~i~1 23)} assume true; {17946#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:35,222 INFO L273 TraceCheckUtils]: 76: Hoare triple {17946#(<= main_~i~1 23)} assume !(~i~1 < 1000); {17922#false} is VALID [2018-11-14 17:09:35,222 INFO L256 TraceCheckUtils]: 77: Hoare triple {17922#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {17921#true} is VALID [2018-11-14 17:09:35,222 INFO L273 TraceCheckUtils]: 78: Hoare triple {17921#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17921#true} is VALID [2018-11-14 17:09:35,222 INFO L273 TraceCheckUtils]: 79: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,223 INFO L273 TraceCheckUtils]: 80: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,223 INFO L273 TraceCheckUtils]: 81: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,223 INFO L273 TraceCheckUtils]: 82: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,223 INFO L273 TraceCheckUtils]: 83: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,223 INFO L273 TraceCheckUtils]: 84: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,223 INFO L273 TraceCheckUtils]: 85: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,224 INFO L273 TraceCheckUtils]: 86: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,224 INFO L273 TraceCheckUtils]: 87: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,224 INFO L273 TraceCheckUtils]: 88: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,224 INFO L273 TraceCheckUtils]: 89: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,224 INFO L273 TraceCheckUtils]: 90: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,225 INFO L273 TraceCheckUtils]: 91: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,225 INFO L273 TraceCheckUtils]: 92: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,225 INFO L273 TraceCheckUtils]: 93: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,225 INFO L273 TraceCheckUtils]: 94: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,225 INFO L273 TraceCheckUtils]: 95: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,225 INFO L273 TraceCheckUtils]: 96: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,226 INFO L273 TraceCheckUtils]: 97: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,226 INFO L273 TraceCheckUtils]: 98: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,226 INFO L273 TraceCheckUtils]: 99: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,226 INFO L273 TraceCheckUtils]: 100: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,226 INFO L273 TraceCheckUtils]: 101: Hoare triple {17921#true} assume !(~i~0 < 1000); {17921#true} is VALID [2018-11-14 17:09:35,227 INFO L273 TraceCheckUtils]: 102: Hoare triple {17921#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17921#true} is VALID [2018-11-14 17:09:35,227 INFO L273 TraceCheckUtils]: 103: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,227 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {17921#true} {17922#false} #73#return; {17922#false} is VALID [2018-11-14 17:09:35,227 INFO L273 TraceCheckUtils]: 105: Hoare triple {17922#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {17922#false} is VALID [2018-11-14 17:09:35,227 INFO L256 TraceCheckUtils]: 106: Hoare triple {17922#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {17921#true} is VALID [2018-11-14 17:09:35,227 INFO L273 TraceCheckUtils]: 107: Hoare triple {17921#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17921#true} is VALID [2018-11-14 17:09:35,227 INFO L273 TraceCheckUtils]: 108: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,227 INFO L273 TraceCheckUtils]: 109: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,227 INFO L273 TraceCheckUtils]: 110: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,227 INFO L273 TraceCheckUtils]: 111: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,228 INFO L273 TraceCheckUtils]: 112: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,228 INFO L273 TraceCheckUtils]: 113: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,228 INFO L273 TraceCheckUtils]: 114: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,228 INFO L273 TraceCheckUtils]: 115: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,228 INFO L273 TraceCheckUtils]: 116: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,228 INFO L273 TraceCheckUtils]: 117: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,228 INFO L273 TraceCheckUtils]: 118: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,228 INFO L273 TraceCheckUtils]: 119: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,228 INFO L273 TraceCheckUtils]: 120: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 121: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 122: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 123: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 124: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 125: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 126: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 127: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 128: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 129: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,229 INFO L273 TraceCheckUtils]: 130: Hoare triple {17921#true} assume !(~i~0 < 1000); {17921#true} is VALID [2018-11-14 17:09:35,230 INFO L273 TraceCheckUtils]: 131: Hoare triple {17921#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17921#true} is VALID [2018-11-14 17:09:35,230 INFO L273 TraceCheckUtils]: 132: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,230 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {17921#true} {17922#false} #75#return; {17922#false} is VALID [2018-11-14 17:09:35,230 INFO L273 TraceCheckUtils]: 134: Hoare triple {17922#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17922#false} is VALID [2018-11-14 17:09:35,230 INFO L273 TraceCheckUtils]: 135: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,230 INFO L273 TraceCheckUtils]: 136: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,230 INFO L273 TraceCheckUtils]: 137: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,230 INFO L273 TraceCheckUtils]: 138: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,230 INFO L273 TraceCheckUtils]: 139: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 140: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 141: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 142: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 143: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 144: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 145: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 146: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 147: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 148: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,231 INFO L273 TraceCheckUtils]: 149: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,232 INFO L273 TraceCheckUtils]: 150: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,232 INFO L273 TraceCheckUtils]: 151: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,232 INFO L273 TraceCheckUtils]: 152: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,232 INFO L273 TraceCheckUtils]: 153: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,232 INFO L273 TraceCheckUtils]: 154: Hoare triple {17922#false} assume !(~i~2 < 999); {17922#false} is VALID [2018-11-14 17:09:35,232 INFO L273 TraceCheckUtils]: 155: Hoare triple {17922#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {17922#false} is VALID [2018-11-14 17:09:35,232 INFO L256 TraceCheckUtils]: 156: Hoare triple {17922#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {17921#true} is VALID [2018-11-14 17:09:35,232 INFO L273 TraceCheckUtils]: 157: Hoare triple {17921#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17921#true} is VALID [2018-11-14 17:09:35,232 INFO L273 TraceCheckUtils]: 158: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,232 INFO L273 TraceCheckUtils]: 159: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,233 INFO L273 TraceCheckUtils]: 160: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,233 INFO L273 TraceCheckUtils]: 161: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,233 INFO L273 TraceCheckUtils]: 162: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,233 INFO L273 TraceCheckUtils]: 163: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,233 INFO L273 TraceCheckUtils]: 164: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,233 INFO L273 TraceCheckUtils]: 165: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,233 INFO L273 TraceCheckUtils]: 166: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,233 INFO L273 TraceCheckUtils]: 167: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,233 INFO L273 TraceCheckUtils]: 168: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 169: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 170: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 171: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 172: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 173: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 174: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 175: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 176: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 177: Hoare triple {17921#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17921#true} is VALID [2018-11-14 17:09:35,234 INFO L273 TraceCheckUtils]: 178: Hoare triple {17921#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17921#true} is VALID [2018-11-14 17:09:35,235 INFO L273 TraceCheckUtils]: 179: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,235 INFO L273 TraceCheckUtils]: 180: Hoare triple {17921#true} assume !(~i~0 < 1000); {17921#true} is VALID [2018-11-14 17:09:35,235 INFO L273 TraceCheckUtils]: 181: Hoare triple {17921#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17921#true} is VALID [2018-11-14 17:09:35,235 INFO L273 TraceCheckUtils]: 182: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,235 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {17921#true} {17922#false} #77#return; {17922#false} is VALID [2018-11-14 17:09:35,235 INFO L273 TraceCheckUtils]: 184: Hoare triple {17922#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17922#false} is VALID [2018-11-14 17:09:35,235 INFO L273 TraceCheckUtils]: 185: Hoare triple {17922#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17922#false} is VALID [2018-11-14 17:09:35,235 INFO L273 TraceCheckUtils]: 186: Hoare triple {17922#false} assume !false; {17922#false} is VALID [2018-11-14 17:09:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 17:09:35,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:35,251 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-14 17:09:35,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:09:35,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:09:35,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:35,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:35,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {17921#true} call ULTIMATE.init(); {17921#true} is VALID [2018-11-14 17:09:35,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {17921#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17921#true} is VALID [2018-11-14 17:09:35,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {17921#true} assume true; {17921#true} is VALID [2018-11-14 17:09:35,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17921#true} {17921#true} #69#return; {17921#true} is VALID [2018-11-14 17:09:35,673 INFO L256 TraceCheckUtils]: 4: Hoare triple {17921#true} call #t~ret13 := main(); {17921#true} is VALID [2018-11-14 17:09:35,674 INFO L273 TraceCheckUtils]: 5: Hoare triple {17921#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {17965#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:35,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {17965#(<= main_~i~1 0)} assume true; {17965#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:35,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {17965#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17965#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:35,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {17965#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17924#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:35,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {17924#(<= main_~i~1 1)} assume true; {17924#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:35,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {17924#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17924#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:35,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {17924#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17925#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:35,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {17925#(<= main_~i~1 2)} assume true; {17925#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:35,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {17925#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17925#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:35,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {17925#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17926#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:35,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {17926#(<= main_~i~1 3)} assume true; {17926#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:35,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {17926#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17926#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:35,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {17926#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17927#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:35,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {17927#(<= main_~i~1 4)} assume true; {17927#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:35,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {17927#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17927#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:35,682 INFO L273 TraceCheckUtils]: 20: Hoare triple {17927#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17928#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:35,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {17928#(<= main_~i~1 5)} assume true; {17928#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:35,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {17928#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17928#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:35,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {17928#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17929#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:35,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {17929#(<= main_~i~1 6)} assume true; {17929#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:35,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {17929#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17929#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:35,717 INFO L273 TraceCheckUtils]: 26: Hoare triple {17929#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17930#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:35,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {17930#(<= main_~i~1 7)} assume true; {17930#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:35,717 INFO L273 TraceCheckUtils]: 28: Hoare triple {17930#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17930#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:35,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {17930#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17931#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:35,718 INFO L273 TraceCheckUtils]: 30: Hoare triple {17931#(<= main_~i~1 8)} assume true; {17931#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:35,718 INFO L273 TraceCheckUtils]: 31: Hoare triple {17931#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17931#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:35,719 INFO L273 TraceCheckUtils]: 32: Hoare triple {17931#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17932#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:35,719 INFO L273 TraceCheckUtils]: 33: Hoare triple {17932#(<= main_~i~1 9)} assume true; {17932#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:35,719 INFO L273 TraceCheckUtils]: 34: Hoare triple {17932#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17932#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:35,720 INFO L273 TraceCheckUtils]: 35: Hoare triple {17932#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17933#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:35,720 INFO L273 TraceCheckUtils]: 36: Hoare triple {17933#(<= main_~i~1 10)} assume true; {17933#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:35,720 INFO L273 TraceCheckUtils]: 37: Hoare triple {17933#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17933#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:35,721 INFO L273 TraceCheckUtils]: 38: Hoare triple {17933#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17934#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:35,722 INFO L273 TraceCheckUtils]: 39: Hoare triple {17934#(<= main_~i~1 11)} assume true; {17934#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:35,722 INFO L273 TraceCheckUtils]: 40: Hoare triple {17934#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17934#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:35,723 INFO L273 TraceCheckUtils]: 41: Hoare triple {17934#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17935#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:35,723 INFO L273 TraceCheckUtils]: 42: Hoare triple {17935#(<= main_~i~1 12)} assume true; {17935#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:35,724 INFO L273 TraceCheckUtils]: 43: Hoare triple {17935#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17935#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:35,724 INFO L273 TraceCheckUtils]: 44: Hoare triple {17935#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17936#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:35,725 INFO L273 TraceCheckUtils]: 45: Hoare triple {17936#(<= main_~i~1 13)} assume true; {17936#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:35,726 INFO L273 TraceCheckUtils]: 46: Hoare triple {17936#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17936#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:35,726 INFO L273 TraceCheckUtils]: 47: Hoare triple {17936#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17937#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:35,727 INFO L273 TraceCheckUtils]: 48: Hoare triple {17937#(<= main_~i~1 14)} assume true; {17937#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:35,727 INFO L273 TraceCheckUtils]: 49: Hoare triple {17937#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17937#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:35,728 INFO L273 TraceCheckUtils]: 50: Hoare triple {17937#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17938#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:35,729 INFO L273 TraceCheckUtils]: 51: Hoare triple {17938#(<= main_~i~1 15)} assume true; {17938#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:35,729 INFO L273 TraceCheckUtils]: 52: Hoare triple {17938#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17938#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:35,730 INFO L273 TraceCheckUtils]: 53: Hoare triple {17938#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17939#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:35,730 INFO L273 TraceCheckUtils]: 54: Hoare triple {17939#(<= main_~i~1 16)} assume true; {17939#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:35,731 INFO L273 TraceCheckUtils]: 55: Hoare triple {17939#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17939#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:35,732 INFO L273 TraceCheckUtils]: 56: Hoare triple {17939#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17940#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:35,732 INFO L273 TraceCheckUtils]: 57: Hoare triple {17940#(<= main_~i~1 17)} assume true; {17940#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:35,733 INFO L273 TraceCheckUtils]: 58: Hoare triple {17940#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17940#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:35,733 INFO L273 TraceCheckUtils]: 59: Hoare triple {17940#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17941#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:35,734 INFO L273 TraceCheckUtils]: 60: Hoare triple {17941#(<= main_~i~1 18)} assume true; {17941#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:35,734 INFO L273 TraceCheckUtils]: 61: Hoare triple {17941#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17941#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:35,735 INFO L273 TraceCheckUtils]: 62: Hoare triple {17941#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17942#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:35,736 INFO L273 TraceCheckUtils]: 63: Hoare triple {17942#(<= main_~i~1 19)} assume true; {17942#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:35,736 INFO L273 TraceCheckUtils]: 64: Hoare triple {17942#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17942#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:35,737 INFO L273 TraceCheckUtils]: 65: Hoare triple {17942#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17943#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:35,737 INFO L273 TraceCheckUtils]: 66: Hoare triple {17943#(<= main_~i~1 20)} assume true; {17943#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:35,738 INFO L273 TraceCheckUtils]: 67: Hoare triple {17943#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17943#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:35,739 INFO L273 TraceCheckUtils]: 68: Hoare triple {17943#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17944#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:35,739 INFO L273 TraceCheckUtils]: 69: Hoare triple {17944#(<= main_~i~1 21)} assume true; {17944#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:35,740 INFO L273 TraceCheckUtils]: 70: Hoare triple {17944#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17944#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:35,740 INFO L273 TraceCheckUtils]: 71: Hoare triple {17944#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17945#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:35,741 INFO L273 TraceCheckUtils]: 72: Hoare triple {17945#(<= main_~i~1 22)} assume true; {17945#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:35,741 INFO L273 TraceCheckUtils]: 73: Hoare triple {17945#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {17945#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:35,742 INFO L273 TraceCheckUtils]: 74: Hoare triple {17945#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {17946#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:35,743 INFO L273 TraceCheckUtils]: 75: Hoare triple {17946#(<= main_~i~1 23)} assume true; {17946#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:35,743 INFO L273 TraceCheckUtils]: 76: Hoare triple {17946#(<= main_~i~1 23)} assume !(~i~1 < 1000); {17922#false} is VALID [2018-11-14 17:09:35,743 INFO L256 TraceCheckUtils]: 77: Hoare triple {17922#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {17922#false} is VALID [2018-11-14 17:09:35,744 INFO L273 TraceCheckUtils]: 78: Hoare triple {17922#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17922#false} is VALID [2018-11-14 17:09:35,744 INFO L273 TraceCheckUtils]: 79: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,744 INFO L273 TraceCheckUtils]: 80: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,744 INFO L273 TraceCheckUtils]: 81: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,744 INFO L273 TraceCheckUtils]: 82: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,745 INFO L273 TraceCheckUtils]: 83: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,745 INFO L273 TraceCheckUtils]: 84: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,745 INFO L273 TraceCheckUtils]: 85: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,745 INFO L273 TraceCheckUtils]: 86: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,745 INFO L273 TraceCheckUtils]: 87: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,745 INFO L273 TraceCheckUtils]: 88: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,746 INFO L273 TraceCheckUtils]: 89: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,746 INFO L273 TraceCheckUtils]: 90: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,746 INFO L273 TraceCheckUtils]: 91: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,746 INFO L273 TraceCheckUtils]: 92: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,746 INFO L273 TraceCheckUtils]: 93: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,746 INFO L273 TraceCheckUtils]: 94: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,746 INFO L273 TraceCheckUtils]: 95: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,746 INFO L273 TraceCheckUtils]: 96: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,746 INFO L273 TraceCheckUtils]: 97: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L273 TraceCheckUtils]: 98: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L273 TraceCheckUtils]: 99: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L273 TraceCheckUtils]: 100: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L273 TraceCheckUtils]: 101: Hoare triple {17922#false} assume !(~i~0 < 1000); {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L273 TraceCheckUtils]: 102: Hoare triple {17922#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L273 TraceCheckUtils]: 103: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L268 TraceCheckUtils]: 104: Hoare quadruple {17922#false} {17922#false} #73#return; {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L273 TraceCheckUtils]: 105: Hoare triple {17922#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L256 TraceCheckUtils]: 106: Hoare triple {17922#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {17922#false} is VALID [2018-11-14 17:09:35,747 INFO L273 TraceCheckUtils]: 107: Hoare triple {17922#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 108: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 109: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 110: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 111: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 112: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 113: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 114: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 115: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 116: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,748 INFO L273 TraceCheckUtils]: 117: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,749 INFO L273 TraceCheckUtils]: 118: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,749 INFO L273 TraceCheckUtils]: 119: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,749 INFO L273 TraceCheckUtils]: 120: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,749 INFO L273 TraceCheckUtils]: 121: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,749 INFO L273 TraceCheckUtils]: 122: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,749 INFO L273 TraceCheckUtils]: 123: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,749 INFO L273 TraceCheckUtils]: 124: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,749 INFO L273 TraceCheckUtils]: 125: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,749 INFO L273 TraceCheckUtils]: 126: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L273 TraceCheckUtils]: 127: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L273 TraceCheckUtils]: 128: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L273 TraceCheckUtils]: 129: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L273 TraceCheckUtils]: 130: Hoare triple {17922#false} assume !(~i~0 < 1000); {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L273 TraceCheckUtils]: 131: Hoare triple {17922#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L273 TraceCheckUtils]: 132: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L268 TraceCheckUtils]: 133: Hoare quadruple {17922#false} {17922#false} #75#return; {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L273 TraceCheckUtils]: 134: Hoare triple {17922#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L273 TraceCheckUtils]: 135: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,750 INFO L273 TraceCheckUtils]: 136: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 137: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 138: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 139: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 140: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 141: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 142: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 143: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 144: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 145: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,751 INFO L273 TraceCheckUtils]: 146: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,752 INFO L273 TraceCheckUtils]: 147: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,752 INFO L273 TraceCheckUtils]: 148: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,752 INFO L273 TraceCheckUtils]: 149: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,752 INFO L273 TraceCheckUtils]: 150: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,752 INFO L273 TraceCheckUtils]: 151: Hoare triple {17922#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {17922#false} is VALID [2018-11-14 17:09:35,752 INFO L273 TraceCheckUtils]: 152: Hoare triple {17922#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {17922#false} is VALID [2018-11-14 17:09:35,752 INFO L273 TraceCheckUtils]: 153: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,752 INFO L273 TraceCheckUtils]: 154: Hoare triple {17922#false} assume !(~i~2 < 999); {17922#false} is VALID [2018-11-14 17:09:35,752 INFO L273 TraceCheckUtils]: 155: Hoare triple {17922#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L256 TraceCheckUtils]: 156: Hoare triple {17922#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L273 TraceCheckUtils]: 157: Hoare triple {17922#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L273 TraceCheckUtils]: 158: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L273 TraceCheckUtils]: 159: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L273 TraceCheckUtils]: 160: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L273 TraceCheckUtils]: 161: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L273 TraceCheckUtils]: 162: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L273 TraceCheckUtils]: 163: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L273 TraceCheckUtils]: 164: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,753 INFO L273 TraceCheckUtils]: 165: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,754 INFO L273 TraceCheckUtils]: 166: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,754 INFO L273 TraceCheckUtils]: 167: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,754 INFO L273 TraceCheckUtils]: 168: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,754 INFO L273 TraceCheckUtils]: 169: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,754 INFO L273 TraceCheckUtils]: 170: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,754 INFO L273 TraceCheckUtils]: 171: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,754 INFO L273 TraceCheckUtils]: 172: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,754 INFO L273 TraceCheckUtils]: 173: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,754 INFO L273 TraceCheckUtils]: 174: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,755 INFO L273 TraceCheckUtils]: 175: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,755 INFO L273 TraceCheckUtils]: 176: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,755 INFO L273 TraceCheckUtils]: 177: Hoare triple {17922#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {17922#false} is VALID [2018-11-14 17:09:35,755 INFO L273 TraceCheckUtils]: 178: Hoare triple {17922#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {17922#false} is VALID [2018-11-14 17:09:35,755 INFO L273 TraceCheckUtils]: 179: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,755 INFO L273 TraceCheckUtils]: 180: Hoare triple {17922#false} assume !(~i~0 < 1000); {17922#false} is VALID [2018-11-14 17:09:35,755 INFO L273 TraceCheckUtils]: 181: Hoare triple {17922#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {17922#false} is VALID [2018-11-14 17:09:35,756 INFO L273 TraceCheckUtils]: 182: Hoare triple {17922#false} assume true; {17922#false} is VALID [2018-11-14 17:09:35,756 INFO L268 TraceCheckUtils]: 183: Hoare quadruple {17922#false} {17922#false} #77#return; {17922#false} is VALID [2018-11-14 17:09:35,756 INFO L273 TraceCheckUtils]: 184: Hoare triple {17922#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {17922#false} is VALID [2018-11-14 17:09:35,756 INFO L273 TraceCheckUtils]: 185: Hoare triple {17922#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {17922#false} is VALID [2018-11-14 17:09:35,756 INFO L273 TraceCheckUtils]: 186: Hoare triple {17922#false} assume !false; {17922#false} is VALID [2018-11-14 17:09:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1636 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 17:09:35,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:35,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-14 17:09:35,810 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 187 [2018-11-14 17:09:35,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:35,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 17:09:35,939 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-14 17:09:35,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 17:09:35,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 17:09:35,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:09:35,940 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 27 states. [2018-11-14 17:09:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:36,881 INFO L93 Difference]: Finished difference Result 195 states and 203 transitions. [2018-11-14 17:09:36,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 17:09:36,881 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 187 [2018-11-14 17:09:36,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:09:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 129 transitions. [2018-11-14 17:09:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:09:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 129 transitions. [2018-11-14 17:09:36,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 129 transitions. [2018-11-14 17:09:36,999 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:37,002 INFO L225 Difference]: With dead ends: 195 [2018-11-14 17:09:37,002 INFO L226 Difference]: Without dead ends: 138 [2018-11-14 17:09:37,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 17:09:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-14 17:09:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-11-14 17:09:37,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:37,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 137 states. [2018-11-14 17:09:37,106 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 137 states. [2018-11-14 17:09:37,106 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 137 states. [2018-11-14 17:09:37,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:37,109 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-11-14 17:09:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-11-14 17:09:37,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:37,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:37,110 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 138 states. [2018-11-14 17:09:37,110 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 138 states. [2018-11-14 17:09:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:37,112 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-11-14 17:09:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2018-11-14 17:09:37,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:37,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:37,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:37,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-11-14 17:09:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 141 transitions. [2018-11-14 17:09:37,116 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 141 transitions. Word has length 187 [2018-11-14 17:09:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:37,116 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-11-14 17:09:37,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 17:09:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 141 transitions. [2018-11-14 17:09:37,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-14 17:09:37,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:37,118 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 21, 21, 7, 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-14 17:09:37,118 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:37,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:37,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1167738939, now seen corresponding path program 23 times [2018-11-14 17:09:37,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:37,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:37,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:37,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:38,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {19231#true} call ULTIMATE.init(); {19231#true} is VALID [2018-11-14 17:09:38,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {19231#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19231#true} is VALID [2018-11-14 17:09:38,017 INFO L273 TraceCheckUtils]: 2: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19231#true} {19231#true} #69#return; {19231#true} is VALID [2018-11-14 17:09:38,017 INFO L256 TraceCheckUtils]: 4: Hoare triple {19231#true} call #t~ret13 := main(); {19231#true} is VALID [2018-11-14 17:09:38,018 INFO L273 TraceCheckUtils]: 5: Hoare triple {19231#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19233#(= main_~i~1 0)} is VALID [2018-11-14 17:09:38,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {19233#(= main_~i~1 0)} assume true; {19233#(= main_~i~1 0)} is VALID [2018-11-14 17:09:38,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {19233#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19233#(= main_~i~1 0)} is VALID [2018-11-14 17:09:38,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {19233#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19234#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:38,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {19234#(<= main_~i~1 1)} assume true; {19234#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:38,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {19234#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19234#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:38,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {19234#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19235#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:38,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {19235#(<= main_~i~1 2)} assume true; {19235#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:38,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {19235#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19235#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:38,021 INFO L273 TraceCheckUtils]: 14: Hoare triple {19235#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19236#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:38,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {19236#(<= main_~i~1 3)} assume true; {19236#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:38,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {19236#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19236#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:38,025 INFO L273 TraceCheckUtils]: 17: Hoare triple {19236#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19237#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:38,025 INFO L273 TraceCheckUtils]: 18: Hoare triple {19237#(<= main_~i~1 4)} assume true; {19237#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:38,026 INFO L273 TraceCheckUtils]: 19: Hoare triple {19237#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19237#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:38,026 INFO L273 TraceCheckUtils]: 20: Hoare triple {19237#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19238#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:38,026 INFO L273 TraceCheckUtils]: 21: Hoare triple {19238#(<= main_~i~1 5)} assume true; {19238#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:38,027 INFO L273 TraceCheckUtils]: 22: Hoare triple {19238#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19238#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:38,027 INFO L273 TraceCheckUtils]: 23: Hoare triple {19238#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19239#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:38,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {19239#(<= main_~i~1 6)} assume true; {19239#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:38,028 INFO L273 TraceCheckUtils]: 25: Hoare triple {19239#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19239#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:38,029 INFO L273 TraceCheckUtils]: 26: Hoare triple {19239#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19240#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:38,029 INFO L273 TraceCheckUtils]: 27: Hoare triple {19240#(<= main_~i~1 7)} assume true; {19240#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:38,030 INFO L273 TraceCheckUtils]: 28: Hoare triple {19240#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19240#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:38,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {19240#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19241#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:38,031 INFO L273 TraceCheckUtils]: 30: Hoare triple {19241#(<= main_~i~1 8)} assume true; {19241#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:38,031 INFO L273 TraceCheckUtils]: 31: Hoare triple {19241#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19241#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:38,032 INFO L273 TraceCheckUtils]: 32: Hoare triple {19241#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19242#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:38,033 INFO L273 TraceCheckUtils]: 33: Hoare triple {19242#(<= main_~i~1 9)} assume true; {19242#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:38,033 INFO L273 TraceCheckUtils]: 34: Hoare triple {19242#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19242#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:38,034 INFO L273 TraceCheckUtils]: 35: Hoare triple {19242#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19243#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:38,035 INFO L273 TraceCheckUtils]: 36: Hoare triple {19243#(<= main_~i~1 10)} assume true; {19243#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:38,035 INFO L273 TraceCheckUtils]: 37: Hoare triple {19243#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19243#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:38,036 INFO L273 TraceCheckUtils]: 38: Hoare triple {19243#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19244#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:38,036 INFO L273 TraceCheckUtils]: 39: Hoare triple {19244#(<= main_~i~1 11)} assume true; {19244#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:38,037 INFO L273 TraceCheckUtils]: 40: Hoare triple {19244#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19244#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:38,037 INFO L273 TraceCheckUtils]: 41: Hoare triple {19244#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19245#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:38,038 INFO L273 TraceCheckUtils]: 42: Hoare triple {19245#(<= main_~i~1 12)} assume true; {19245#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:38,038 INFO L273 TraceCheckUtils]: 43: Hoare triple {19245#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19245#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:38,039 INFO L273 TraceCheckUtils]: 44: Hoare triple {19245#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19246#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:38,040 INFO L273 TraceCheckUtils]: 45: Hoare triple {19246#(<= main_~i~1 13)} assume true; {19246#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:38,040 INFO L273 TraceCheckUtils]: 46: Hoare triple {19246#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19246#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:38,041 INFO L273 TraceCheckUtils]: 47: Hoare triple {19246#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19247#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:38,041 INFO L273 TraceCheckUtils]: 48: Hoare triple {19247#(<= main_~i~1 14)} assume true; {19247#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:38,042 INFO L273 TraceCheckUtils]: 49: Hoare triple {19247#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19247#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:38,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {19247#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19248#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:38,043 INFO L273 TraceCheckUtils]: 51: Hoare triple {19248#(<= main_~i~1 15)} assume true; {19248#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:38,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {19248#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19248#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:38,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {19248#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19249#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:38,045 INFO L273 TraceCheckUtils]: 54: Hoare triple {19249#(<= main_~i~1 16)} assume true; {19249#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:38,045 INFO L273 TraceCheckUtils]: 55: Hoare triple {19249#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19249#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:38,046 INFO L273 TraceCheckUtils]: 56: Hoare triple {19249#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19250#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:38,046 INFO L273 TraceCheckUtils]: 57: Hoare triple {19250#(<= main_~i~1 17)} assume true; {19250#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:38,047 INFO L273 TraceCheckUtils]: 58: Hoare triple {19250#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19250#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:38,048 INFO L273 TraceCheckUtils]: 59: Hoare triple {19250#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19251#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:38,048 INFO L273 TraceCheckUtils]: 60: Hoare triple {19251#(<= main_~i~1 18)} assume true; {19251#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:38,049 INFO L273 TraceCheckUtils]: 61: Hoare triple {19251#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19251#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:38,049 INFO L273 TraceCheckUtils]: 62: Hoare triple {19251#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19252#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:38,050 INFO L273 TraceCheckUtils]: 63: Hoare triple {19252#(<= main_~i~1 19)} assume true; {19252#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:38,050 INFO L273 TraceCheckUtils]: 64: Hoare triple {19252#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19252#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:38,051 INFO L273 TraceCheckUtils]: 65: Hoare triple {19252#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19253#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:38,052 INFO L273 TraceCheckUtils]: 66: Hoare triple {19253#(<= main_~i~1 20)} assume true; {19253#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:38,052 INFO L273 TraceCheckUtils]: 67: Hoare triple {19253#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19253#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:38,053 INFO L273 TraceCheckUtils]: 68: Hoare triple {19253#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19254#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:38,053 INFO L273 TraceCheckUtils]: 69: Hoare triple {19254#(<= main_~i~1 21)} assume true; {19254#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:38,054 INFO L273 TraceCheckUtils]: 70: Hoare triple {19254#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19254#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:38,054 INFO L273 TraceCheckUtils]: 71: Hoare triple {19254#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19255#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:38,055 INFO L273 TraceCheckUtils]: 72: Hoare triple {19255#(<= main_~i~1 22)} assume true; {19255#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:38,055 INFO L273 TraceCheckUtils]: 73: Hoare triple {19255#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19255#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:38,056 INFO L273 TraceCheckUtils]: 74: Hoare triple {19255#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19256#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:38,057 INFO L273 TraceCheckUtils]: 75: Hoare triple {19256#(<= main_~i~1 23)} assume true; {19256#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:38,057 INFO L273 TraceCheckUtils]: 76: Hoare triple {19256#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19256#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:38,058 INFO L273 TraceCheckUtils]: 77: Hoare triple {19256#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19257#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:38,058 INFO L273 TraceCheckUtils]: 78: Hoare triple {19257#(<= main_~i~1 24)} assume true; {19257#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:38,059 INFO L273 TraceCheckUtils]: 79: Hoare triple {19257#(<= main_~i~1 24)} assume !(~i~1 < 1000); {19232#false} is VALID [2018-11-14 17:09:38,059 INFO L256 TraceCheckUtils]: 80: Hoare triple {19232#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {19231#true} is VALID [2018-11-14 17:09:38,059 INFO L273 TraceCheckUtils]: 81: Hoare triple {19231#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19231#true} is VALID [2018-11-14 17:09:38,060 INFO L273 TraceCheckUtils]: 82: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,060 INFO L273 TraceCheckUtils]: 83: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,060 INFO L273 TraceCheckUtils]: 84: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,060 INFO L273 TraceCheckUtils]: 85: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,060 INFO L273 TraceCheckUtils]: 86: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,060 INFO L273 TraceCheckUtils]: 87: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,061 INFO L273 TraceCheckUtils]: 88: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,061 INFO L273 TraceCheckUtils]: 89: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,061 INFO L273 TraceCheckUtils]: 90: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,061 INFO L273 TraceCheckUtils]: 91: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,061 INFO L273 TraceCheckUtils]: 92: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,062 INFO L273 TraceCheckUtils]: 93: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,062 INFO L273 TraceCheckUtils]: 94: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,062 INFO L273 TraceCheckUtils]: 95: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,062 INFO L273 TraceCheckUtils]: 96: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,062 INFO L273 TraceCheckUtils]: 97: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,062 INFO L273 TraceCheckUtils]: 98: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,062 INFO L273 TraceCheckUtils]: 99: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,062 INFO L273 TraceCheckUtils]: 100: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,063 INFO L273 TraceCheckUtils]: 101: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,063 INFO L273 TraceCheckUtils]: 102: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,063 INFO L273 TraceCheckUtils]: 103: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,063 INFO L273 TraceCheckUtils]: 104: Hoare triple {19231#true} assume !(~i~0 < 1000); {19231#true} is VALID [2018-11-14 17:09:38,063 INFO L273 TraceCheckUtils]: 105: Hoare triple {19231#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19231#true} is VALID [2018-11-14 17:09:38,063 INFO L273 TraceCheckUtils]: 106: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,063 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19231#true} {19232#false} #73#return; {19232#false} is VALID [2018-11-14 17:09:38,063 INFO L273 TraceCheckUtils]: 108: Hoare triple {19232#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {19232#false} is VALID [2018-11-14 17:09:38,063 INFO L256 TraceCheckUtils]: 109: Hoare triple {19232#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {19231#true} is VALID [2018-11-14 17:09:38,063 INFO L273 TraceCheckUtils]: 110: Hoare triple {19231#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 111: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 112: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 113: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 114: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 115: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 116: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 117: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 118: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 119: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,064 INFO L273 TraceCheckUtils]: 120: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,065 INFO L273 TraceCheckUtils]: 121: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,065 INFO L273 TraceCheckUtils]: 122: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,065 INFO L273 TraceCheckUtils]: 123: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,065 INFO L273 TraceCheckUtils]: 124: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,065 INFO L273 TraceCheckUtils]: 125: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,065 INFO L273 TraceCheckUtils]: 126: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,065 INFO L273 TraceCheckUtils]: 127: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,065 INFO L273 TraceCheckUtils]: 128: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,065 INFO L273 TraceCheckUtils]: 129: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,066 INFO L273 TraceCheckUtils]: 130: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,066 INFO L273 TraceCheckUtils]: 131: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,066 INFO L273 TraceCheckUtils]: 132: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,066 INFO L273 TraceCheckUtils]: 133: Hoare triple {19231#true} assume !(~i~0 < 1000); {19231#true} is VALID [2018-11-14 17:09:38,066 INFO L273 TraceCheckUtils]: 134: Hoare triple {19231#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19231#true} is VALID [2018-11-14 17:09:38,066 INFO L273 TraceCheckUtils]: 135: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,066 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {19231#true} {19232#false} #75#return; {19232#false} is VALID [2018-11-14 17:09:38,066 INFO L273 TraceCheckUtils]: 137: Hoare triple {19232#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19232#false} is VALID [2018-11-14 17:09:38,066 INFO L273 TraceCheckUtils]: 138: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:38,066 INFO L273 TraceCheckUtils]: 139: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 140: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 141: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 142: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 143: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 144: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 145: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 146: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 147: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 148: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:38,067 INFO L273 TraceCheckUtils]: 149: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:38,068 INFO L273 TraceCheckUtils]: 150: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:38,068 INFO L273 TraceCheckUtils]: 151: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:38,068 INFO L273 TraceCheckUtils]: 152: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:38,068 INFO L273 TraceCheckUtils]: 153: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:38,068 INFO L273 TraceCheckUtils]: 154: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:38,068 INFO L273 TraceCheckUtils]: 155: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:38,068 INFO L273 TraceCheckUtils]: 156: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:38,068 INFO L273 TraceCheckUtils]: 157: Hoare triple {19232#false} assume !(~i~2 < 999); {19232#false} is VALID [2018-11-14 17:09:38,068 INFO L273 TraceCheckUtils]: 158: Hoare triple {19232#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {19232#false} is VALID [2018-11-14 17:09:38,069 INFO L256 TraceCheckUtils]: 159: Hoare triple {19232#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {19231#true} is VALID [2018-11-14 17:09:38,069 INFO L273 TraceCheckUtils]: 160: Hoare triple {19231#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19231#true} is VALID [2018-11-14 17:09:38,069 INFO L273 TraceCheckUtils]: 161: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,069 INFO L273 TraceCheckUtils]: 162: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,069 INFO L273 TraceCheckUtils]: 163: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,069 INFO L273 TraceCheckUtils]: 164: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,069 INFO L273 TraceCheckUtils]: 165: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,069 INFO L273 TraceCheckUtils]: 166: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,069 INFO L273 TraceCheckUtils]: 167: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,069 INFO L273 TraceCheckUtils]: 168: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 169: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 170: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 171: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 172: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 173: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 174: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 175: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 176: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 177: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,070 INFO L273 TraceCheckUtils]: 178: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,071 INFO L273 TraceCheckUtils]: 179: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,071 INFO L273 TraceCheckUtils]: 180: Hoare triple {19231#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19231#true} is VALID [2018-11-14 17:09:38,071 INFO L273 TraceCheckUtils]: 181: Hoare triple {19231#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19231#true} is VALID [2018-11-14 17:09:38,071 INFO L273 TraceCheckUtils]: 182: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,071 INFO L273 TraceCheckUtils]: 183: Hoare triple {19231#true} assume !(~i~0 < 1000); {19231#true} is VALID [2018-11-14 17:09:38,071 INFO L273 TraceCheckUtils]: 184: Hoare triple {19231#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19231#true} is VALID [2018-11-14 17:09:38,071 INFO L273 TraceCheckUtils]: 185: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:38,071 INFO L268 TraceCheckUtils]: 186: Hoare quadruple {19231#true} {19232#false} #77#return; {19232#false} is VALID [2018-11-14 17:09:38,071 INFO L273 TraceCheckUtils]: 187: Hoare triple {19232#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19232#false} is VALID [2018-11-14 17:09:38,071 INFO L273 TraceCheckUtils]: 188: Hoare triple {19232#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19232#false} is VALID [2018-11-14 17:09:38,072 INFO L273 TraceCheckUtils]: 189: Hoare triple {19232#false} assume !false; {19232#false} is VALID [2018-11-14 17:09:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2018-11-14 17:09:38,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:38,088 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-14 17:09:38,097 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 17:09:42,425 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 17:09:42,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:42,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:43,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {19231#true} call ULTIMATE.init(); {19231#true} is VALID [2018-11-14 17:09:43,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {19231#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19231#true} is VALID [2018-11-14 17:09:43,072 INFO L273 TraceCheckUtils]: 2: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,072 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19231#true} {19231#true} #69#return; {19231#true} is VALID [2018-11-14 17:09:43,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {19231#true} call #t~ret13 := main(); {19231#true} is VALID [2018-11-14 17:09:43,073 INFO L273 TraceCheckUtils]: 5: Hoare triple {19231#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {19231#true} is VALID [2018-11-14 17:09:43,073 INFO L273 TraceCheckUtils]: 6: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,074 INFO L273 TraceCheckUtils]: 12: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 20: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 21: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 22: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 23: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,075 INFO L273 TraceCheckUtils]: 24: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 25: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 26: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 32: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 33: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,076 INFO L273 TraceCheckUtils]: 34: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,077 INFO L273 TraceCheckUtils]: 35: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,077 INFO L273 TraceCheckUtils]: 36: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,077 INFO L273 TraceCheckUtils]: 37: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,077 INFO L273 TraceCheckUtils]: 38: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,077 INFO L273 TraceCheckUtils]: 39: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,077 INFO L273 TraceCheckUtils]: 40: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,077 INFO L273 TraceCheckUtils]: 41: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,077 INFO L273 TraceCheckUtils]: 42: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,077 INFO L273 TraceCheckUtils]: 43: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 44: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 45: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 46: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 47: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 48: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 49: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 50: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 51: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 52: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,078 INFO L273 TraceCheckUtils]: 53: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,079 INFO L273 TraceCheckUtils]: 54: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,079 INFO L273 TraceCheckUtils]: 55: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,079 INFO L273 TraceCheckUtils]: 56: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,079 INFO L273 TraceCheckUtils]: 57: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,079 INFO L273 TraceCheckUtils]: 58: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,079 INFO L273 TraceCheckUtils]: 59: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,079 INFO L273 TraceCheckUtils]: 60: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,080 INFO L273 TraceCheckUtils]: 61: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,080 INFO L273 TraceCheckUtils]: 62: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,080 INFO L273 TraceCheckUtils]: 63: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,080 INFO L273 TraceCheckUtils]: 64: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,080 INFO L273 TraceCheckUtils]: 65: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,080 INFO L273 TraceCheckUtils]: 66: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,080 INFO L273 TraceCheckUtils]: 67: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,080 INFO L273 TraceCheckUtils]: 68: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,080 INFO L273 TraceCheckUtils]: 69: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 70: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 71: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 72: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 73: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 74: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 75: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 76: Hoare triple {19231#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 77: Hoare triple {19231#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 78: Hoare triple {19231#true} assume true; {19231#true} is VALID [2018-11-14 17:09:43,081 INFO L273 TraceCheckUtils]: 79: Hoare triple {19231#true} assume !(~i~1 < 1000); {19231#true} is VALID [2018-11-14 17:09:43,082 INFO L256 TraceCheckUtils]: 80: Hoare triple {19231#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {19231#true} is VALID [2018-11-14 17:09:43,082 INFO L273 TraceCheckUtils]: 81: Hoare triple {19231#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19504#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:43,082 INFO L273 TraceCheckUtils]: 82: Hoare triple {19504#(<= xor_~i~0 1)} assume true; {19504#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:43,083 INFO L273 TraceCheckUtils]: 83: Hoare triple {19504#(<= xor_~i~0 1)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19504#(<= xor_~i~0 1)} is VALID [2018-11-14 17:09:43,083 INFO L273 TraceCheckUtils]: 84: Hoare triple {19504#(<= xor_~i~0 1)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19514#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:43,084 INFO L273 TraceCheckUtils]: 85: Hoare triple {19514#(<= xor_~i~0 2)} assume true; {19514#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:43,084 INFO L273 TraceCheckUtils]: 86: Hoare triple {19514#(<= xor_~i~0 2)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19514#(<= xor_~i~0 2)} is VALID [2018-11-14 17:09:43,084 INFO L273 TraceCheckUtils]: 87: Hoare triple {19514#(<= xor_~i~0 2)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19524#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:43,085 INFO L273 TraceCheckUtils]: 88: Hoare triple {19524#(<= xor_~i~0 3)} assume true; {19524#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:43,085 INFO L273 TraceCheckUtils]: 89: Hoare triple {19524#(<= xor_~i~0 3)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19524#(<= xor_~i~0 3)} is VALID [2018-11-14 17:09:43,085 INFO L273 TraceCheckUtils]: 90: Hoare triple {19524#(<= xor_~i~0 3)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19534#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:43,086 INFO L273 TraceCheckUtils]: 91: Hoare triple {19534#(<= xor_~i~0 4)} assume true; {19534#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:43,086 INFO L273 TraceCheckUtils]: 92: Hoare triple {19534#(<= xor_~i~0 4)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19534#(<= xor_~i~0 4)} is VALID [2018-11-14 17:09:43,087 INFO L273 TraceCheckUtils]: 93: Hoare triple {19534#(<= xor_~i~0 4)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19544#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:43,087 INFO L273 TraceCheckUtils]: 94: Hoare triple {19544#(<= xor_~i~0 5)} assume true; {19544#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:43,107 INFO L273 TraceCheckUtils]: 95: Hoare triple {19544#(<= xor_~i~0 5)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19544#(<= xor_~i~0 5)} is VALID [2018-11-14 17:09:43,108 INFO L273 TraceCheckUtils]: 96: Hoare triple {19544#(<= xor_~i~0 5)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19554#(<= xor_~i~0 6)} is VALID [2018-11-14 17:09:43,108 INFO L273 TraceCheckUtils]: 97: Hoare triple {19554#(<= xor_~i~0 6)} assume true; {19554#(<= xor_~i~0 6)} is VALID [2018-11-14 17:09:43,109 INFO L273 TraceCheckUtils]: 98: Hoare triple {19554#(<= xor_~i~0 6)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19554#(<= xor_~i~0 6)} is VALID [2018-11-14 17:09:43,109 INFO L273 TraceCheckUtils]: 99: Hoare triple {19554#(<= xor_~i~0 6)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19564#(<= xor_~i~0 7)} is VALID [2018-11-14 17:09:43,110 INFO L273 TraceCheckUtils]: 100: Hoare triple {19564#(<= xor_~i~0 7)} assume true; {19564#(<= xor_~i~0 7)} is VALID [2018-11-14 17:09:43,110 INFO L273 TraceCheckUtils]: 101: Hoare triple {19564#(<= xor_~i~0 7)} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19564#(<= xor_~i~0 7)} is VALID [2018-11-14 17:09:43,110 INFO L273 TraceCheckUtils]: 102: Hoare triple {19564#(<= xor_~i~0 7)} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19574#(<= xor_~i~0 8)} is VALID [2018-11-14 17:09:43,111 INFO L273 TraceCheckUtils]: 103: Hoare triple {19574#(<= xor_~i~0 8)} assume true; {19574#(<= xor_~i~0 8)} is VALID [2018-11-14 17:09:43,111 INFO L273 TraceCheckUtils]: 104: Hoare triple {19574#(<= xor_~i~0 8)} assume !(~i~0 < 1000); {19232#false} is VALID [2018-11-14 17:09:43,111 INFO L273 TraceCheckUtils]: 105: Hoare triple {19232#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19232#false} is VALID [2018-11-14 17:09:43,111 INFO L273 TraceCheckUtils]: 106: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,111 INFO L268 TraceCheckUtils]: 107: Hoare quadruple {19232#false} {19231#true} #73#return; {19232#false} is VALID [2018-11-14 17:09:43,111 INFO L273 TraceCheckUtils]: 108: Hoare triple {19232#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {19232#false} is VALID [2018-11-14 17:09:43,111 INFO L256 TraceCheckUtils]: 109: Hoare triple {19232#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {19232#false} is VALID [2018-11-14 17:09:43,112 INFO L273 TraceCheckUtils]: 110: Hoare triple {19232#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19232#false} is VALID [2018-11-14 17:09:43,112 INFO L273 TraceCheckUtils]: 111: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,112 INFO L273 TraceCheckUtils]: 112: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,112 INFO L273 TraceCheckUtils]: 113: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,112 INFO L273 TraceCheckUtils]: 114: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,113 INFO L273 TraceCheckUtils]: 115: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,113 INFO L273 TraceCheckUtils]: 116: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,113 INFO L273 TraceCheckUtils]: 117: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,113 INFO L273 TraceCheckUtils]: 118: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,113 INFO L273 TraceCheckUtils]: 119: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,113 INFO L273 TraceCheckUtils]: 120: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 121: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 122: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 123: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 124: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 125: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 126: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 127: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 128: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 129: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,114 INFO L273 TraceCheckUtils]: 130: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,115 INFO L273 TraceCheckUtils]: 131: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,115 INFO L273 TraceCheckUtils]: 132: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,115 INFO L273 TraceCheckUtils]: 133: Hoare triple {19232#false} assume !(~i~0 < 1000); {19232#false} is VALID [2018-11-14 17:09:43,115 INFO L273 TraceCheckUtils]: 134: Hoare triple {19232#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19232#false} is VALID [2018-11-14 17:09:43,115 INFO L273 TraceCheckUtils]: 135: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,115 INFO L268 TraceCheckUtils]: 136: Hoare quadruple {19232#false} {19232#false} #75#return; {19232#false} is VALID [2018-11-14 17:09:43,115 INFO L273 TraceCheckUtils]: 137: Hoare triple {19232#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {19232#false} is VALID [2018-11-14 17:09:43,115 INFO L273 TraceCheckUtils]: 138: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,115 INFO L273 TraceCheckUtils]: 139: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 140: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 141: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 142: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 143: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 144: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 145: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 146: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 147: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 148: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:43,116 INFO L273 TraceCheckUtils]: 149: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L273 TraceCheckUtils]: 150: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L273 TraceCheckUtils]: 151: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L273 TraceCheckUtils]: 152: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L273 TraceCheckUtils]: 153: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L273 TraceCheckUtils]: 154: Hoare triple {19232#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L273 TraceCheckUtils]: 155: Hoare triple {19232#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L273 TraceCheckUtils]: 156: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L273 TraceCheckUtils]: 157: Hoare triple {19232#false} assume !(~i~2 < 999); {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L273 TraceCheckUtils]: 158: Hoare triple {19232#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {19232#false} is VALID [2018-11-14 17:09:43,117 INFO L256 TraceCheckUtils]: 159: Hoare triple {19232#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 160: Hoare triple {19232#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 161: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 162: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 163: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 164: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 165: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 166: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 167: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 168: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,118 INFO L273 TraceCheckUtils]: 169: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 170: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 171: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 172: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 173: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 174: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 175: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 176: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 177: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 178: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,119 INFO L273 TraceCheckUtils]: 179: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,120 INFO L273 TraceCheckUtils]: 180: Hoare triple {19232#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {19232#false} is VALID [2018-11-14 17:09:43,120 INFO L273 TraceCheckUtils]: 181: Hoare triple {19232#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {19232#false} is VALID [2018-11-14 17:09:43,120 INFO L273 TraceCheckUtils]: 182: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,120 INFO L273 TraceCheckUtils]: 183: Hoare triple {19232#false} assume !(~i~0 < 1000); {19232#false} is VALID [2018-11-14 17:09:43,120 INFO L273 TraceCheckUtils]: 184: Hoare triple {19232#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {19232#false} is VALID [2018-11-14 17:09:43,120 INFO L273 TraceCheckUtils]: 185: Hoare triple {19232#false} assume true; {19232#false} is VALID [2018-11-14 17:09:43,120 INFO L268 TraceCheckUtils]: 186: Hoare quadruple {19232#false} {19232#false} #77#return; {19232#false} is VALID [2018-11-14 17:09:43,120 INFO L273 TraceCheckUtils]: 187: Hoare triple {19232#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {19232#false} is VALID [2018-11-14 17:09:43,120 INFO L273 TraceCheckUtils]: 188: Hoare triple {19232#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {19232#false} is VALID [2018-11-14 17:09:43,121 INFO L273 TraceCheckUtils]: 189: Hoare triple {19232#false} assume !false; {19232#false} is VALID [2018-11-14 17:09:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1707 backedges. 356 proven. 77 refuted. 0 times theorem prover too weak. 1274 trivial. 0 not checked. [2018-11-14 17:09:43,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:43,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 10] total 35 [2018-11-14 17:09:43,161 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 190 [2018-11-14 17:09:43,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:43,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 17:09:43,624 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:43,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 17:09:43,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 17:09:43,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:09:43,625 INFO L87 Difference]: Start difference. First operand 137 states and 141 transitions. Second operand 35 states. [2018-11-14 17:09:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:44,816 INFO L93 Difference]: Finished difference Result 202 states and 214 transitions. [2018-11-14 17:09:44,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 17:09:44,816 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 190 [2018-11-14 17:09:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:09:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 160 transitions. [2018-11-14 17:09:44,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:09:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 160 transitions. [2018-11-14 17:09:44,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 160 transitions. [2018-11-14 17:09:44,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:44,967 INFO L225 Difference]: With dead ends: 202 [2018-11-14 17:09:44,967 INFO L226 Difference]: Without dead ends: 145 [2018-11-14 17:09:44,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 183 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-14 17:09:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-14 17:09:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-14 17:09:45,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:45,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-14 17:09:45,014 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-14 17:09:45,014 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-14 17:09:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:45,017 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-14 17:09:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-14 17:09:45,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:45,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:45,018 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-14 17:09:45,018 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-14 17:09:45,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:45,020 INFO L93 Difference]: Finished difference Result 145 states and 149 transitions. [2018-11-14 17:09:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2018-11-14 17:09:45,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:45,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:45,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:45,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-14 17:09:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2018-11-14 17:09:45,023 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 190 [2018-11-14 17:09:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:45,023 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2018-11-14 17:09:45,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 17:09:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2018-11-14 17:09:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-14 17:09:45,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:45,024 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 25, 25, 24, 24, 7, 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-14 17:09:45,024 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:45,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:45,025 INFO L82 PathProgramCache]: Analyzing trace with hash -226515626, now seen corresponding path program 24 times [2018-11-14 17:09:45,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:45,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:45,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:45,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:45,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:46,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {20589#true} call ULTIMATE.init(); {20589#true} is VALID [2018-11-14 17:09:46,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {20589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20589#true} is VALID [2018-11-14 17:09:46,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20589#true} {20589#true} #69#return; {20589#true} is VALID [2018-11-14 17:09:46,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {20589#true} call #t~ret13 := main(); {20589#true} is VALID [2018-11-14 17:09:46,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {20589#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20591#(= main_~i~1 0)} is VALID [2018-11-14 17:09:46,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {20591#(= main_~i~1 0)} assume true; {20591#(= main_~i~1 0)} is VALID [2018-11-14 17:09:46,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {20591#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20591#(= main_~i~1 0)} is VALID [2018-11-14 17:09:46,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {20591#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20592#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:46,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {20592#(<= main_~i~1 1)} assume true; {20592#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:46,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {20592#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20592#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:46,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {20592#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20593#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:46,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {20593#(<= main_~i~1 2)} assume true; {20593#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:46,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {20593#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20593#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:46,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {20593#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20594#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:46,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {20594#(<= main_~i~1 3)} assume true; {20594#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:46,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {20594#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20594#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:46,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {20594#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20595#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:46,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {20595#(<= main_~i~1 4)} assume true; {20595#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:46,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {20595#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20595#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:46,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {20595#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20596#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:46,303 INFO L273 TraceCheckUtils]: 21: Hoare triple {20596#(<= main_~i~1 5)} assume true; {20596#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:46,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {20596#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20596#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:46,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {20596#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20597#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:46,305 INFO L273 TraceCheckUtils]: 24: Hoare triple {20597#(<= main_~i~1 6)} assume true; {20597#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:46,305 INFO L273 TraceCheckUtils]: 25: Hoare triple {20597#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20597#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:46,306 INFO L273 TraceCheckUtils]: 26: Hoare triple {20597#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20598#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:46,307 INFO L273 TraceCheckUtils]: 27: Hoare triple {20598#(<= main_~i~1 7)} assume true; {20598#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:46,307 INFO L273 TraceCheckUtils]: 28: Hoare triple {20598#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20598#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:46,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {20598#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20599#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:46,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {20599#(<= main_~i~1 8)} assume true; {20599#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:46,309 INFO L273 TraceCheckUtils]: 31: Hoare triple {20599#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20599#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:46,309 INFO L273 TraceCheckUtils]: 32: Hoare triple {20599#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20600#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:46,310 INFO L273 TraceCheckUtils]: 33: Hoare triple {20600#(<= main_~i~1 9)} assume true; {20600#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:46,310 INFO L273 TraceCheckUtils]: 34: Hoare triple {20600#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20600#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:46,311 INFO L273 TraceCheckUtils]: 35: Hoare triple {20600#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20601#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:46,312 INFO L273 TraceCheckUtils]: 36: Hoare triple {20601#(<= main_~i~1 10)} assume true; {20601#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:46,312 INFO L273 TraceCheckUtils]: 37: Hoare triple {20601#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20601#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:46,313 INFO L273 TraceCheckUtils]: 38: Hoare triple {20601#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20602#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:46,313 INFO L273 TraceCheckUtils]: 39: Hoare triple {20602#(<= main_~i~1 11)} assume true; {20602#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:46,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {20602#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20602#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:46,315 INFO L273 TraceCheckUtils]: 41: Hoare triple {20602#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20603#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:46,315 INFO L273 TraceCheckUtils]: 42: Hoare triple {20603#(<= main_~i~1 12)} assume true; {20603#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:46,316 INFO L273 TraceCheckUtils]: 43: Hoare triple {20603#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20603#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:46,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {20603#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20604#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:46,317 INFO L273 TraceCheckUtils]: 45: Hoare triple {20604#(<= main_~i~1 13)} assume true; {20604#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:46,317 INFO L273 TraceCheckUtils]: 46: Hoare triple {20604#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20604#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:46,318 INFO L273 TraceCheckUtils]: 47: Hoare triple {20604#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20605#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:46,318 INFO L273 TraceCheckUtils]: 48: Hoare triple {20605#(<= main_~i~1 14)} assume true; {20605#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:46,319 INFO L273 TraceCheckUtils]: 49: Hoare triple {20605#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20605#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:46,320 INFO L273 TraceCheckUtils]: 50: Hoare triple {20605#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20606#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:46,320 INFO L273 TraceCheckUtils]: 51: Hoare triple {20606#(<= main_~i~1 15)} assume true; {20606#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:46,321 INFO L273 TraceCheckUtils]: 52: Hoare triple {20606#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20606#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:46,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {20606#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20607#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:46,322 INFO L273 TraceCheckUtils]: 54: Hoare triple {20607#(<= main_~i~1 16)} assume true; {20607#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:46,322 INFO L273 TraceCheckUtils]: 55: Hoare triple {20607#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20607#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:46,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {20607#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20608#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:46,324 INFO L273 TraceCheckUtils]: 57: Hoare triple {20608#(<= main_~i~1 17)} assume true; {20608#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:46,324 INFO L273 TraceCheckUtils]: 58: Hoare triple {20608#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20608#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:46,325 INFO L273 TraceCheckUtils]: 59: Hoare triple {20608#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20609#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:46,325 INFO L273 TraceCheckUtils]: 60: Hoare triple {20609#(<= main_~i~1 18)} assume true; {20609#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:46,326 INFO L273 TraceCheckUtils]: 61: Hoare triple {20609#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20609#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:46,327 INFO L273 TraceCheckUtils]: 62: Hoare triple {20609#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20610#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:46,327 INFO L273 TraceCheckUtils]: 63: Hoare triple {20610#(<= main_~i~1 19)} assume true; {20610#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:46,328 INFO L273 TraceCheckUtils]: 64: Hoare triple {20610#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20610#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:46,328 INFO L273 TraceCheckUtils]: 65: Hoare triple {20610#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20611#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:46,329 INFO L273 TraceCheckUtils]: 66: Hoare triple {20611#(<= main_~i~1 20)} assume true; {20611#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:46,329 INFO L273 TraceCheckUtils]: 67: Hoare triple {20611#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20611#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:46,330 INFO L273 TraceCheckUtils]: 68: Hoare triple {20611#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20612#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:46,330 INFO L273 TraceCheckUtils]: 69: Hoare triple {20612#(<= main_~i~1 21)} assume true; {20612#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:46,331 INFO L273 TraceCheckUtils]: 70: Hoare triple {20612#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20612#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:46,331 INFO L273 TraceCheckUtils]: 71: Hoare triple {20612#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20613#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:46,332 INFO L273 TraceCheckUtils]: 72: Hoare triple {20613#(<= main_~i~1 22)} assume true; {20613#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:46,332 INFO L273 TraceCheckUtils]: 73: Hoare triple {20613#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20613#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:46,334 INFO L273 TraceCheckUtils]: 74: Hoare triple {20613#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20614#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:46,334 INFO L273 TraceCheckUtils]: 75: Hoare triple {20614#(<= main_~i~1 23)} assume true; {20614#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:46,335 INFO L273 TraceCheckUtils]: 76: Hoare triple {20614#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20614#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:46,336 INFO L273 TraceCheckUtils]: 77: Hoare triple {20614#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20615#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:46,337 INFO L273 TraceCheckUtils]: 78: Hoare triple {20615#(<= main_~i~1 24)} assume true; {20615#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:46,337 INFO L273 TraceCheckUtils]: 79: Hoare triple {20615#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20615#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:46,338 INFO L273 TraceCheckUtils]: 80: Hoare triple {20615#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20616#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:46,339 INFO L273 TraceCheckUtils]: 81: Hoare triple {20616#(<= main_~i~1 25)} assume true; {20616#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:46,339 INFO L273 TraceCheckUtils]: 82: Hoare triple {20616#(<= main_~i~1 25)} assume !(~i~1 < 1000); {20590#false} is VALID [2018-11-14 17:09:46,339 INFO L256 TraceCheckUtils]: 83: Hoare triple {20590#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {20589#true} is VALID [2018-11-14 17:09:46,340 INFO L273 TraceCheckUtils]: 84: Hoare triple {20589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20589#true} is VALID [2018-11-14 17:09:46,340 INFO L273 TraceCheckUtils]: 85: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,340 INFO L273 TraceCheckUtils]: 86: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,340 INFO L273 TraceCheckUtils]: 87: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,340 INFO L273 TraceCheckUtils]: 88: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,340 INFO L273 TraceCheckUtils]: 89: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,341 INFO L273 TraceCheckUtils]: 90: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,341 INFO L273 TraceCheckUtils]: 91: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,341 INFO L273 TraceCheckUtils]: 92: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,341 INFO L273 TraceCheckUtils]: 93: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,341 INFO L273 TraceCheckUtils]: 94: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,341 INFO L273 TraceCheckUtils]: 95: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,342 INFO L273 TraceCheckUtils]: 96: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,342 INFO L273 TraceCheckUtils]: 97: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,342 INFO L273 TraceCheckUtils]: 98: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,342 INFO L273 TraceCheckUtils]: 99: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,342 INFO L273 TraceCheckUtils]: 100: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,342 INFO L273 TraceCheckUtils]: 101: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,343 INFO L273 TraceCheckUtils]: 102: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,343 INFO L273 TraceCheckUtils]: 103: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,343 INFO L273 TraceCheckUtils]: 104: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,343 INFO L273 TraceCheckUtils]: 105: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,343 INFO L273 TraceCheckUtils]: 106: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,343 INFO L273 TraceCheckUtils]: 107: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,343 INFO L273 TraceCheckUtils]: 108: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,343 INFO L273 TraceCheckUtils]: 109: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,343 INFO L273 TraceCheckUtils]: 110: Hoare triple {20589#true} assume !(~i~0 < 1000); {20589#true} is VALID [2018-11-14 17:09:46,344 INFO L273 TraceCheckUtils]: 111: Hoare triple {20589#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20589#true} is VALID [2018-11-14 17:09:46,344 INFO L273 TraceCheckUtils]: 112: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,344 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {20589#true} {20590#false} #73#return; {20590#false} is VALID [2018-11-14 17:09:46,344 INFO L273 TraceCheckUtils]: 114: Hoare triple {20590#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {20590#false} is VALID [2018-11-14 17:09:46,344 INFO L256 TraceCheckUtils]: 115: Hoare triple {20590#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {20589#true} is VALID [2018-11-14 17:09:46,344 INFO L273 TraceCheckUtils]: 116: Hoare triple {20589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20589#true} is VALID [2018-11-14 17:09:46,344 INFO L273 TraceCheckUtils]: 117: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,344 INFO L273 TraceCheckUtils]: 118: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,344 INFO L273 TraceCheckUtils]: 119: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 120: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 121: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 122: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 123: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 124: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 125: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 126: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 127: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 128: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,345 INFO L273 TraceCheckUtils]: 129: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 130: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 131: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 132: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 133: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 134: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 135: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 136: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 137: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 138: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,346 INFO L273 TraceCheckUtils]: 139: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,347 INFO L273 TraceCheckUtils]: 140: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,347 INFO L273 TraceCheckUtils]: 141: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,347 INFO L273 TraceCheckUtils]: 142: Hoare triple {20589#true} assume !(~i~0 < 1000); {20589#true} is VALID [2018-11-14 17:09:46,347 INFO L273 TraceCheckUtils]: 143: Hoare triple {20589#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20589#true} is VALID [2018-11-14 17:09:46,347 INFO L273 TraceCheckUtils]: 144: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,347 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {20589#true} {20590#false} #75#return; {20590#false} is VALID [2018-11-14 17:09:46,347 INFO L273 TraceCheckUtils]: 146: Hoare triple {20590#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {20590#false} is VALID [2018-11-14 17:09:46,347 INFO L273 TraceCheckUtils]: 147: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:46,347 INFO L273 TraceCheckUtils]: 148: Hoare triple {20590#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20590#false} is VALID [2018-11-14 17:09:46,347 INFO L273 TraceCheckUtils]: 149: Hoare triple {20590#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20590#false} is VALID [2018-11-14 17:09:46,348 INFO L273 TraceCheckUtils]: 150: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:46,348 INFO L273 TraceCheckUtils]: 151: Hoare triple {20590#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20590#false} is VALID [2018-11-14 17:09:46,348 INFO L273 TraceCheckUtils]: 152: Hoare triple {20590#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20590#false} is VALID [2018-11-14 17:09:46,348 INFO L273 TraceCheckUtils]: 153: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:46,348 INFO L273 TraceCheckUtils]: 154: Hoare triple {20590#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20590#false} is VALID [2018-11-14 17:09:46,348 INFO L273 TraceCheckUtils]: 155: Hoare triple {20590#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20590#false} is VALID [2018-11-14 17:09:46,348 INFO L273 TraceCheckUtils]: 156: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:46,348 INFO L273 TraceCheckUtils]: 157: Hoare triple {20590#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20590#false} is VALID [2018-11-14 17:09:46,348 INFO L273 TraceCheckUtils]: 158: Hoare triple {20590#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L273 TraceCheckUtils]: 159: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L273 TraceCheckUtils]: 160: Hoare triple {20590#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L273 TraceCheckUtils]: 161: Hoare triple {20590#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L273 TraceCheckUtils]: 162: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L273 TraceCheckUtils]: 163: Hoare triple {20590#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L273 TraceCheckUtils]: 164: Hoare triple {20590#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L273 TraceCheckUtils]: 165: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L273 TraceCheckUtils]: 166: Hoare triple {20590#false} assume !(~i~2 < 999); {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L273 TraceCheckUtils]: 167: Hoare triple {20590#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {20590#false} is VALID [2018-11-14 17:09:46,349 INFO L256 TraceCheckUtils]: 168: Hoare triple {20590#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 169: Hoare triple {20589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 170: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 171: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 172: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 173: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 174: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 175: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 176: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 177: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,350 INFO L273 TraceCheckUtils]: 178: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 179: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 180: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 181: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 182: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 183: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 184: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 185: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 186: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 187: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,351 INFO L273 TraceCheckUtils]: 188: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,352 INFO L273 TraceCheckUtils]: 189: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,352 INFO L273 TraceCheckUtils]: 190: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,352 INFO L273 TraceCheckUtils]: 191: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,352 INFO L273 TraceCheckUtils]: 192: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:46,352 INFO L273 TraceCheckUtils]: 193: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:46,352 INFO L273 TraceCheckUtils]: 194: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,352 INFO L273 TraceCheckUtils]: 195: Hoare triple {20589#true} assume !(~i~0 < 1000); {20589#true} is VALID [2018-11-14 17:09:46,352 INFO L273 TraceCheckUtils]: 196: Hoare triple {20589#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20589#true} is VALID [2018-11-14 17:09:46,352 INFO L273 TraceCheckUtils]: 197: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:46,353 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {20589#true} {20590#false} #77#return; {20590#false} is VALID [2018-11-14 17:09:46,353 INFO L273 TraceCheckUtils]: 199: Hoare triple {20590#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20590#false} is VALID [2018-11-14 17:09:46,353 INFO L273 TraceCheckUtils]: 200: Hoare triple {20590#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20590#false} is VALID [2018-11-14 17:09:46,353 INFO L273 TraceCheckUtils]: 201: Hoare triple {20590#false} assume !false; {20590#false} is VALID [2018-11-14 17:09:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1997 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2018-11-14 17:09:46,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:46,374 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-14 17:09:46,382 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 17:09:47,286 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-11-14 17:09:47,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:47,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:47,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {20589#true} call ULTIMATE.init(); {20589#true} is VALID [2018-11-14 17:09:47,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {20589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20589#true} is VALID [2018-11-14 17:09:47,610 INFO L273 TraceCheckUtils]: 2: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20589#true} {20589#true} #69#return; {20589#true} is VALID [2018-11-14 17:09:47,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {20589#true} call #t~ret13 := main(); {20589#true} is VALID [2018-11-14 17:09:47,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {20589#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {20589#true} is VALID [2018-11-14 17:09:47,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,611 INFO L273 TraceCheckUtils]: 8: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,611 INFO L273 TraceCheckUtils]: 9: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,611 INFO L273 TraceCheckUtils]: 10: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,612 INFO L273 TraceCheckUtils]: 15: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,612 INFO L273 TraceCheckUtils]: 16: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,612 INFO L273 TraceCheckUtils]: 17: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,612 INFO L273 TraceCheckUtils]: 18: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,612 INFO L273 TraceCheckUtils]: 19: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,612 INFO L273 TraceCheckUtils]: 20: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 27: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 28: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 29: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,614 INFO L273 TraceCheckUtils]: 32: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,614 INFO L273 TraceCheckUtils]: 33: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,614 INFO L273 TraceCheckUtils]: 34: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,614 INFO L273 TraceCheckUtils]: 35: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,614 INFO L273 TraceCheckUtils]: 40: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 41: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 42: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 43: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 44: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 45: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 48: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 49: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,615 INFO L273 TraceCheckUtils]: 50: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 51: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 52: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 53: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 54: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 55: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 56: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 57: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 58: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 59: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,616 INFO L273 TraceCheckUtils]: 60: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 61: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 62: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 63: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 64: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 65: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 66: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 67: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 68: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 69: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,617 INFO L273 TraceCheckUtils]: 70: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 72: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 73: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 74: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 75: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 76: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 77: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 78: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 79: Hoare triple {20589#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {20589#true} is VALID [2018-11-14 17:09:47,618 INFO L273 TraceCheckUtils]: 80: Hoare triple {20589#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L273 TraceCheckUtils]: 81: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {20589#true} assume !(~i~1 < 1000); {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L256 TraceCheckUtils]: 83: Hoare triple {20589#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L273 TraceCheckUtils]: 84: Hoare triple {20589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L273 TraceCheckUtils]: 85: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L273 TraceCheckUtils]: 86: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L273 TraceCheckUtils]: 87: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L273 TraceCheckUtils]: 88: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L273 TraceCheckUtils]: 89: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,619 INFO L273 TraceCheckUtils]: 90: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,620 INFO L273 TraceCheckUtils]: 91: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,620 INFO L273 TraceCheckUtils]: 92: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,620 INFO L273 TraceCheckUtils]: 93: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,620 INFO L273 TraceCheckUtils]: 94: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,620 INFO L273 TraceCheckUtils]: 95: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,620 INFO L273 TraceCheckUtils]: 96: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,620 INFO L273 TraceCheckUtils]: 97: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,620 INFO L273 TraceCheckUtils]: 98: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,621 INFO L273 TraceCheckUtils]: 99: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,621 INFO L273 TraceCheckUtils]: 100: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,621 INFO L273 TraceCheckUtils]: 101: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,621 INFO L273 TraceCheckUtils]: 102: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,621 INFO L273 TraceCheckUtils]: 103: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,621 INFO L273 TraceCheckUtils]: 104: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,622 INFO L273 TraceCheckUtils]: 105: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,622 INFO L273 TraceCheckUtils]: 106: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,622 INFO L273 TraceCheckUtils]: 107: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,622 INFO L273 TraceCheckUtils]: 108: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,622 INFO L273 TraceCheckUtils]: 109: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,622 INFO L273 TraceCheckUtils]: 110: Hoare triple {20589#true} assume !(~i~0 < 1000); {20589#true} is VALID [2018-11-14 17:09:47,622 INFO L273 TraceCheckUtils]: 111: Hoare triple {20589#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L273 TraceCheckUtils]: 112: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {20589#true} {20589#true} #73#return; {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L273 TraceCheckUtils]: 114: Hoare triple {20589#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L256 TraceCheckUtils]: 115: Hoare triple {20589#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L273 TraceCheckUtils]: 116: Hoare triple {20589#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L273 TraceCheckUtils]: 117: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L273 TraceCheckUtils]: 118: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L273 TraceCheckUtils]: 119: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L273 TraceCheckUtils]: 120: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,623 INFO L273 TraceCheckUtils]: 121: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 122: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 123: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 124: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 125: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 126: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 127: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 128: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 129: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 130: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,624 INFO L273 TraceCheckUtils]: 131: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 132: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 133: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 134: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 135: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 136: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 137: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 138: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 139: Hoare triple {20589#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 140: Hoare triple {20589#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20589#true} is VALID [2018-11-14 17:09:47,625 INFO L273 TraceCheckUtils]: 141: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,626 INFO L273 TraceCheckUtils]: 142: Hoare triple {20589#true} assume !(~i~0 < 1000); {20589#true} is VALID [2018-11-14 17:09:47,626 INFO L273 TraceCheckUtils]: 143: Hoare triple {20589#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20589#true} is VALID [2018-11-14 17:09:47,626 INFO L273 TraceCheckUtils]: 144: Hoare triple {20589#true} assume true; {20589#true} is VALID [2018-11-14 17:09:47,626 INFO L268 TraceCheckUtils]: 145: Hoare quadruple {20589#true} {20589#true} #75#return; {20589#true} is VALID [2018-11-14 17:09:47,626 INFO L273 TraceCheckUtils]: 146: Hoare triple {20589#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {21058#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:47,627 INFO L273 TraceCheckUtils]: 147: Hoare triple {21058#(<= main_~i~2 0)} assume true; {21058#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:47,627 INFO L273 TraceCheckUtils]: 148: Hoare triple {21058#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21058#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:47,627 INFO L273 TraceCheckUtils]: 149: Hoare triple {21058#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21068#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:47,628 INFO L273 TraceCheckUtils]: 150: Hoare triple {21068#(<= main_~i~2 1)} assume true; {21068#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:47,628 INFO L273 TraceCheckUtils]: 151: Hoare triple {21068#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21068#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:47,628 INFO L273 TraceCheckUtils]: 152: Hoare triple {21068#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21078#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:47,629 INFO L273 TraceCheckUtils]: 153: Hoare triple {21078#(<= main_~i~2 2)} assume true; {21078#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:47,629 INFO L273 TraceCheckUtils]: 154: Hoare triple {21078#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21078#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:47,630 INFO L273 TraceCheckUtils]: 155: Hoare triple {21078#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21088#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:47,630 INFO L273 TraceCheckUtils]: 156: Hoare triple {21088#(<= main_~i~2 3)} assume true; {21088#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:47,631 INFO L273 TraceCheckUtils]: 157: Hoare triple {21088#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21088#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:47,631 INFO L273 TraceCheckUtils]: 158: Hoare triple {21088#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21098#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:47,632 INFO L273 TraceCheckUtils]: 159: Hoare triple {21098#(<= main_~i~2 4)} assume true; {21098#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:47,632 INFO L273 TraceCheckUtils]: 160: Hoare triple {21098#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21098#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:47,633 INFO L273 TraceCheckUtils]: 161: Hoare triple {21098#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21108#(<= main_~i~2 5)} is VALID [2018-11-14 17:09:47,633 INFO L273 TraceCheckUtils]: 162: Hoare triple {21108#(<= main_~i~2 5)} assume true; {21108#(<= main_~i~2 5)} is VALID [2018-11-14 17:09:47,634 INFO L273 TraceCheckUtils]: 163: Hoare triple {21108#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {21108#(<= main_~i~2 5)} is VALID [2018-11-14 17:09:47,634 INFO L273 TraceCheckUtils]: 164: Hoare triple {21108#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {21118#(<= main_~i~2 6)} is VALID [2018-11-14 17:09:47,635 INFO L273 TraceCheckUtils]: 165: Hoare triple {21118#(<= main_~i~2 6)} assume true; {21118#(<= main_~i~2 6)} is VALID [2018-11-14 17:09:47,636 INFO L273 TraceCheckUtils]: 166: Hoare triple {21118#(<= main_~i~2 6)} assume !(~i~2 < 999); {20590#false} is VALID [2018-11-14 17:09:47,636 INFO L273 TraceCheckUtils]: 167: Hoare triple {20590#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {20590#false} is VALID [2018-11-14 17:09:47,636 INFO L256 TraceCheckUtils]: 168: Hoare triple {20590#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {20590#false} is VALID [2018-11-14 17:09:47,636 INFO L273 TraceCheckUtils]: 169: Hoare triple {20590#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {20590#false} is VALID [2018-11-14 17:09:47,636 INFO L273 TraceCheckUtils]: 170: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,636 INFO L273 TraceCheckUtils]: 171: Hoare triple {20590#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20590#false} is VALID [2018-11-14 17:09:47,637 INFO L273 TraceCheckUtils]: 172: Hoare triple {20590#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20590#false} is VALID [2018-11-14 17:09:47,637 INFO L273 TraceCheckUtils]: 173: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,637 INFO L273 TraceCheckUtils]: 174: Hoare triple {20590#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20590#false} is VALID [2018-11-14 17:09:47,637 INFO L273 TraceCheckUtils]: 175: Hoare triple {20590#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20590#false} is VALID [2018-11-14 17:09:47,637 INFO L273 TraceCheckUtils]: 176: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,637 INFO L273 TraceCheckUtils]: 177: Hoare triple {20590#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20590#false} is VALID [2018-11-14 17:09:47,638 INFO L273 TraceCheckUtils]: 178: Hoare triple {20590#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20590#false} is VALID [2018-11-14 17:09:47,638 INFO L273 TraceCheckUtils]: 179: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,638 INFO L273 TraceCheckUtils]: 180: Hoare triple {20590#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20590#false} is VALID [2018-11-14 17:09:47,638 INFO L273 TraceCheckUtils]: 181: Hoare triple {20590#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20590#false} is VALID [2018-11-14 17:09:47,638 INFO L273 TraceCheckUtils]: 182: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,638 INFO L273 TraceCheckUtils]: 183: Hoare triple {20590#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20590#false} is VALID [2018-11-14 17:09:47,639 INFO L273 TraceCheckUtils]: 184: Hoare triple {20590#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20590#false} is VALID [2018-11-14 17:09:47,639 INFO L273 TraceCheckUtils]: 185: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,639 INFO L273 TraceCheckUtils]: 186: Hoare triple {20590#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20590#false} is VALID [2018-11-14 17:09:47,639 INFO L273 TraceCheckUtils]: 187: Hoare triple {20590#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20590#false} is VALID [2018-11-14 17:09:47,639 INFO L273 TraceCheckUtils]: 188: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,639 INFO L273 TraceCheckUtils]: 189: Hoare triple {20590#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20590#false} is VALID [2018-11-14 17:09:47,640 INFO L273 TraceCheckUtils]: 190: Hoare triple {20590#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20590#false} is VALID [2018-11-14 17:09:47,640 INFO L273 TraceCheckUtils]: 191: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,640 INFO L273 TraceCheckUtils]: 192: Hoare triple {20590#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {20590#false} is VALID [2018-11-14 17:09:47,640 INFO L273 TraceCheckUtils]: 193: Hoare triple {20590#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {20590#false} is VALID [2018-11-14 17:09:47,640 INFO L273 TraceCheckUtils]: 194: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,640 INFO L273 TraceCheckUtils]: 195: Hoare triple {20590#false} assume !(~i~0 < 1000); {20590#false} is VALID [2018-11-14 17:09:47,640 INFO L273 TraceCheckUtils]: 196: Hoare triple {20590#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {20590#false} is VALID [2018-11-14 17:09:47,640 INFO L273 TraceCheckUtils]: 197: Hoare triple {20590#false} assume true; {20590#false} is VALID [2018-11-14 17:09:47,641 INFO L268 TraceCheckUtils]: 198: Hoare quadruple {20590#false} {20590#false} #77#return; {20590#false} is VALID [2018-11-14 17:09:47,641 INFO L273 TraceCheckUtils]: 199: Hoare triple {20590#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {20590#false} is VALID [2018-11-14 17:09:47,641 INFO L273 TraceCheckUtils]: 200: Hoare triple {20590#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {20590#false} is VALID [2018-11-14 17:09:47,641 INFO L273 TraceCheckUtils]: 201: Hoare triple {20590#false} assume !false; {20590#false} is VALID [2018-11-14 17:09:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1997 backedges. 460 proven. 57 refuted. 0 times theorem prover too weak. 1480 trivial. 0 not checked. [2018-11-14 17:09:47,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:47,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 9] total 35 [2018-11-14 17:09:47,678 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 202 [2018-11-14 17:09:47,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:47,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 17:09:47,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:47,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 17:09:47,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 17:09:47,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:09:47,841 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 35 states. [2018-11-14 17:09:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:48,612 INFO L93 Difference]: Finished difference Result 211 states and 220 transitions. [2018-11-14 17:09:48,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 17:09:48,612 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 202 [2018-11-14 17:09:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:09:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 157 transitions. [2018-11-14 17:09:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:09:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 157 transitions. [2018-11-14 17:09:48,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 157 transitions. [2018-11-14 17:09:48,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:48,754 INFO L225 Difference]: With dead ends: 211 [2018-11-14 17:09:48,754 INFO L226 Difference]: Without dead ends: 151 [2018-11-14 17:09:48,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 17:09:48,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-14 17:09:48,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-11-14 17:09:48,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:48,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 149 states. [2018-11-14 17:09:48,798 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 149 states. [2018-11-14 17:09:48,798 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 149 states. [2018-11-14 17:09:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:48,801 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-11-14 17:09:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-14 17:09:48,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:48,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:48,802 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 151 states. [2018-11-14 17:09:48,802 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 151 states. [2018-11-14 17:09:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:48,807 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2018-11-14 17:09:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2018-11-14 17:09:48,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:48,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:48,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:48,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-14 17:09:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2018-11-14 17:09:48,811 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 202 [2018-11-14 17:09:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:48,811 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2018-11-14 17:09:48,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 17:09:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2018-11-14 17:09:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-11-14 17:09:48,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:48,813 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 24, 24, 8, 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-14 17:09:48,813 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:48,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash 387573854, now seen corresponding path program 25 times [2018-11-14 17:09:48,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:48,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:48,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:49,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {22015#true} call ULTIMATE.init(); {22015#true} is VALID [2018-11-14 17:09:49,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {22015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22015#true} is VALID [2018-11-14 17:09:49,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22015#true} {22015#true} #69#return; {22015#true} is VALID [2018-11-14 17:09:49,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {22015#true} call #t~ret13 := main(); {22015#true} is VALID [2018-11-14 17:09:49,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {22015#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22017#(= main_~i~1 0)} is VALID [2018-11-14 17:09:49,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {22017#(= main_~i~1 0)} assume true; {22017#(= main_~i~1 0)} is VALID [2018-11-14 17:09:49,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {22017#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22017#(= main_~i~1 0)} is VALID [2018-11-14 17:09:49,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {22017#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22018#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:49,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {22018#(<= main_~i~1 1)} assume true; {22018#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:49,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {22018#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22018#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:49,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {22018#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22019#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:49,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {22019#(<= main_~i~1 2)} assume true; {22019#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:49,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {22019#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22019#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:49,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {22019#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22020#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:49,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {22020#(<= main_~i~1 3)} assume true; {22020#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:49,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {22020#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22020#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:49,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {22020#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22021#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:49,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {22021#(<= main_~i~1 4)} assume true; {22021#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:49,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {22021#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22021#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:49,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {22021#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22022#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:49,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {22022#(<= main_~i~1 5)} assume true; {22022#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:49,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {22022#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22022#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:49,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {22022#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22023#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:49,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {22023#(<= main_~i~1 6)} assume true; {22023#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:49,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {22023#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22023#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:49,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {22023#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22024#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:49,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {22024#(<= main_~i~1 7)} assume true; {22024#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:49,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {22024#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22024#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:49,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {22024#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22025#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:49,416 INFO L273 TraceCheckUtils]: 30: Hoare triple {22025#(<= main_~i~1 8)} assume true; {22025#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:49,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {22025#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22025#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:49,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {22025#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22026#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:49,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {22026#(<= main_~i~1 9)} assume true; {22026#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:49,418 INFO L273 TraceCheckUtils]: 34: Hoare triple {22026#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22026#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:49,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {22026#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22027#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:49,420 INFO L273 TraceCheckUtils]: 36: Hoare triple {22027#(<= main_~i~1 10)} assume true; {22027#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:49,420 INFO L273 TraceCheckUtils]: 37: Hoare triple {22027#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22027#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:49,421 INFO L273 TraceCheckUtils]: 38: Hoare triple {22027#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22028#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:49,421 INFO L273 TraceCheckUtils]: 39: Hoare triple {22028#(<= main_~i~1 11)} assume true; {22028#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:49,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {22028#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22028#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:49,422 INFO L273 TraceCheckUtils]: 41: Hoare triple {22028#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22029#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:49,423 INFO L273 TraceCheckUtils]: 42: Hoare triple {22029#(<= main_~i~1 12)} assume true; {22029#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:49,423 INFO L273 TraceCheckUtils]: 43: Hoare triple {22029#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22029#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:49,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {22029#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22030#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:49,424 INFO L273 TraceCheckUtils]: 45: Hoare triple {22030#(<= main_~i~1 13)} assume true; {22030#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:49,425 INFO L273 TraceCheckUtils]: 46: Hoare triple {22030#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22030#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:49,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {22030#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22031#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:49,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {22031#(<= main_~i~1 14)} assume true; {22031#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:49,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {22031#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22031#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:49,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {22031#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22032#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:49,428 INFO L273 TraceCheckUtils]: 51: Hoare triple {22032#(<= main_~i~1 15)} assume true; {22032#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:49,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {22032#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22032#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:49,429 INFO L273 TraceCheckUtils]: 53: Hoare triple {22032#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22033#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:49,429 INFO L273 TraceCheckUtils]: 54: Hoare triple {22033#(<= main_~i~1 16)} assume true; {22033#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:49,430 INFO L273 TraceCheckUtils]: 55: Hoare triple {22033#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22033#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:49,430 INFO L273 TraceCheckUtils]: 56: Hoare triple {22033#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22034#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:49,431 INFO L273 TraceCheckUtils]: 57: Hoare triple {22034#(<= main_~i~1 17)} assume true; {22034#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:49,431 INFO L273 TraceCheckUtils]: 58: Hoare triple {22034#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22034#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:49,432 INFO L273 TraceCheckUtils]: 59: Hoare triple {22034#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22035#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:49,432 INFO L273 TraceCheckUtils]: 60: Hoare triple {22035#(<= main_~i~1 18)} assume true; {22035#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:49,433 INFO L273 TraceCheckUtils]: 61: Hoare triple {22035#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22035#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:49,434 INFO L273 TraceCheckUtils]: 62: Hoare triple {22035#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22036#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:49,434 INFO L273 TraceCheckUtils]: 63: Hoare triple {22036#(<= main_~i~1 19)} assume true; {22036#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:49,435 INFO L273 TraceCheckUtils]: 64: Hoare triple {22036#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22036#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:49,435 INFO L273 TraceCheckUtils]: 65: Hoare triple {22036#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22037#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:49,436 INFO L273 TraceCheckUtils]: 66: Hoare triple {22037#(<= main_~i~1 20)} assume true; {22037#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:49,436 INFO L273 TraceCheckUtils]: 67: Hoare triple {22037#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22037#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:49,437 INFO L273 TraceCheckUtils]: 68: Hoare triple {22037#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22038#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:49,438 INFO L273 TraceCheckUtils]: 69: Hoare triple {22038#(<= main_~i~1 21)} assume true; {22038#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:49,438 INFO L273 TraceCheckUtils]: 70: Hoare triple {22038#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22038#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:49,439 INFO L273 TraceCheckUtils]: 71: Hoare triple {22038#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22039#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:49,439 INFO L273 TraceCheckUtils]: 72: Hoare triple {22039#(<= main_~i~1 22)} assume true; {22039#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:49,440 INFO L273 TraceCheckUtils]: 73: Hoare triple {22039#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22039#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:49,440 INFO L273 TraceCheckUtils]: 74: Hoare triple {22039#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22040#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:49,441 INFO L273 TraceCheckUtils]: 75: Hoare triple {22040#(<= main_~i~1 23)} assume true; {22040#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:49,441 INFO L273 TraceCheckUtils]: 76: Hoare triple {22040#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22040#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:49,442 INFO L273 TraceCheckUtils]: 77: Hoare triple {22040#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22041#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:49,443 INFO L273 TraceCheckUtils]: 78: Hoare triple {22041#(<= main_~i~1 24)} assume true; {22041#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:49,443 INFO L273 TraceCheckUtils]: 79: Hoare triple {22041#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22041#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:49,444 INFO L273 TraceCheckUtils]: 80: Hoare triple {22041#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22042#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:49,444 INFO L273 TraceCheckUtils]: 81: Hoare triple {22042#(<= main_~i~1 25)} assume true; {22042#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:49,445 INFO L273 TraceCheckUtils]: 82: Hoare triple {22042#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22042#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:49,445 INFO L273 TraceCheckUtils]: 83: Hoare triple {22042#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22043#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:49,446 INFO L273 TraceCheckUtils]: 84: Hoare triple {22043#(<= main_~i~1 26)} assume true; {22043#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:49,446 INFO L273 TraceCheckUtils]: 85: Hoare triple {22043#(<= main_~i~1 26)} assume !(~i~1 < 1000); {22016#false} is VALID [2018-11-14 17:09:49,447 INFO L256 TraceCheckUtils]: 86: Hoare triple {22016#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {22015#true} is VALID [2018-11-14 17:09:49,447 INFO L273 TraceCheckUtils]: 87: Hoare triple {22015#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22015#true} is VALID [2018-11-14 17:09:49,447 INFO L273 TraceCheckUtils]: 88: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,447 INFO L273 TraceCheckUtils]: 89: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,447 INFO L273 TraceCheckUtils]: 90: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,447 INFO L273 TraceCheckUtils]: 91: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,448 INFO L273 TraceCheckUtils]: 92: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,448 INFO L273 TraceCheckUtils]: 93: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,448 INFO L273 TraceCheckUtils]: 94: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,448 INFO L273 TraceCheckUtils]: 95: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,448 INFO L273 TraceCheckUtils]: 96: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,448 INFO L273 TraceCheckUtils]: 97: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,449 INFO L273 TraceCheckUtils]: 98: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,449 INFO L273 TraceCheckUtils]: 99: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,449 INFO L273 TraceCheckUtils]: 100: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,449 INFO L273 TraceCheckUtils]: 101: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,449 INFO L273 TraceCheckUtils]: 102: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,449 INFO L273 TraceCheckUtils]: 103: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 104: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 105: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 106: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 107: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 108: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 109: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 110: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 111: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 112: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,450 INFO L273 TraceCheckUtils]: 113: Hoare triple {22015#true} assume !(~i~0 < 1000); {22015#true} is VALID [2018-11-14 17:09:49,451 INFO L273 TraceCheckUtils]: 114: Hoare triple {22015#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22015#true} is VALID [2018-11-14 17:09:49,451 INFO L273 TraceCheckUtils]: 115: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,451 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {22015#true} {22016#false} #73#return; {22016#false} is VALID [2018-11-14 17:09:49,451 INFO L273 TraceCheckUtils]: 117: Hoare triple {22016#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {22016#false} is VALID [2018-11-14 17:09:49,451 INFO L256 TraceCheckUtils]: 118: Hoare triple {22016#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {22015#true} is VALID [2018-11-14 17:09:49,451 INFO L273 TraceCheckUtils]: 119: Hoare triple {22015#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22015#true} is VALID [2018-11-14 17:09:49,451 INFO L273 TraceCheckUtils]: 120: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,451 INFO L273 TraceCheckUtils]: 121: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,451 INFO L273 TraceCheckUtils]: 122: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,451 INFO L273 TraceCheckUtils]: 123: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 124: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 125: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 126: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 127: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 128: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 129: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 130: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 131: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 132: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,452 INFO L273 TraceCheckUtils]: 133: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,453 INFO L273 TraceCheckUtils]: 134: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,453 INFO L273 TraceCheckUtils]: 135: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,453 INFO L273 TraceCheckUtils]: 136: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,453 INFO L273 TraceCheckUtils]: 137: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,453 INFO L273 TraceCheckUtils]: 138: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,453 INFO L273 TraceCheckUtils]: 139: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,453 INFO L273 TraceCheckUtils]: 140: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,453 INFO L273 TraceCheckUtils]: 141: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,453 INFO L273 TraceCheckUtils]: 142: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,454 INFO L273 TraceCheckUtils]: 143: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,454 INFO L273 TraceCheckUtils]: 144: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,454 INFO L273 TraceCheckUtils]: 145: Hoare triple {22015#true} assume !(~i~0 < 1000); {22015#true} is VALID [2018-11-14 17:09:49,454 INFO L273 TraceCheckUtils]: 146: Hoare triple {22015#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22015#true} is VALID [2018-11-14 17:09:49,454 INFO L273 TraceCheckUtils]: 147: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,454 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {22015#true} {22016#false} #75#return; {22016#false} is VALID [2018-11-14 17:09:49,454 INFO L273 TraceCheckUtils]: 149: Hoare triple {22016#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22016#false} is VALID [2018-11-14 17:09:49,454 INFO L273 TraceCheckUtils]: 150: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:49,454 INFO L273 TraceCheckUtils]: 151: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:49,454 INFO L273 TraceCheckUtils]: 152: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 153: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 154: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 155: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 156: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 157: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 158: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 159: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 160: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 161: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:49,455 INFO L273 TraceCheckUtils]: 162: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 163: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 164: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 165: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 166: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 167: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 168: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 169: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 170: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 171: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:49,456 INFO L273 TraceCheckUtils]: 172: Hoare triple {22016#false} assume !(~i~2 < 999); {22016#false} is VALID [2018-11-14 17:09:49,457 INFO L273 TraceCheckUtils]: 173: Hoare triple {22016#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {22016#false} is VALID [2018-11-14 17:09:49,457 INFO L256 TraceCheckUtils]: 174: Hoare triple {22016#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {22015#true} is VALID [2018-11-14 17:09:49,457 INFO L273 TraceCheckUtils]: 175: Hoare triple {22015#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22015#true} is VALID [2018-11-14 17:09:49,457 INFO L273 TraceCheckUtils]: 176: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,457 INFO L273 TraceCheckUtils]: 177: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,457 INFO L273 TraceCheckUtils]: 178: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,457 INFO L273 TraceCheckUtils]: 179: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,457 INFO L273 TraceCheckUtils]: 180: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,457 INFO L273 TraceCheckUtils]: 181: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,457 INFO L273 TraceCheckUtils]: 182: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 183: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 184: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 185: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 186: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 187: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 188: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 189: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 190: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 191: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,458 INFO L273 TraceCheckUtils]: 192: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,459 INFO L273 TraceCheckUtils]: 193: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,459 INFO L273 TraceCheckUtils]: 194: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,459 INFO L273 TraceCheckUtils]: 195: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,459 INFO L273 TraceCheckUtils]: 196: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,459 INFO L273 TraceCheckUtils]: 197: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,459 INFO L273 TraceCheckUtils]: 198: Hoare triple {22015#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22015#true} is VALID [2018-11-14 17:09:49,459 INFO L273 TraceCheckUtils]: 199: Hoare triple {22015#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22015#true} is VALID [2018-11-14 17:09:49,459 INFO L273 TraceCheckUtils]: 200: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,459 INFO L273 TraceCheckUtils]: 201: Hoare triple {22015#true} assume !(~i~0 < 1000); {22015#true} is VALID [2018-11-14 17:09:49,460 INFO L273 TraceCheckUtils]: 202: Hoare triple {22015#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22015#true} is VALID [2018-11-14 17:09:49,460 INFO L273 TraceCheckUtils]: 203: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,460 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {22015#true} {22016#false} #77#return; {22016#false} is VALID [2018-11-14 17:09:49,460 INFO L273 TraceCheckUtils]: 205: Hoare triple {22016#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22016#false} is VALID [2018-11-14 17:09:49,460 INFO L273 TraceCheckUtils]: 206: Hoare triple {22016#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22016#false} is VALID [2018-11-14 17:09:49,460 INFO L273 TraceCheckUtils]: 207: Hoare triple {22016#false} assume !false; {22016#false} is VALID [2018-11-14 17:09:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:09:49,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:49,480 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-14 17:09:49,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:09:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:49,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:49,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {22015#true} call ULTIMATE.init(); {22015#true} is VALID [2018-11-14 17:09:49,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {22015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22015#true} is VALID [2018-11-14 17:09:49,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {22015#true} assume true; {22015#true} is VALID [2018-11-14 17:09:49,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22015#true} {22015#true} #69#return; {22015#true} is VALID [2018-11-14 17:09:49,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {22015#true} call #t~ret13 := main(); {22015#true} is VALID [2018-11-14 17:09:49,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {22015#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {22062#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:49,974 INFO L273 TraceCheckUtils]: 6: Hoare triple {22062#(<= main_~i~1 0)} assume true; {22062#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:49,975 INFO L273 TraceCheckUtils]: 7: Hoare triple {22062#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22062#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:49,975 INFO L273 TraceCheckUtils]: 8: Hoare triple {22062#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22018#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:49,976 INFO L273 TraceCheckUtils]: 9: Hoare triple {22018#(<= main_~i~1 1)} assume true; {22018#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:49,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {22018#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22018#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:49,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {22018#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22019#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:49,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {22019#(<= main_~i~1 2)} assume true; {22019#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:49,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {22019#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22019#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:49,978 INFO L273 TraceCheckUtils]: 14: Hoare triple {22019#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22020#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:49,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {22020#(<= main_~i~1 3)} assume true; {22020#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:49,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {22020#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22020#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:49,979 INFO L273 TraceCheckUtils]: 17: Hoare triple {22020#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22021#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:49,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {22021#(<= main_~i~1 4)} assume true; {22021#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:49,980 INFO L273 TraceCheckUtils]: 19: Hoare triple {22021#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22021#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:49,980 INFO L273 TraceCheckUtils]: 20: Hoare triple {22021#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22022#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:49,981 INFO L273 TraceCheckUtils]: 21: Hoare triple {22022#(<= main_~i~1 5)} assume true; {22022#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:49,981 INFO L273 TraceCheckUtils]: 22: Hoare triple {22022#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22022#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:49,982 INFO L273 TraceCheckUtils]: 23: Hoare triple {22022#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22023#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:49,982 INFO L273 TraceCheckUtils]: 24: Hoare triple {22023#(<= main_~i~1 6)} assume true; {22023#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:49,983 INFO L273 TraceCheckUtils]: 25: Hoare triple {22023#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22023#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:49,983 INFO L273 TraceCheckUtils]: 26: Hoare triple {22023#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22024#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:49,984 INFO L273 TraceCheckUtils]: 27: Hoare triple {22024#(<= main_~i~1 7)} assume true; {22024#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:49,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {22024#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22024#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:49,985 INFO L273 TraceCheckUtils]: 29: Hoare triple {22024#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22025#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:49,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {22025#(<= main_~i~1 8)} assume true; {22025#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:49,986 INFO L273 TraceCheckUtils]: 31: Hoare triple {22025#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22025#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:49,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {22025#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22026#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:49,987 INFO L273 TraceCheckUtils]: 33: Hoare triple {22026#(<= main_~i~1 9)} assume true; {22026#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:49,988 INFO L273 TraceCheckUtils]: 34: Hoare triple {22026#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22026#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:49,988 INFO L273 TraceCheckUtils]: 35: Hoare triple {22026#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22027#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:49,989 INFO L273 TraceCheckUtils]: 36: Hoare triple {22027#(<= main_~i~1 10)} assume true; {22027#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:49,989 INFO L273 TraceCheckUtils]: 37: Hoare triple {22027#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22027#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:49,999 INFO L273 TraceCheckUtils]: 38: Hoare triple {22027#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22028#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:49,999 INFO L273 TraceCheckUtils]: 39: Hoare triple {22028#(<= main_~i~1 11)} assume true; {22028#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:49,999 INFO L273 TraceCheckUtils]: 40: Hoare triple {22028#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22028#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:50,000 INFO L273 TraceCheckUtils]: 41: Hoare triple {22028#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22029#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:50,000 INFO L273 TraceCheckUtils]: 42: Hoare triple {22029#(<= main_~i~1 12)} assume true; {22029#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:50,000 INFO L273 TraceCheckUtils]: 43: Hoare triple {22029#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22029#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:50,001 INFO L273 TraceCheckUtils]: 44: Hoare triple {22029#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22030#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:50,001 INFO L273 TraceCheckUtils]: 45: Hoare triple {22030#(<= main_~i~1 13)} assume true; {22030#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:50,001 INFO L273 TraceCheckUtils]: 46: Hoare triple {22030#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22030#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:50,002 INFO L273 TraceCheckUtils]: 47: Hoare triple {22030#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22031#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:50,002 INFO L273 TraceCheckUtils]: 48: Hoare triple {22031#(<= main_~i~1 14)} assume true; {22031#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:50,002 INFO L273 TraceCheckUtils]: 49: Hoare triple {22031#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22031#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:50,003 INFO L273 TraceCheckUtils]: 50: Hoare triple {22031#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22032#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:50,003 INFO L273 TraceCheckUtils]: 51: Hoare triple {22032#(<= main_~i~1 15)} assume true; {22032#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:50,004 INFO L273 TraceCheckUtils]: 52: Hoare triple {22032#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22032#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:50,005 INFO L273 TraceCheckUtils]: 53: Hoare triple {22032#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22033#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:50,005 INFO L273 TraceCheckUtils]: 54: Hoare triple {22033#(<= main_~i~1 16)} assume true; {22033#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:50,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {22033#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22033#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:50,006 INFO L273 TraceCheckUtils]: 56: Hoare triple {22033#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22034#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:50,007 INFO L273 TraceCheckUtils]: 57: Hoare triple {22034#(<= main_~i~1 17)} assume true; {22034#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:50,007 INFO L273 TraceCheckUtils]: 58: Hoare triple {22034#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22034#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:50,008 INFO L273 TraceCheckUtils]: 59: Hoare triple {22034#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22035#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:50,008 INFO L273 TraceCheckUtils]: 60: Hoare triple {22035#(<= main_~i~1 18)} assume true; {22035#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:50,009 INFO L273 TraceCheckUtils]: 61: Hoare triple {22035#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22035#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:50,010 INFO L273 TraceCheckUtils]: 62: Hoare triple {22035#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22036#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:50,010 INFO L273 TraceCheckUtils]: 63: Hoare triple {22036#(<= main_~i~1 19)} assume true; {22036#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:50,011 INFO L273 TraceCheckUtils]: 64: Hoare triple {22036#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22036#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:50,011 INFO L273 TraceCheckUtils]: 65: Hoare triple {22036#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22037#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:50,012 INFO L273 TraceCheckUtils]: 66: Hoare triple {22037#(<= main_~i~1 20)} assume true; {22037#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:50,012 INFO L273 TraceCheckUtils]: 67: Hoare triple {22037#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22037#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:50,013 INFO L273 TraceCheckUtils]: 68: Hoare triple {22037#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22038#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:50,013 INFO L273 TraceCheckUtils]: 69: Hoare triple {22038#(<= main_~i~1 21)} assume true; {22038#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:50,014 INFO L273 TraceCheckUtils]: 70: Hoare triple {22038#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22038#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:50,014 INFO L273 TraceCheckUtils]: 71: Hoare triple {22038#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22039#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:50,015 INFO L273 TraceCheckUtils]: 72: Hoare triple {22039#(<= main_~i~1 22)} assume true; {22039#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:50,015 INFO L273 TraceCheckUtils]: 73: Hoare triple {22039#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22039#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:50,016 INFO L273 TraceCheckUtils]: 74: Hoare triple {22039#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22040#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:50,017 INFO L273 TraceCheckUtils]: 75: Hoare triple {22040#(<= main_~i~1 23)} assume true; {22040#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:50,017 INFO L273 TraceCheckUtils]: 76: Hoare triple {22040#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22040#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:50,018 INFO L273 TraceCheckUtils]: 77: Hoare triple {22040#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22041#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:50,018 INFO L273 TraceCheckUtils]: 78: Hoare triple {22041#(<= main_~i~1 24)} assume true; {22041#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:50,019 INFO L273 TraceCheckUtils]: 79: Hoare triple {22041#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22041#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:50,019 INFO L273 TraceCheckUtils]: 80: Hoare triple {22041#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22042#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:50,020 INFO L273 TraceCheckUtils]: 81: Hoare triple {22042#(<= main_~i~1 25)} assume true; {22042#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:50,020 INFO L273 TraceCheckUtils]: 82: Hoare triple {22042#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {22042#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:50,021 INFO L273 TraceCheckUtils]: 83: Hoare triple {22042#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {22043#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:50,021 INFO L273 TraceCheckUtils]: 84: Hoare triple {22043#(<= main_~i~1 26)} assume true; {22043#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:50,022 INFO L273 TraceCheckUtils]: 85: Hoare triple {22043#(<= main_~i~1 26)} assume !(~i~1 < 1000); {22016#false} is VALID [2018-11-14 17:09:50,022 INFO L256 TraceCheckUtils]: 86: Hoare triple {22016#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {22016#false} is VALID [2018-11-14 17:09:50,022 INFO L273 TraceCheckUtils]: 87: Hoare triple {22016#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22016#false} is VALID [2018-11-14 17:09:50,023 INFO L273 TraceCheckUtils]: 88: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,023 INFO L273 TraceCheckUtils]: 89: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,023 INFO L273 TraceCheckUtils]: 90: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,023 INFO L273 TraceCheckUtils]: 91: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,023 INFO L273 TraceCheckUtils]: 92: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,023 INFO L273 TraceCheckUtils]: 93: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,024 INFO L273 TraceCheckUtils]: 94: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,024 INFO L273 TraceCheckUtils]: 95: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,024 INFO L273 TraceCheckUtils]: 96: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,024 INFO L273 TraceCheckUtils]: 97: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,024 INFO L273 TraceCheckUtils]: 98: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,024 INFO L273 TraceCheckUtils]: 99: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,025 INFO L273 TraceCheckUtils]: 100: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,025 INFO L273 TraceCheckUtils]: 101: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,025 INFO L273 TraceCheckUtils]: 102: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,025 INFO L273 TraceCheckUtils]: 103: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,025 INFO L273 TraceCheckUtils]: 104: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,025 INFO L273 TraceCheckUtils]: 105: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,026 INFO L273 TraceCheckUtils]: 106: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,026 INFO L273 TraceCheckUtils]: 107: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,026 INFO L273 TraceCheckUtils]: 108: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,026 INFO L273 TraceCheckUtils]: 109: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,026 INFO L273 TraceCheckUtils]: 110: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,026 INFO L273 TraceCheckUtils]: 111: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,027 INFO L273 TraceCheckUtils]: 112: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,027 INFO L273 TraceCheckUtils]: 113: Hoare triple {22016#false} assume !(~i~0 < 1000); {22016#false} is VALID [2018-11-14 17:09:50,027 INFO L273 TraceCheckUtils]: 114: Hoare triple {22016#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22016#false} is VALID [2018-11-14 17:09:50,027 INFO L273 TraceCheckUtils]: 115: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,027 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {22016#false} {22016#false} #73#return; {22016#false} is VALID [2018-11-14 17:09:50,027 INFO L273 TraceCheckUtils]: 117: Hoare triple {22016#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {22016#false} is VALID [2018-11-14 17:09:50,027 INFO L256 TraceCheckUtils]: 118: Hoare triple {22016#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {22016#false} is VALID [2018-11-14 17:09:50,027 INFO L273 TraceCheckUtils]: 119: Hoare triple {22016#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22016#false} is VALID [2018-11-14 17:09:50,027 INFO L273 TraceCheckUtils]: 120: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 121: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 122: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 123: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 124: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 125: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 126: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 127: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 128: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 129: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,028 INFO L273 TraceCheckUtils]: 130: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 131: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 132: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 133: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 134: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 135: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 136: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 137: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 138: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 139: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,029 INFO L273 TraceCheckUtils]: 140: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L273 TraceCheckUtils]: 141: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L273 TraceCheckUtils]: 142: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L273 TraceCheckUtils]: 143: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L273 TraceCheckUtils]: 144: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L273 TraceCheckUtils]: 145: Hoare triple {22016#false} assume !(~i~0 < 1000); {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L273 TraceCheckUtils]: 146: Hoare triple {22016#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L273 TraceCheckUtils]: 147: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L268 TraceCheckUtils]: 148: Hoare quadruple {22016#false} {22016#false} #75#return; {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L273 TraceCheckUtils]: 149: Hoare triple {22016#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {22016#false} is VALID [2018-11-14 17:09:50,030 INFO L273 TraceCheckUtils]: 150: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 151: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 152: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 153: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 154: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 155: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 156: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 157: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 158: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 159: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,031 INFO L273 TraceCheckUtils]: 160: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 161: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 162: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 163: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 164: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 165: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 166: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 167: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 168: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 169: Hoare triple {22016#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {22016#false} is VALID [2018-11-14 17:09:50,032 INFO L273 TraceCheckUtils]: 170: Hoare triple {22016#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {22016#false} is VALID [2018-11-14 17:09:50,033 INFO L273 TraceCheckUtils]: 171: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,033 INFO L273 TraceCheckUtils]: 172: Hoare triple {22016#false} assume !(~i~2 < 999); {22016#false} is VALID [2018-11-14 17:09:50,033 INFO L273 TraceCheckUtils]: 173: Hoare triple {22016#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {22016#false} is VALID [2018-11-14 17:09:50,033 INFO L256 TraceCheckUtils]: 174: Hoare triple {22016#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {22016#false} is VALID [2018-11-14 17:09:50,033 INFO L273 TraceCheckUtils]: 175: Hoare triple {22016#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {22016#false} is VALID [2018-11-14 17:09:50,033 INFO L273 TraceCheckUtils]: 176: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,033 INFO L273 TraceCheckUtils]: 177: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,034 INFO L273 TraceCheckUtils]: 178: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,034 INFO L273 TraceCheckUtils]: 179: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,034 INFO L273 TraceCheckUtils]: 180: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,034 INFO L273 TraceCheckUtils]: 181: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,034 INFO L273 TraceCheckUtils]: 182: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,034 INFO L273 TraceCheckUtils]: 183: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,035 INFO L273 TraceCheckUtils]: 184: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,035 INFO L273 TraceCheckUtils]: 185: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,035 INFO L273 TraceCheckUtils]: 186: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,035 INFO L273 TraceCheckUtils]: 187: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,035 INFO L273 TraceCheckUtils]: 188: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,035 INFO L273 TraceCheckUtils]: 189: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,035 INFO L273 TraceCheckUtils]: 190: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,036 INFO L273 TraceCheckUtils]: 191: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,036 INFO L273 TraceCheckUtils]: 192: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,036 INFO L273 TraceCheckUtils]: 193: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,036 INFO L273 TraceCheckUtils]: 194: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,036 INFO L273 TraceCheckUtils]: 195: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,036 INFO L273 TraceCheckUtils]: 196: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,037 INFO L273 TraceCheckUtils]: 197: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,037 INFO L273 TraceCheckUtils]: 198: Hoare triple {22016#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {22016#false} is VALID [2018-11-14 17:09:50,037 INFO L273 TraceCheckUtils]: 199: Hoare triple {22016#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {22016#false} is VALID [2018-11-14 17:09:50,037 INFO L273 TraceCheckUtils]: 200: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,037 INFO L273 TraceCheckUtils]: 201: Hoare triple {22016#false} assume !(~i~0 < 1000); {22016#false} is VALID [2018-11-14 17:09:50,037 INFO L273 TraceCheckUtils]: 202: Hoare triple {22016#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {22016#false} is VALID [2018-11-14 17:09:50,037 INFO L273 TraceCheckUtils]: 203: Hoare triple {22016#false} assume true; {22016#false} is VALID [2018-11-14 17:09:50,038 INFO L268 TraceCheckUtils]: 204: Hoare quadruple {22016#false} {22016#false} #77#return; {22016#false} is VALID [2018-11-14 17:09:50,038 INFO L273 TraceCheckUtils]: 205: Hoare triple {22016#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {22016#false} is VALID [2018-11-14 17:09:50,038 INFO L273 TraceCheckUtils]: 206: Hoare triple {22016#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {22016#false} is VALID [2018-11-14 17:09:50,038 INFO L273 TraceCheckUtils]: 207: Hoare triple {22016#false} assume !false; {22016#false} is VALID [2018-11-14 17:09:50,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2094 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:09:50,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:50,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 17:09:50,094 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 208 [2018-11-14 17:09:50,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:50,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 17:09:50,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:50,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 17:09:50,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 17:09:50,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:09:50,221 INFO L87 Difference]: Start difference. First operand 149 states and 153 transitions. Second operand 30 states. [2018-11-14 17:09:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:51,013 INFO L93 Difference]: Finished difference Result 216 states and 224 transitions. [2018-11-14 17:09:51,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 17:09:51,013 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 208 [2018-11-14 17:09:51,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:09:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 138 transitions. [2018-11-14 17:09:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:09:51,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 138 transitions. [2018-11-14 17:09:51,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 138 transitions. [2018-11-14 17:09:51,137 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-14 17:09:51,140 INFO L225 Difference]: With dead ends: 216 [2018-11-14 17:09:51,141 INFO L226 Difference]: Without dead ends: 153 [2018-11-14 17:09:51,142 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 17:09:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-14 17:09:51,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-11-14 17:09:51,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:51,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 152 states. [2018-11-14 17:09:51,192 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 152 states. [2018-11-14 17:09:51,193 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 152 states. [2018-11-14 17:09:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:51,196 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 17:09:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 17:09:51,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:51,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:51,197 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 153 states. [2018-11-14 17:09:51,197 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 153 states. [2018-11-14 17:09:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:51,200 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-11-14 17:09:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-11-14 17:09:51,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:51,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:51,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:51,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-14 17:09:51,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-11-14 17:09:51,203 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 208 [2018-11-14 17:09:51,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:51,203 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-11-14 17:09:51,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 17:09:51,204 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-11-14 17:09:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-14 17:09:51,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:51,205 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 24, 24, 8, 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-14 17:09:51,206 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:51,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash 67051736, now seen corresponding path program 26 times [2018-11-14 17:09:51,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:51,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:51,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:09:51,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:51,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {23469#true} call ULTIMATE.init(); {23469#true} is VALID [2018-11-14 17:09:51,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {23469#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23469#true} is VALID [2018-11-14 17:09:51,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23469#true} {23469#true} #69#return; {23469#true} is VALID [2018-11-14 17:09:51,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {23469#true} call #t~ret13 := main(); {23469#true} is VALID [2018-11-14 17:09:51,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {23469#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23471#(= main_~i~1 0)} is VALID [2018-11-14 17:09:51,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {23471#(= main_~i~1 0)} assume true; {23471#(= main_~i~1 0)} is VALID [2018-11-14 17:09:51,836 INFO L273 TraceCheckUtils]: 7: Hoare triple {23471#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23471#(= main_~i~1 0)} is VALID [2018-11-14 17:09:51,836 INFO L273 TraceCheckUtils]: 8: Hoare triple {23471#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23472#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:51,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {23472#(<= main_~i~1 1)} assume true; {23472#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:51,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {23472#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23472#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:51,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {23472#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23473#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:51,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {23473#(<= main_~i~1 2)} assume true; {23473#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:51,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {23473#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23473#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:51,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {23473#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23474#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:51,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {23474#(<= main_~i~1 3)} assume true; {23474#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:51,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {23474#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23474#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:51,840 INFO L273 TraceCheckUtils]: 17: Hoare triple {23474#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23475#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:51,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {23475#(<= main_~i~1 4)} assume true; {23475#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:51,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {23475#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23475#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:51,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {23475#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23476#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:51,842 INFO L273 TraceCheckUtils]: 21: Hoare triple {23476#(<= main_~i~1 5)} assume true; {23476#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:51,842 INFO L273 TraceCheckUtils]: 22: Hoare triple {23476#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23476#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:51,843 INFO L273 TraceCheckUtils]: 23: Hoare triple {23476#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23477#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:51,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {23477#(<= main_~i~1 6)} assume true; {23477#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:51,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {23477#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23477#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:51,845 INFO L273 TraceCheckUtils]: 26: Hoare triple {23477#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23478#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:51,845 INFO L273 TraceCheckUtils]: 27: Hoare triple {23478#(<= main_~i~1 7)} assume true; {23478#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:51,846 INFO L273 TraceCheckUtils]: 28: Hoare triple {23478#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23478#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:51,846 INFO L273 TraceCheckUtils]: 29: Hoare triple {23478#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23479#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:51,847 INFO L273 TraceCheckUtils]: 30: Hoare triple {23479#(<= main_~i~1 8)} assume true; {23479#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:51,847 INFO L273 TraceCheckUtils]: 31: Hoare triple {23479#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23479#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:51,848 INFO L273 TraceCheckUtils]: 32: Hoare triple {23479#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23480#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:51,848 INFO L273 TraceCheckUtils]: 33: Hoare triple {23480#(<= main_~i~1 9)} assume true; {23480#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:51,849 INFO L273 TraceCheckUtils]: 34: Hoare triple {23480#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23480#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:51,850 INFO L273 TraceCheckUtils]: 35: Hoare triple {23480#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23481#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:51,850 INFO L273 TraceCheckUtils]: 36: Hoare triple {23481#(<= main_~i~1 10)} assume true; {23481#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:51,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {23481#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23481#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:51,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {23481#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23482#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:51,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {23482#(<= main_~i~1 11)} assume true; {23482#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:51,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {23482#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23482#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:51,853 INFO L273 TraceCheckUtils]: 41: Hoare triple {23482#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23483#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:51,853 INFO L273 TraceCheckUtils]: 42: Hoare triple {23483#(<= main_~i~1 12)} assume true; {23483#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:51,854 INFO L273 TraceCheckUtils]: 43: Hoare triple {23483#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23483#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:51,854 INFO L273 TraceCheckUtils]: 44: Hoare triple {23483#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23484#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:51,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {23484#(<= main_~i~1 13)} assume true; {23484#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:51,855 INFO L273 TraceCheckUtils]: 46: Hoare triple {23484#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23484#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:51,856 INFO L273 TraceCheckUtils]: 47: Hoare triple {23484#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23485#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:51,857 INFO L273 TraceCheckUtils]: 48: Hoare triple {23485#(<= main_~i~1 14)} assume true; {23485#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:51,857 INFO L273 TraceCheckUtils]: 49: Hoare triple {23485#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23485#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:51,858 INFO L273 TraceCheckUtils]: 50: Hoare triple {23485#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23486#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:51,858 INFO L273 TraceCheckUtils]: 51: Hoare triple {23486#(<= main_~i~1 15)} assume true; {23486#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:51,859 INFO L273 TraceCheckUtils]: 52: Hoare triple {23486#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23486#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:51,859 INFO L273 TraceCheckUtils]: 53: Hoare triple {23486#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23487#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:51,860 INFO L273 TraceCheckUtils]: 54: Hoare triple {23487#(<= main_~i~1 16)} assume true; {23487#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:51,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {23487#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23487#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:51,861 INFO L273 TraceCheckUtils]: 56: Hoare triple {23487#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23488#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:51,861 INFO L273 TraceCheckUtils]: 57: Hoare triple {23488#(<= main_~i~1 17)} assume true; {23488#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:51,862 INFO L273 TraceCheckUtils]: 58: Hoare triple {23488#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23488#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:51,862 INFO L273 TraceCheckUtils]: 59: Hoare triple {23488#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23489#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:51,863 INFO L273 TraceCheckUtils]: 60: Hoare triple {23489#(<= main_~i~1 18)} assume true; {23489#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:51,863 INFO L273 TraceCheckUtils]: 61: Hoare triple {23489#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23489#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:51,864 INFO L273 TraceCheckUtils]: 62: Hoare triple {23489#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23490#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:51,865 INFO L273 TraceCheckUtils]: 63: Hoare triple {23490#(<= main_~i~1 19)} assume true; {23490#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:51,865 INFO L273 TraceCheckUtils]: 64: Hoare triple {23490#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23490#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:51,866 INFO L273 TraceCheckUtils]: 65: Hoare triple {23490#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23491#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:51,866 INFO L273 TraceCheckUtils]: 66: Hoare triple {23491#(<= main_~i~1 20)} assume true; {23491#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:51,867 INFO L273 TraceCheckUtils]: 67: Hoare triple {23491#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23491#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:51,867 INFO L273 TraceCheckUtils]: 68: Hoare triple {23491#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23492#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:51,868 INFO L273 TraceCheckUtils]: 69: Hoare triple {23492#(<= main_~i~1 21)} assume true; {23492#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:51,868 INFO L273 TraceCheckUtils]: 70: Hoare triple {23492#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23492#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:51,869 INFO L273 TraceCheckUtils]: 71: Hoare triple {23492#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23493#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:51,889 INFO L273 TraceCheckUtils]: 72: Hoare triple {23493#(<= main_~i~1 22)} assume true; {23493#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:51,906 INFO L273 TraceCheckUtils]: 73: Hoare triple {23493#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23493#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:51,915 INFO L273 TraceCheckUtils]: 74: Hoare triple {23493#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23494#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:51,921 INFO L273 TraceCheckUtils]: 75: Hoare triple {23494#(<= main_~i~1 23)} assume true; {23494#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:51,922 INFO L273 TraceCheckUtils]: 76: Hoare triple {23494#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23494#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:51,922 INFO L273 TraceCheckUtils]: 77: Hoare triple {23494#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23495#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:51,922 INFO L273 TraceCheckUtils]: 78: Hoare triple {23495#(<= main_~i~1 24)} assume true; {23495#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:51,923 INFO L273 TraceCheckUtils]: 79: Hoare triple {23495#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23495#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:51,923 INFO L273 TraceCheckUtils]: 80: Hoare triple {23495#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23496#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:51,924 INFO L273 TraceCheckUtils]: 81: Hoare triple {23496#(<= main_~i~1 25)} assume true; {23496#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:51,924 INFO L273 TraceCheckUtils]: 82: Hoare triple {23496#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23496#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:51,924 INFO L273 TraceCheckUtils]: 83: Hoare triple {23496#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23497#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:51,925 INFO L273 TraceCheckUtils]: 84: Hoare triple {23497#(<= main_~i~1 26)} assume true; {23497#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:51,925 INFO L273 TraceCheckUtils]: 85: Hoare triple {23497#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23497#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:51,926 INFO L273 TraceCheckUtils]: 86: Hoare triple {23497#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23498#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:51,927 INFO L273 TraceCheckUtils]: 87: Hoare triple {23498#(<= main_~i~1 27)} assume true; {23498#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:51,927 INFO L273 TraceCheckUtils]: 88: Hoare triple {23498#(<= main_~i~1 27)} assume !(~i~1 < 1000); {23470#false} is VALID [2018-11-14 17:09:51,927 INFO L256 TraceCheckUtils]: 89: Hoare triple {23470#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {23469#true} is VALID [2018-11-14 17:09:51,928 INFO L273 TraceCheckUtils]: 90: Hoare triple {23469#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23469#true} is VALID [2018-11-14 17:09:51,928 INFO L273 TraceCheckUtils]: 91: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,928 INFO L273 TraceCheckUtils]: 92: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,928 INFO L273 TraceCheckUtils]: 93: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,928 INFO L273 TraceCheckUtils]: 94: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,928 INFO L273 TraceCheckUtils]: 95: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,929 INFO L273 TraceCheckUtils]: 96: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,929 INFO L273 TraceCheckUtils]: 97: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,929 INFO L273 TraceCheckUtils]: 98: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,929 INFO L273 TraceCheckUtils]: 99: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,929 INFO L273 TraceCheckUtils]: 100: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,929 INFO L273 TraceCheckUtils]: 101: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,930 INFO L273 TraceCheckUtils]: 102: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,930 INFO L273 TraceCheckUtils]: 103: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,930 INFO L273 TraceCheckUtils]: 104: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,930 INFO L273 TraceCheckUtils]: 105: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,930 INFO L273 TraceCheckUtils]: 106: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,930 INFO L273 TraceCheckUtils]: 107: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,930 INFO L273 TraceCheckUtils]: 108: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,930 INFO L273 TraceCheckUtils]: 109: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L273 TraceCheckUtils]: 110: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L273 TraceCheckUtils]: 111: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L273 TraceCheckUtils]: 112: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L273 TraceCheckUtils]: 113: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L273 TraceCheckUtils]: 114: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L273 TraceCheckUtils]: 115: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L273 TraceCheckUtils]: 116: Hoare triple {23469#true} assume !(~i~0 < 1000); {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L273 TraceCheckUtils]: 117: Hoare triple {23469#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L273 TraceCheckUtils]: 118: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,931 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {23469#true} {23470#false} #73#return; {23470#false} is VALID [2018-11-14 17:09:51,932 INFO L273 TraceCheckUtils]: 120: Hoare triple {23470#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {23470#false} is VALID [2018-11-14 17:09:51,932 INFO L256 TraceCheckUtils]: 121: Hoare triple {23470#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {23469#true} is VALID [2018-11-14 17:09:51,932 INFO L273 TraceCheckUtils]: 122: Hoare triple {23469#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23469#true} is VALID [2018-11-14 17:09:51,932 INFO L273 TraceCheckUtils]: 123: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,932 INFO L273 TraceCheckUtils]: 124: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,932 INFO L273 TraceCheckUtils]: 125: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,932 INFO L273 TraceCheckUtils]: 126: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,932 INFO L273 TraceCheckUtils]: 127: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,932 INFO L273 TraceCheckUtils]: 128: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 129: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 130: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 131: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 132: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 133: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 134: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 135: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 136: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 137: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,933 INFO L273 TraceCheckUtils]: 138: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 139: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 140: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 141: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 142: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 143: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 144: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 145: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 146: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 147: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,934 INFO L273 TraceCheckUtils]: 148: Hoare triple {23469#true} assume !(~i~0 < 1000); {23469#true} is VALID [2018-11-14 17:09:51,935 INFO L273 TraceCheckUtils]: 149: Hoare triple {23469#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23469#true} is VALID [2018-11-14 17:09:51,935 INFO L273 TraceCheckUtils]: 150: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,935 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {23469#true} {23470#false} #75#return; {23470#false} is VALID [2018-11-14 17:09:51,935 INFO L273 TraceCheckUtils]: 152: Hoare triple {23470#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23470#false} is VALID [2018-11-14 17:09:51,935 INFO L273 TraceCheckUtils]: 153: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:51,935 INFO L273 TraceCheckUtils]: 154: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:51,935 INFO L273 TraceCheckUtils]: 155: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:51,935 INFO L273 TraceCheckUtils]: 156: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:51,935 INFO L273 TraceCheckUtils]: 157: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:51,935 INFO L273 TraceCheckUtils]: 158: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 159: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 160: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 161: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 162: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 163: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 164: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 165: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 166: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 167: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:51,936 INFO L273 TraceCheckUtils]: 168: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:51,937 INFO L273 TraceCheckUtils]: 169: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:51,937 INFO L273 TraceCheckUtils]: 170: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:51,937 INFO L273 TraceCheckUtils]: 171: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:51,937 INFO L273 TraceCheckUtils]: 172: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:51,937 INFO L273 TraceCheckUtils]: 173: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:51,937 INFO L273 TraceCheckUtils]: 174: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:51,937 INFO L273 TraceCheckUtils]: 175: Hoare triple {23470#false} assume !(~i~2 < 999); {23470#false} is VALID [2018-11-14 17:09:51,937 INFO L273 TraceCheckUtils]: 176: Hoare triple {23470#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {23470#false} is VALID [2018-11-14 17:09:51,937 INFO L256 TraceCheckUtils]: 177: Hoare triple {23470#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {23469#true} is VALID [2018-11-14 17:09:51,937 INFO L273 TraceCheckUtils]: 178: Hoare triple {23469#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 179: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 180: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 181: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 182: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 183: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 184: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 185: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 186: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 187: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,938 INFO L273 TraceCheckUtils]: 188: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,939 INFO L273 TraceCheckUtils]: 189: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,939 INFO L273 TraceCheckUtils]: 190: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,939 INFO L273 TraceCheckUtils]: 191: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,939 INFO L273 TraceCheckUtils]: 192: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,939 INFO L273 TraceCheckUtils]: 193: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,939 INFO L273 TraceCheckUtils]: 194: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,939 INFO L273 TraceCheckUtils]: 195: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,939 INFO L273 TraceCheckUtils]: 196: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,939 INFO L273 TraceCheckUtils]: 197: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L273 TraceCheckUtils]: 198: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L273 TraceCheckUtils]: 199: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L273 TraceCheckUtils]: 200: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L273 TraceCheckUtils]: 201: Hoare triple {23469#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L273 TraceCheckUtils]: 202: Hoare triple {23469#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L273 TraceCheckUtils]: 203: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L273 TraceCheckUtils]: 204: Hoare triple {23469#true} assume !(~i~0 < 1000); {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L273 TraceCheckUtils]: 205: Hoare triple {23469#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L273 TraceCheckUtils]: 206: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:51,940 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {23469#true} {23470#false} #77#return; {23470#false} is VALID [2018-11-14 17:09:51,941 INFO L273 TraceCheckUtils]: 208: Hoare triple {23470#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23470#false} is VALID [2018-11-14 17:09:51,941 INFO L273 TraceCheckUtils]: 209: Hoare triple {23470#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23470#false} is VALID [2018-11-14 17:09:51,941 INFO L273 TraceCheckUtils]: 210: Hoare triple {23470#false} assume !false; {23470#false} is VALID [2018-11-14 17:09:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:09:51,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:51,962 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-14 17:09:51,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:09:52,046 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:09:52,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:52,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:52,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {23469#true} call ULTIMATE.init(); {23469#true} is VALID [2018-11-14 17:09:52,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {23469#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23469#true} is VALID [2018-11-14 17:09:52,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {23469#true} assume true; {23469#true} is VALID [2018-11-14 17:09:52,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23469#true} {23469#true} #69#return; {23469#true} is VALID [2018-11-14 17:09:52,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {23469#true} call #t~ret13 := main(); {23469#true} is VALID [2018-11-14 17:09:52,405 INFO L273 TraceCheckUtils]: 5: Hoare triple {23469#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {23517#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:52,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {23517#(<= main_~i~1 0)} assume true; {23517#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:52,406 INFO L273 TraceCheckUtils]: 7: Hoare triple {23517#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23517#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:52,406 INFO L273 TraceCheckUtils]: 8: Hoare triple {23517#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23472#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:52,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {23472#(<= main_~i~1 1)} assume true; {23472#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:52,407 INFO L273 TraceCheckUtils]: 10: Hoare triple {23472#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23472#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:52,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {23472#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23473#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:52,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {23473#(<= main_~i~1 2)} assume true; {23473#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:52,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {23473#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23473#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:52,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {23473#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23474#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:52,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {23474#(<= main_~i~1 3)} assume true; {23474#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:52,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {23474#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23474#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:52,410 INFO L273 TraceCheckUtils]: 17: Hoare triple {23474#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23475#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:52,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {23475#(<= main_~i~1 4)} assume true; {23475#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:52,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {23475#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23475#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:52,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {23475#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23476#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:52,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {23476#(<= main_~i~1 5)} assume true; {23476#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:52,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {23476#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23476#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:52,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {23476#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23477#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:52,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {23477#(<= main_~i~1 6)} assume true; {23477#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:52,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {23477#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23477#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:52,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {23477#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23478#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:52,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {23478#(<= main_~i~1 7)} assume true; {23478#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:52,415 INFO L273 TraceCheckUtils]: 28: Hoare triple {23478#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23478#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:52,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {23478#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23479#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:52,416 INFO L273 TraceCheckUtils]: 30: Hoare triple {23479#(<= main_~i~1 8)} assume true; {23479#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:52,417 INFO L273 TraceCheckUtils]: 31: Hoare triple {23479#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23479#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:52,417 INFO L273 TraceCheckUtils]: 32: Hoare triple {23479#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23480#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:52,418 INFO L273 TraceCheckUtils]: 33: Hoare triple {23480#(<= main_~i~1 9)} assume true; {23480#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:52,418 INFO L273 TraceCheckUtils]: 34: Hoare triple {23480#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23480#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:52,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {23480#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23481#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:52,420 INFO L273 TraceCheckUtils]: 36: Hoare triple {23481#(<= main_~i~1 10)} assume true; {23481#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:52,420 INFO L273 TraceCheckUtils]: 37: Hoare triple {23481#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23481#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:52,421 INFO L273 TraceCheckUtils]: 38: Hoare triple {23481#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23482#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:52,421 INFO L273 TraceCheckUtils]: 39: Hoare triple {23482#(<= main_~i~1 11)} assume true; {23482#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:52,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {23482#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23482#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:52,422 INFO L273 TraceCheckUtils]: 41: Hoare triple {23482#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23483#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:52,423 INFO L273 TraceCheckUtils]: 42: Hoare triple {23483#(<= main_~i~1 12)} assume true; {23483#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:52,423 INFO L273 TraceCheckUtils]: 43: Hoare triple {23483#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23483#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:52,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {23483#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23484#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:52,424 INFO L273 TraceCheckUtils]: 45: Hoare triple {23484#(<= main_~i~1 13)} assume true; {23484#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:52,425 INFO L273 TraceCheckUtils]: 46: Hoare triple {23484#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23484#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:52,425 INFO L273 TraceCheckUtils]: 47: Hoare triple {23484#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23485#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:52,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {23485#(<= main_~i~1 14)} assume true; {23485#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:52,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {23485#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23485#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:52,427 INFO L273 TraceCheckUtils]: 50: Hoare triple {23485#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23486#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:52,427 INFO L273 TraceCheckUtils]: 51: Hoare triple {23486#(<= main_~i~1 15)} assume true; {23486#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:52,428 INFO L273 TraceCheckUtils]: 52: Hoare triple {23486#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23486#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:52,429 INFO L273 TraceCheckUtils]: 53: Hoare triple {23486#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23487#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:52,429 INFO L273 TraceCheckUtils]: 54: Hoare triple {23487#(<= main_~i~1 16)} assume true; {23487#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:52,429 INFO L273 TraceCheckUtils]: 55: Hoare triple {23487#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23487#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:52,430 INFO L273 TraceCheckUtils]: 56: Hoare triple {23487#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23488#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:52,431 INFO L273 TraceCheckUtils]: 57: Hoare triple {23488#(<= main_~i~1 17)} assume true; {23488#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:52,431 INFO L273 TraceCheckUtils]: 58: Hoare triple {23488#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23488#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:52,432 INFO L273 TraceCheckUtils]: 59: Hoare triple {23488#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23489#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:52,432 INFO L273 TraceCheckUtils]: 60: Hoare triple {23489#(<= main_~i~1 18)} assume true; {23489#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:52,433 INFO L273 TraceCheckUtils]: 61: Hoare triple {23489#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23489#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:52,433 INFO L273 TraceCheckUtils]: 62: Hoare triple {23489#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23490#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:52,434 INFO L273 TraceCheckUtils]: 63: Hoare triple {23490#(<= main_~i~1 19)} assume true; {23490#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:52,434 INFO L273 TraceCheckUtils]: 64: Hoare triple {23490#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23490#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:52,435 INFO L273 TraceCheckUtils]: 65: Hoare triple {23490#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23491#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:52,435 INFO L273 TraceCheckUtils]: 66: Hoare triple {23491#(<= main_~i~1 20)} assume true; {23491#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:52,436 INFO L273 TraceCheckUtils]: 67: Hoare triple {23491#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23491#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:52,436 INFO L273 TraceCheckUtils]: 68: Hoare triple {23491#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23492#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:52,437 INFO L273 TraceCheckUtils]: 69: Hoare triple {23492#(<= main_~i~1 21)} assume true; {23492#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:52,437 INFO L273 TraceCheckUtils]: 70: Hoare triple {23492#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23492#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:52,438 INFO L273 TraceCheckUtils]: 71: Hoare triple {23492#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23493#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:52,439 INFO L273 TraceCheckUtils]: 72: Hoare triple {23493#(<= main_~i~1 22)} assume true; {23493#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:52,439 INFO L273 TraceCheckUtils]: 73: Hoare triple {23493#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23493#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:52,440 INFO L273 TraceCheckUtils]: 74: Hoare triple {23493#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23494#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:52,440 INFO L273 TraceCheckUtils]: 75: Hoare triple {23494#(<= main_~i~1 23)} assume true; {23494#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:52,441 INFO L273 TraceCheckUtils]: 76: Hoare triple {23494#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23494#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:52,441 INFO L273 TraceCheckUtils]: 77: Hoare triple {23494#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23495#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:52,442 INFO L273 TraceCheckUtils]: 78: Hoare triple {23495#(<= main_~i~1 24)} assume true; {23495#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:52,442 INFO L273 TraceCheckUtils]: 79: Hoare triple {23495#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23495#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:52,443 INFO L273 TraceCheckUtils]: 80: Hoare triple {23495#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23496#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:52,443 INFO L273 TraceCheckUtils]: 81: Hoare triple {23496#(<= main_~i~1 25)} assume true; {23496#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:52,444 INFO L273 TraceCheckUtils]: 82: Hoare triple {23496#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23496#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:52,444 INFO L273 TraceCheckUtils]: 83: Hoare triple {23496#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23497#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:52,445 INFO L273 TraceCheckUtils]: 84: Hoare triple {23497#(<= main_~i~1 26)} assume true; {23497#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:52,445 INFO L273 TraceCheckUtils]: 85: Hoare triple {23497#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {23497#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:52,446 INFO L273 TraceCheckUtils]: 86: Hoare triple {23497#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {23498#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:52,446 INFO L273 TraceCheckUtils]: 87: Hoare triple {23498#(<= main_~i~1 27)} assume true; {23498#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:52,447 INFO L273 TraceCheckUtils]: 88: Hoare triple {23498#(<= main_~i~1 27)} assume !(~i~1 < 1000); {23470#false} is VALID [2018-11-14 17:09:52,447 INFO L256 TraceCheckUtils]: 89: Hoare triple {23470#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {23470#false} is VALID [2018-11-14 17:09:52,447 INFO L273 TraceCheckUtils]: 90: Hoare triple {23470#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23470#false} is VALID [2018-11-14 17:09:52,448 INFO L273 TraceCheckUtils]: 91: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,448 INFO L273 TraceCheckUtils]: 92: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,448 INFO L273 TraceCheckUtils]: 93: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,448 INFO L273 TraceCheckUtils]: 94: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,448 INFO L273 TraceCheckUtils]: 95: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,448 INFO L273 TraceCheckUtils]: 96: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,449 INFO L273 TraceCheckUtils]: 97: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,449 INFO L273 TraceCheckUtils]: 98: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,449 INFO L273 TraceCheckUtils]: 99: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,449 INFO L273 TraceCheckUtils]: 100: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,449 INFO L273 TraceCheckUtils]: 101: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,449 INFO L273 TraceCheckUtils]: 102: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,450 INFO L273 TraceCheckUtils]: 103: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,450 INFO L273 TraceCheckUtils]: 104: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,450 INFO L273 TraceCheckUtils]: 105: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,450 INFO L273 TraceCheckUtils]: 106: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,450 INFO L273 TraceCheckUtils]: 107: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,450 INFO L273 TraceCheckUtils]: 108: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,450 INFO L273 TraceCheckUtils]: 109: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,450 INFO L273 TraceCheckUtils]: 110: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L273 TraceCheckUtils]: 111: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L273 TraceCheckUtils]: 112: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L273 TraceCheckUtils]: 113: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L273 TraceCheckUtils]: 114: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L273 TraceCheckUtils]: 115: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L273 TraceCheckUtils]: 116: Hoare triple {23470#false} assume !(~i~0 < 1000); {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L273 TraceCheckUtils]: 117: Hoare triple {23470#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L273 TraceCheckUtils]: 118: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L268 TraceCheckUtils]: 119: Hoare quadruple {23470#false} {23470#false} #73#return; {23470#false} is VALID [2018-11-14 17:09:52,451 INFO L273 TraceCheckUtils]: 120: Hoare triple {23470#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L256 TraceCheckUtils]: 121: Hoare triple {23470#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L273 TraceCheckUtils]: 122: Hoare triple {23470#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L273 TraceCheckUtils]: 123: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L273 TraceCheckUtils]: 124: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L273 TraceCheckUtils]: 125: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L273 TraceCheckUtils]: 126: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L273 TraceCheckUtils]: 127: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L273 TraceCheckUtils]: 128: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L273 TraceCheckUtils]: 129: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,452 INFO L273 TraceCheckUtils]: 130: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 131: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 132: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 133: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 134: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 135: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 136: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 137: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 138: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 139: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,453 INFO L273 TraceCheckUtils]: 140: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 141: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 142: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 143: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 144: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 145: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 146: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 147: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 148: Hoare triple {23470#false} assume !(~i~0 < 1000); {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 149: Hoare triple {23470#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23470#false} is VALID [2018-11-14 17:09:52,454 INFO L273 TraceCheckUtils]: 150: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L268 TraceCheckUtils]: 151: Hoare quadruple {23470#false} {23470#false} #75#return; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L273 TraceCheckUtils]: 152: Hoare triple {23470#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L273 TraceCheckUtils]: 153: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L273 TraceCheckUtils]: 154: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L273 TraceCheckUtils]: 155: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L273 TraceCheckUtils]: 156: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L273 TraceCheckUtils]: 157: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L273 TraceCheckUtils]: 158: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L273 TraceCheckUtils]: 159: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,455 INFO L273 TraceCheckUtils]: 160: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 161: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 162: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 163: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 164: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 165: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 166: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 167: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 168: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 169: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:52,456 INFO L273 TraceCheckUtils]: 170: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 171: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 172: Hoare triple {23470#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 173: Hoare triple {23470#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 174: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 175: Hoare triple {23470#false} assume !(~i~2 < 999); {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 176: Hoare triple {23470#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L256 TraceCheckUtils]: 177: Hoare triple {23470#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 178: Hoare triple {23470#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 179: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 180: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,457 INFO L273 TraceCheckUtils]: 181: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 182: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 183: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 184: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 185: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 186: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 187: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 188: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 189: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 190: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,458 INFO L273 TraceCheckUtils]: 191: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 192: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 193: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 194: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 195: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 196: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 197: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 198: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 199: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 200: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,459 INFO L273 TraceCheckUtils]: 201: Hoare triple {23470#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {23470#false} is VALID [2018-11-14 17:09:52,460 INFO L273 TraceCheckUtils]: 202: Hoare triple {23470#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {23470#false} is VALID [2018-11-14 17:09:52,460 INFO L273 TraceCheckUtils]: 203: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,460 INFO L273 TraceCheckUtils]: 204: Hoare triple {23470#false} assume !(~i~0 < 1000); {23470#false} is VALID [2018-11-14 17:09:52,460 INFO L273 TraceCheckUtils]: 205: Hoare triple {23470#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {23470#false} is VALID [2018-11-14 17:09:52,460 INFO L273 TraceCheckUtils]: 206: Hoare triple {23470#false} assume true; {23470#false} is VALID [2018-11-14 17:09:52,460 INFO L268 TraceCheckUtils]: 207: Hoare quadruple {23470#false} {23470#false} #77#return; {23470#false} is VALID [2018-11-14 17:09:52,460 INFO L273 TraceCheckUtils]: 208: Hoare triple {23470#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {23470#false} is VALID [2018-11-14 17:09:52,460 INFO L273 TraceCheckUtils]: 209: Hoare triple {23470#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {23470#false} is VALID [2018-11-14 17:09:52,460 INFO L273 TraceCheckUtils]: 210: Hoare triple {23470#false} assume !false; {23470#false} is VALID [2018-11-14 17:09:52,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2174 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:09:52,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:52,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 17:09:52,502 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 211 [2018-11-14 17:09:52,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:52,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 17:09:52,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:52,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 17:09:52,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 17:09:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 17:09:52,615 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 31 states. [2018-11-14 17:09:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:53,325 INFO L93 Difference]: Finished difference Result 219 states and 227 transitions. [2018-11-14 17:09:53,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 17:09:53,325 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 211 [2018-11-14 17:09:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:09:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 141 transitions. [2018-11-14 17:09:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:09:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 141 transitions. [2018-11-14 17:09:53,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 141 transitions. [2018-11-14 17:09:53,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:53,452 INFO L225 Difference]: With dead ends: 219 [2018-11-14 17:09:53,452 INFO L226 Difference]: Without dead ends: 156 [2018-11-14 17:09:53,453 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 211 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-14 17:09:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-14 17:09:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-11-14 17:09:53,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:53,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 155 states. [2018-11-14 17:09:53,610 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 155 states. [2018-11-14 17:09:53,610 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 155 states. [2018-11-14 17:09:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:53,613 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-14 17:09:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-11-14 17:09:53,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:53,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:53,613 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 156 states. [2018-11-14 17:09:53,613 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 156 states. [2018-11-14 17:09:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:53,616 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-11-14 17:09:53,616 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-11-14 17:09:53,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:53,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:53,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:53,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-14 17:09:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-11-14 17:09:53,619 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 211 [2018-11-14 17:09:53,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:53,619 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-11-14 17:09:53,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 17:09:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-11-14 17:09:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-14 17:09:53,620 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:53,621 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 24, 24, 8, 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-14 17:09:53,621 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:53,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:53,621 INFO L82 PathProgramCache]: Analyzing trace with hash -895066594, now seen corresponding path program 27 times [2018-11-14 17:09:53,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:53,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:53,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:53,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:53,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:54,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {24947#true} call ULTIMATE.init(); {24947#true} is VALID [2018-11-14 17:09:54,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {24947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24947#true} is VALID [2018-11-14 17:09:54,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24947#true} {24947#true} #69#return; {24947#true} is VALID [2018-11-14 17:09:54,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {24947#true} call #t~ret13 := main(); {24947#true} is VALID [2018-11-14 17:09:54,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {24947#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24949#(= main_~i~1 0)} is VALID [2018-11-14 17:09:54,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {24949#(= main_~i~1 0)} assume true; {24949#(= main_~i~1 0)} is VALID [2018-11-14 17:09:54,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {24949#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24949#(= main_~i~1 0)} is VALID [2018-11-14 17:09:54,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {24949#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24950#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:54,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {24950#(<= main_~i~1 1)} assume true; {24950#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:54,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {24950#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24950#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:54,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {24950#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24951#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:54,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {24951#(<= main_~i~1 2)} assume true; {24951#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:54,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {24951#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24951#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:54,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {24951#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24952#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:54,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {24952#(<= main_~i~1 3)} assume true; {24952#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:54,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {24952#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24952#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:54,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {24952#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24953#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:54,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {24953#(<= main_~i~1 4)} assume true; {24953#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:54,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {24953#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24953#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:54,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {24953#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24954#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:54,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {24954#(<= main_~i~1 5)} assume true; {24954#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:54,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {24954#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24954#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:54,157 INFO L273 TraceCheckUtils]: 23: Hoare triple {24954#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24955#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:54,158 INFO L273 TraceCheckUtils]: 24: Hoare triple {24955#(<= main_~i~1 6)} assume true; {24955#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:54,158 INFO L273 TraceCheckUtils]: 25: Hoare triple {24955#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24955#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:54,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {24955#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24956#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:54,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {24956#(<= main_~i~1 7)} assume true; {24956#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:54,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {24956#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24956#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:54,161 INFO L273 TraceCheckUtils]: 29: Hoare triple {24956#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24957#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:54,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {24957#(<= main_~i~1 8)} assume true; {24957#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:54,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {24957#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24957#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:54,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {24957#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24958#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:54,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {24958#(<= main_~i~1 9)} assume true; {24958#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:54,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {24958#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24958#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:54,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {24958#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24959#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:54,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {24959#(<= main_~i~1 10)} assume true; {24959#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:54,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {24959#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24959#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:54,165 INFO L273 TraceCheckUtils]: 38: Hoare triple {24959#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24960#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:54,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {24960#(<= main_~i~1 11)} assume true; {24960#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:54,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {24960#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24960#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:54,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {24960#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24961#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:54,168 INFO L273 TraceCheckUtils]: 42: Hoare triple {24961#(<= main_~i~1 12)} assume true; {24961#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:54,168 INFO L273 TraceCheckUtils]: 43: Hoare triple {24961#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24961#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:54,169 INFO L273 TraceCheckUtils]: 44: Hoare triple {24961#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24962#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:54,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {24962#(<= main_~i~1 13)} assume true; {24962#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:54,170 INFO L273 TraceCheckUtils]: 46: Hoare triple {24962#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24962#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:54,170 INFO L273 TraceCheckUtils]: 47: Hoare triple {24962#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24963#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:54,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {24963#(<= main_~i~1 14)} assume true; {24963#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:54,171 INFO L273 TraceCheckUtils]: 49: Hoare triple {24963#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24963#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:54,172 INFO L273 TraceCheckUtils]: 50: Hoare triple {24963#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24964#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:54,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {24964#(<= main_~i~1 15)} assume true; {24964#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:54,173 INFO L273 TraceCheckUtils]: 52: Hoare triple {24964#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24964#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:54,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {24964#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24965#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:54,174 INFO L273 TraceCheckUtils]: 54: Hoare triple {24965#(<= main_~i~1 16)} assume true; {24965#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:54,174 INFO L273 TraceCheckUtils]: 55: Hoare triple {24965#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24965#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:54,175 INFO L273 TraceCheckUtils]: 56: Hoare triple {24965#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24966#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:54,176 INFO L273 TraceCheckUtils]: 57: Hoare triple {24966#(<= main_~i~1 17)} assume true; {24966#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:54,176 INFO L273 TraceCheckUtils]: 58: Hoare triple {24966#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24966#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:54,177 INFO L273 TraceCheckUtils]: 59: Hoare triple {24966#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24967#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:54,177 INFO L273 TraceCheckUtils]: 60: Hoare triple {24967#(<= main_~i~1 18)} assume true; {24967#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:54,178 INFO L273 TraceCheckUtils]: 61: Hoare triple {24967#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24967#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:54,178 INFO L273 TraceCheckUtils]: 62: Hoare triple {24967#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24968#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:54,179 INFO L273 TraceCheckUtils]: 63: Hoare triple {24968#(<= main_~i~1 19)} assume true; {24968#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:54,179 INFO L273 TraceCheckUtils]: 64: Hoare triple {24968#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24968#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:54,180 INFO L273 TraceCheckUtils]: 65: Hoare triple {24968#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24969#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:54,180 INFO L273 TraceCheckUtils]: 66: Hoare triple {24969#(<= main_~i~1 20)} assume true; {24969#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:54,181 INFO L273 TraceCheckUtils]: 67: Hoare triple {24969#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24969#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:54,181 INFO L273 TraceCheckUtils]: 68: Hoare triple {24969#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24970#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:54,182 INFO L273 TraceCheckUtils]: 69: Hoare triple {24970#(<= main_~i~1 21)} assume true; {24970#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:54,182 INFO L273 TraceCheckUtils]: 70: Hoare triple {24970#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24970#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:54,183 INFO L273 TraceCheckUtils]: 71: Hoare triple {24970#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24971#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:54,184 INFO L273 TraceCheckUtils]: 72: Hoare triple {24971#(<= main_~i~1 22)} assume true; {24971#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:54,184 INFO L273 TraceCheckUtils]: 73: Hoare triple {24971#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24971#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:54,185 INFO L273 TraceCheckUtils]: 74: Hoare triple {24971#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24972#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:54,185 INFO L273 TraceCheckUtils]: 75: Hoare triple {24972#(<= main_~i~1 23)} assume true; {24972#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:54,186 INFO L273 TraceCheckUtils]: 76: Hoare triple {24972#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24972#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:54,186 INFO L273 TraceCheckUtils]: 77: Hoare triple {24972#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24973#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:54,187 INFO L273 TraceCheckUtils]: 78: Hoare triple {24973#(<= main_~i~1 24)} assume true; {24973#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:54,187 INFO L273 TraceCheckUtils]: 79: Hoare triple {24973#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24973#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:54,188 INFO L273 TraceCheckUtils]: 80: Hoare triple {24973#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24974#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:54,188 INFO L273 TraceCheckUtils]: 81: Hoare triple {24974#(<= main_~i~1 25)} assume true; {24974#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:54,189 INFO L273 TraceCheckUtils]: 82: Hoare triple {24974#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24974#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:54,189 INFO L273 TraceCheckUtils]: 83: Hoare triple {24974#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24975#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:54,190 INFO L273 TraceCheckUtils]: 84: Hoare triple {24975#(<= main_~i~1 26)} assume true; {24975#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:54,190 INFO L273 TraceCheckUtils]: 85: Hoare triple {24975#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24975#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:54,191 INFO L273 TraceCheckUtils]: 86: Hoare triple {24975#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24976#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:54,192 INFO L273 TraceCheckUtils]: 87: Hoare triple {24976#(<= main_~i~1 27)} assume true; {24976#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:54,192 INFO L273 TraceCheckUtils]: 88: Hoare triple {24976#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24976#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:54,193 INFO L273 TraceCheckUtils]: 89: Hoare triple {24976#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24977#(<= main_~i~1 28)} is VALID [2018-11-14 17:09:54,193 INFO L273 TraceCheckUtils]: 90: Hoare triple {24977#(<= main_~i~1 28)} assume true; {24977#(<= main_~i~1 28)} is VALID [2018-11-14 17:09:54,194 INFO L273 TraceCheckUtils]: 91: Hoare triple {24977#(<= main_~i~1 28)} assume !(~i~1 < 1000); {24948#false} is VALID [2018-11-14 17:09:54,194 INFO L256 TraceCheckUtils]: 92: Hoare triple {24948#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {24947#true} is VALID [2018-11-14 17:09:54,194 INFO L273 TraceCheckUtils]: 93: Hoare triple {24947#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24947#true} is VALID [2018-11-14 17:09:54,194 INFO L273 TraceCheckUtils]: 94: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,194 INFO L273 TraceCheckUtils]: 95: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,195 INFO L273 TraceCheckUtils]: 96: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,195 INFO L273 TraceCheckUtils]: 97: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,195 INFO L273 TraceCheckUtils]: 98: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,195 INFO L273 TraceCheckUtils]: 99: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,195 INFO L273 TraceCheckUtils]: 100: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,195 INFO L273 TraceCheckUtils]: 101: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,196 INFO L273 TraceCheckUtils]: 102: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,196 INFO L273 TraceCheckUtils]: 103: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,196 INFO L273 TraceCheckUtils]: 104: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,196 INFO L273 TraceCheckUtils]: 105: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,196 INFO L273 TraceCheckUtils]: 106: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,196 INFO L273 TraceCheckUtils]: 107: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,196 INFO L273 TraceCheckUtils]: 108: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,197 INFO L273 TraceCheckUtils]: 109: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,197 INFO L273 TraceCheckUtils]: 110: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,197 INFO L273 TraceCheckUtils]: 111: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,197 INFO L273 TraceCheckUtils]: 112: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,197 INFO L273 TraceCheckUtils]: 113: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,197 INFO L273 TraceCheckUtils]: 114: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,197 INFO L273 TraceCheckUtils]: 115: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,197 INFO L273 TraceCheckUtils]: 116: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,197 INFO L273 TraceCheckUtils]: 117: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,198 INFO L273 TraceCheckUtils]: 118: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,198 INFO L273 TraceCheckUtils]: 119: Hoare triple {24947#true} assume !(~i~0 < 1000); {24947#true} is VALID [2018-11-14 17:09:54,198 INFO L273 TraceCheckUtils]: 120: Hoare triple {24947#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24947#true} is VALID [2018-11-14 17:09:54,198 INFO L273 TraceCheckUtils]: 121: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,198 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {24947#true} {24948#false} #73#return; {24948#false} is VALID [2018-11-14 17:09:54,198 INFO L273 TraceCheckUtils]: 123: Hoare triple {24948#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {24948#false} is VALID [2018-11-14 17:09:54,198 INFO L256 TraceCheckUtils]: 124: Hoare triple {24948#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {24947#true} is VALID [2018-11-14 17:09:54,198 INFO L273 TraceCheckUtils]: 125: Hoare triple {24947#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24947#true} is VALID [2018-11-14 17:09:54,198 INFO L273 TraceCheckUtils]: 126: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,198 INFO L273 TraceCheckUtils]: 127: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 128: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 129: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 130: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 131: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 132: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 133: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 134: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 135: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 136: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,199 INFO L273 TraceCheckUtils]: 137: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 138: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 139: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 140: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 141: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 142: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 143: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 144: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 145: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 146: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,200 INFO L273 TraceCheckUtils]: 147: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,201 INFO L273 TraceCheckUtils]: 148: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,201 INFO L273 TraceCheckUtils]: 149: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,201 INFO L273 TraceCheckUtils]: 150: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,201 INFO L273 TraceCheckUtils]: 151: Hoare triple {24947#true} assume !(~i~0 < 1000); {24947#true} is VALID [2018-11-14 17:09:54,201 INFO L273 TraceCheckUtils]: 152: Hoare triple {24947#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24947#true} is VALID [2018-11-14 17:09:54,201 INFO L273 TraceCheckUtils]: 153: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,201 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {24947#true} {24948#false} #75#return; {24948#false} is VALID [2018-11-14 17:09:54,201 INFO L273 TraceCheckUtils]: 155: Hoare triple {24948#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {24948#false} is VALID [2018-11-14 17:09:54,201 INFO L273 TraceCheckUtils]: 156: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,201 INFO L273 TraceCheckUtils]: 157: Hoare triple {24948#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 158: Hoare triple {24948#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 159: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 160: Hoare triple {24948#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 161: Hoare triple {24948#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 162: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 163: Hoare triple {24948#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 164: Hoare triple {24948#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 165: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 166: Hoare triple {24948#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24948#false} is VALID [2018-11-14 17:09:54,202 INFO L273 TraceCheckUtils]: 167: Hoare triple {24948#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 168: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 169: Hoare triple {24948#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 170: Hoare triple {24948#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 171: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 172: Hoare triple {24948#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 173: Hoare triple {24948#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 174: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 175: Hoare triple {24948#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 176: Hoare triple {24948#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {24948#false} is VALID [2018-11-14 17:09:54,203 INFO L273 TraceCheckUtils]: 177: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,204 INFO L273 TraceCheckUtils]: 178: Hoare triple {24948#false} assume !(~i~2 < 999); {24948#false} is VALID [2018-11-14 17:09:54,204 INFO L273 TraceCheckUtils]: 179: Hoare triple {24948#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {24948#false} is VALID [2018-11-14 17:09:54,204 INFO L256 TraceCheckUtils]: 180: Hoare triple {24948#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {24947#true} is VALID [2018-11-14 17:09:54,204 INFO L273 TraceCheckUtils]: 181: Hoare triple {24947#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24947#true} is VALID [2018-11-14 17:09:54,204 INFO L273 TraceCheckUtils]: 182: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,204 INFO L273 TraceCheckUtils]: 183: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,204 INFO L273 TraceCheckUtils]: 184: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,204 INFO L273 TraceCheckUtils]: 185: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,204 INFO L273 TraceCheckUtils]: 186: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,204 INFO L273 TraceCheckUtils]: 187: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 188: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 189: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 190: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 191: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 192: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 193: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 194: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 195: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 196: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 197: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,205 INFO L273 TraceCheckUtils]: 198: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 199: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 200: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 201: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 202: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 203: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 204: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 205: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 206: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 207: Hoare triple {24947#true} assume !(~i~0 < 1000); {24947#true} is VALID [2018-11-14 17:09:54,206 INFO L273 TraceCheckUtils]: 208: Hoare triple {24947#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24947#true} is VALID [2018-11-14 17:09:54,207 INFO L273 TraceCheckUtils]: 209: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,207 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {24947#true} {24948#false} #77#return; {24948#false} is VALID [2018-11-14 17:09:54,207 INFO L273 TraceCheckUtils]: 211: Hoare triple {24948#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24948#false} is VALID [2018-11-14 17:09:54,207 INFO L273 TraceCheckUtils]: 212: Hoare triple {24948#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24948#false} is VALID [2018-11-14 17:09:54,207 INFO L273 TraceCheckUtils]: 213: Hoare triple {24948#false} assume !false; {24948#false} is VALID [2018-11-14 17:09:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2018-11-14 17:09:54,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:54,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 17:09:54,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:09:54,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-14 17:09:54,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:54,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:54,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {24947#true} call ULTIMATE.init(); {24947#true} is VALID [2018-11-14 17:09:54,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {24947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24947#true} is VALID [2018-11-14 17:09:54,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24947#true} {24947#true} #69#return; {24947#true} is VALID [2018-11-14 17:09:54,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {24947#true} call #t~ret13 := main(); {24947#true} is VALID [2018-11-14 17:09:54,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {24947#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {24947#true} is VALID [2018-11-14 17:09:54,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,838 INFO L273 TraceCheckUtils]: 20: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 29: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 31: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 32: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 34: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 35: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 38: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 39: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 41: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 42: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 43: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 44: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 45: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 46: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 47: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 48: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 49: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,841 INFO L273 TraceCheckUtils]: 50: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 51: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 52: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 53: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 54: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 55: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 56: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 57: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 58: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 59: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,842 INFO L273 TraceCheckUtils]: 60: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 61: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 62: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 63: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 64: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 65: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 66: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 67: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 68: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 69: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,843 INFO L273 TraceCheckUtils]: 70: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 71: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 72: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 73: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 74: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 75: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 76: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 77: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 78: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 79: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,844 INFO L273 TraceCheckUtils]: 80: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 81: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 82: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 83: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 84: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 85: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 86: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 87: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 88: Hoare triple {24947#true} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 89: Hoare triple {24947#true} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {24947#true} is VALID [2018-11-14 17:09:54,845 INFO L273 TraceCheckUtils]: 90: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L273 TraceCheckUtils]: 91: Hoare triple {24947#true} assume !(~i~1 < 1000); {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L256 TraceCheckUtils]: 92: Hoare triple {24947#true} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L273 TraceCheckUtils]: 93: Hoare triple {24947#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L273 TraceCheckUtils]: 94: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L273 TraceCheckUtils]: 95: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L273 TraceCheckUtils]: 96: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L273 TraceCheckUtils]: 97: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L273 TraceCheckUtils]: 98: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L273 TraceCheckUtils]: 99: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,846 INFO L273 TraceCheckUtils]: 100: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 101: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 102: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 103: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 104: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 105: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 106: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 107: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 108: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 109: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,847 INFO L273 TraceCheckUtils]: 110: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 111: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 112: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 113: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 114: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 115: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 116: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 117: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 118: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 119: Hoare triple {24947#true} assume !(~i~0 < 1000); {24947#true} is VALID [2018-11-14 17:09:54,848 INFO L273 TraceCheckUtils]: 120: Hoare triple {24947#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24947#true} is VALID [2018-11-14 17:09:54,849 INFO L273 TraceCheckUtils]: 121: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,849 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {24947#true} {24947#true} #73#return; {24947#true} is VALID [2018-11-14 17:09:54,849 INFO L273 TraceCheckUtils]: 123: Hoare triple {24947#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {24947#true} is VALID [2018-11-14 17:09:54,849 INFO L256 TraceCheckUtils]: 124: Hoare triple {24947#true} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {24947#true} is VALID [2018-11-14 17:09:54,849 INFO L273 TraceCheckUtils]: 125: Hoare triple {24947#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24947#true} is VALID [2018-11-14 17:09:54,849 INFO L273 TraceCheckUtils]: 126: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,849 INFO L273 TraceCheckUtils]: 127: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,849 INFO L273 TraceCheckUtils]: 128: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,849 INFO L273 TraceCheckUtils]: 129: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 130: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 131: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 132: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 133: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 134: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 135: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 136: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 137: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 138: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,850 INFO L273 TraceCheckUtils]: 139: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 140: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 141: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 142: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 143: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 144: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 145: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 146: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 147: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 148: Hoare triple {24947#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24947#true} is VALID [2018-11-14 17:09:54,851 INFO L273 TraceCheckUtils]: 149: Hoare triple {24947#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24947#true} is VALID [2018-11-14 17:09:54,852 INFO L273 TraceCheckUtils]: 150: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,852 INFO L273 TraceCheckUtils]: 151: Hoare triple {24947#true} assume !(~i~0 < 1000); {24947#true} is VALID [2018-11-14 17:09:54,852 INFO L273 TraceCheckUtils]: 152: Hoare triple {24947#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24947#true} is VALID [2018-11-14 17:09:54,852 INFO L273 TraceCheckUtils]: 153: Hoare triple {24947#true} assume true; {24947#true} is VALID [2018-11-14 17:09:54,852 INFO L268 TraceCheckUtils]: 154: Hoare quadruple {24947#true} {24947#true} #75#return; {24947#true} is VALID [2018-11-14 17:09:54,852 INFO L273 TraceCheckUtils]: 155: Hoare triple {24947#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {25446#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:54,853 INFO L273 TraceCheckUtils]: 156: Hoare triple {25446#(<= main_~i~2 0)} assume true; {25446#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:54,853 INFO L273 TraceCheckUtils]: 157: Hoare triple {25446#(<= main_~i~2 0)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25446#(<= main_~i~2 0)} is VALID [2018-11-14 17:09:54,853 INFO L273 TraceCheckUtils]: 158: Hoare triple {25446#(<= main_~i~2 0)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25456#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:54,854 INFO L273 TraceCheckUtils]: 159: Hoare triple {25456#(<= main_~i~2 1)} assume true; {25456#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:54,854 INFO L273 TraceCheckUtils]: 160: Hoare triple {25456#(<= main_~i~2 1)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25456#(<= main_~i~2 1)} is VALID [2018-11-14 17:09:54,854 INFO L273 TraceCheckUtils]: 161: Hoare triple {25456#(<= main_~i~2 1)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25466#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:54,855 INFO L273 TraceCheckUtils]: 162: Hoare triple {25466#(<= main_~i~2 2)} assume true; {25466#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:54,855 INFO L273 TraceCheckUtils]: 163: Hoare triple {25466#(<= main_~i~2 2)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25466#(<= main_~i~2 2)} is VALID [2018-11-14 17:09:54,855 INFO L273 TraceCheckUtils]: 164: Hoare triple {25466#(<= main_~i~2 2)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25476#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:54,856 INFO L273 TraceCheckUtils]: 165: Hoare triple {25476#(<= main_~i~2 3)} assume true; {25476#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:54,856 INFO L273 TraceCheckUtils]: 166: Hoare triple {25476#(<= main_~i~2 3)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25476#(<= main_~i~2 3)} is VALID [2018-11-14 17:09:54,857 INFO L273 TraceCheckUtils]: 167: Hoare triple {25476#(<= main_~i~2 3)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25486#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:54,857 INFO L273 TraceCheckUtils]: 168: Hoare triple {25486#(<= main_~i~2 4)} assume true; {25486#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:54,858 INFO L273 TraceCheckUtils]: 169: Hoare triple {25486#(<= main_~i~2 4)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25486#(<= main_~i~2 4)} is VALID [2018-11-14 17:09:54,859 INFO L273 TraceCheckUtils]: 170: Hoare triple {25486#(<= main_~i~2 4)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25496#(<= main_~i~2 5)} is VALID [2018-11-14 17:09:54,859 INFO L273 TraceCheckUtils]: 171: Hoare triple {25496#(<= main_~i~2 5)} assume true; {25496#(<= main_~i~2 5)} is VALID [2018-11-14 17:09:54,859 INFO L273 TraceCheckUtils]: 172: Hoare triple {25496#(<= main_~i~2 5)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25496#(<= main_~i~2 5)} is VALID [2018-11-14 17:09:54,860 INFO L273 TraceCheckUtils]: 173: Hoare triple {25496#(<= main_~i~2 5)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25506#(<= main_~i~2 6)} is VALID [2018-11-14 17:09:54,861 INFO L273 TraceCheckUtils]: 174: Hoare triple {25506#(<= main_~i~2 6)} assume true; {25506#(<= main_~i~2 6)} is VALID [2018-11-14 17:09:54,861 INFO L273 TraceCheckUtils]: 175: Hoare triple {25506#(<= main_~i~2 6)} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {25506#(<= main_~i~2 6)} is VALID [2018-11-14 17:09:54,862 INFO L273 TraceCheckUtils]: 176: Hoare triple {25506#(<= main_~i~2 6)} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {25516#(<= main_~i~2 7)} is VALID [2018-11-14 17:09:54,862 INFO L273 TraceCheckUtils]: 177: Hoare triple {25516#(<= main_~i~2 7)} assume true; {25516#(<= main_~i~2 7)} is VALID [2018-11-14 17:09:54,863 INFO L273 TraceCheckUtils]: 178: Hoare triple {25516#(<= main_~i~2 7)} assume !(~i~2 < 999); {24948#false} is VALID [2018-11-14 17:09:54,863 INFO L273 TraceCheckUtils]: 179: Hoare triple {24948#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {24948#false} is VALID [2018-11-14 17:09:54,863 INFO L256 TraceCheckUtils]: 180: Hoare triple {24948#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {24948#false} is VALID [2018-11-14 17:09:54,863 INFO L273 TraceCheckUtils]: 181: Hoare triple {24948#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {24948#false} is VALID [2018-11-14 17:09:54,863 INFO L273 TraceCheckUtils]: 182: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,864 INFO L273 TraceCheckUtils]: 183: Hoare triple {24948#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24948#false} is VALID [2018-11-14 17:09:54,864 INFO L273 TraceCheckUtils]: 184: Hoare triple {24948#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24948#false} is VALID [2018-11-14 17:09:54,864 INFO L273 TraceCheckUtils]: 185: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,864 INFO L273 TraceCheckUtils]: 186: Hoare triple {24948#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24948#false} is VALID [2018-11-14 17:09:54,864 INFO L273 TraceCheckUtils]: 187: Hoare triple {24948#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24948#false} is VALID [2018-11-14 17:09:54,864 INFO L273 TraceCheckUtils]: 188: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,865 INFO L273 TraceCheckUtils]: 189: Hoare triple {24948#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24948#false} is VALID [2018-11-14 17:09:54,865 INFO L273 TraceCheckUtils]: 190: Hoare triple {24948#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24948#false} is VALID [2018-11-14 17:09:54,865 INFO L273 TraceCheckUtils]: 191: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,865 INFO L273 TraceCheckUtils]: 192: Hoare triple {24948#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24948#false} is VALID [2018-11-14 17:09:54,865 INFO L273 TraceCheckUtils]: 193: Hoare triple {24948#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24948#false} is VALID [2018-11-14 17:09:54,865 INFO L273 TraceCheckUtils]: 194: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,866 INFO L273 TraceCheckUtils]: 195: Hoare triple {24948#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24948#false} is VALID [2018-11-14 17:09:54,866 INFO L273 TraceCheckUtils]: 196: Hoare triple {24948#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24948#false} is VALID [2018-11-14 17:09:54,866 INFO L273 TraceCheckUtils]: 197: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,866 INFO L273 TraceCheckUtils]: 198: Hoare triple {24948#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24948#false} is VALID [2018-11-14 17:09:54,866 INFO L273 TraceCheckUtils]: 199: Hoare triple {24948#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24948#false} is VALID [2018-11-14 17:09:54,866 INFO L273 TraceCheckUtils]: 200: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,867 INFO L273 TraceCheckUtils]: 201: Hoare triple {24948#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24948#false} is VALID [2018-11-14 17:09:54,867 INFO L273 TraceCheckUtils]: 202: Hoare triple {24948#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24948#false} is VALID [2018-11-14 17:09:54,867 INFO L273 TraceCheckUtils]: 203: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,867 INFO L273 TraceCheckUtils]: 204: Hoare triple {24948#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {24948#false} is VALID [2018-11-14 17:09:54,867 INFO L273 TraceCheckUtils]: 205: Hoare triple {24948#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {24948#false} is VALID [2018-11-14 17:09:54,867 INFO L273 TraceCheckUtils]: 206: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,868 INFO L273 TraceCheckUtils]: 207: Hoare triple {24948#false} assume !(~i~0 < 1000); {24948#false} is VALID [2018-11-14 17:09:54,868 INFO L273 TraceCheckUtils]: 208: Hoare triple {24948#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {24948#false} is VALID [2018-11-14 17:09:54,868 INFO L273 TraceCheckUtils]: 209: Hoare triple {24948#false} assume true; {24948#false} is VALID [2018-11-14 17:09:54,868 INFO L268 TraceCheckUtils]: 210: Hoare quadruple {24948#false} {24948#false} #77#return; {24948#false} is VALID [2018-11-14 17:09:54,868 INFO L273 TraceCheckUtils]: 211: Hoare triple {24948#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {24948#false} is VALID [2018-11-14 17:09:54,868 INFO L273 TraceCheckUtils]: 212: Hoare triple {24948#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {24948#false} is VALID [2018-11-14 17:09:54,868 INFO L273 TraceCheckUtils]: 213: Hoare triple {24948#false} assume !false; {24948#false} is VALID [2018-11-14 17:09:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2257 backedges. 460 proven. 77 refuted. 0 times theorem prover too weak. 1720 trivial. 0 not checked. [2018-11-14 17:09:54,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:54,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 39 [2018-11-14 17:09:54,907 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 214 [2018-11-14 17:09:54,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:54,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-14 17:09:55,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:55,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-14 17:09:55,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-14 17:09:55,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2018-11-14 17:09:55,123 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 39 states. [2018-11-14 17:09:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:55,910 INFO L93 Difference]: Finished difference Result 226 states and 235 transitions. [2018-11-14 17:09:55,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-14 17:09:55,910 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 214 [2018-11-14 17:09:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:09:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 169 transitions. [2018-11-14 17:09:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 17:09:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 169 transitions. [2018-11-14 17:09:55,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 169 transitions. [2018-11-14 17:09:56,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:56,059 INFO L225 Difference]: With dead ends: 226 [2018-11-14 17:09:56,059 INFO L226 Difference]: Without dead ends: 163 [2018-11-14 17:09:56,060 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=509, Invalid=973, Unknown=0, NotChecked=0, Total=1482 [2018-11-14 17:09:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-14 17:09:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-11-14 17:09:56,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:56,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand 161 states. [2018-11-14 17:09:56,163 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand 161 states. [2018-11-14 17:09:56,163 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 161 states. [2018-11-14 17:09:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:56,168 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2018-11-14 17:09:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2018-11-14 17:09:56,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:56,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:56,168 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 163 states. [2018-11-14 17:09:56,169 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 163 states. [2018-11-14 17:09:56,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:56,172 INFO L93 Difference]: Finished difference Result 163 states and 167 transitions. [2018-11-14 17:09:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2018-11-14 17:09:56,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:56,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:56,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:56,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-11-14 17:09:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2018-11-14 17:09:56,176 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 214 [2018-11-14 17:09:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:56,176 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2018-11-14 17:09:56,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-14 17:09:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2018-11-14 17:09:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-11-14 17:09:56,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:56,178 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 27, 24, 24, 9, 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-14 17:09:56,178 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:56,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:56,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1788125590, now seen corresponding path program 28 times [2018-11-14 17:09:56,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:56,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:56,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:56,974 INFO L256 TraceCheckUtils]: 0: Hoare triple {26473#true} call ULTIMATE.init(); {26473#true} is VALID [2018-11-14 17:09:56,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {26473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26473#true} is VALID [2018-11-14 17:09:56,974 INFO L273 TraceCheckUtils]: 2: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:56,974 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26473#true} {26473#true} #69#return; {26473#true} is VALID [2018-11-14 17:09:56,974 INFO L256 TraceCheckUtils]: 4: Hoare triple {26473#true} call #t~ret13 := main(); {26473#true} is VALID [2018-11-14 17:09:56,975 INFO L273 TraceCheckUtils]: 5: Hoare triple {26473#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26475#(= main_~i~1 0)} is VALID [2018-11-14 17:09:56,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {26475#(= main_~i~1 0)} assume true; {26475#(= main_~i~1 0)} is VALID [2018-11-14 17:09:56,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {26475#(= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26475#(= main_~i~1 0)} is VALID [2018-11-14 17:09:56,976 INFO L273 TraceCheckUtils]: 8: Hoare triple {26475#(= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26476#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:56,977 INFO L273 TraceCheckUtils]: 9: Hoare triple {26476#(<= main_~i~1 1)} assume true; {26476#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:56,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {26476#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26476#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:56,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {26476#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26477#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:56,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {26477#(<= main_~i~1 2)} assume true; {26477#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:56,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {26477#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26477#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:56,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {26477#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26478#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:56,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {26478#(<= main_~i~1 3)} assume true; {26478#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:56,980 INFO L273 TraceCheckUtils]: 16: Hoare triple {26478#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26478#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:56,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {26478#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26479#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:56,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {26479#(<= main_~i~1 4)} assume true; {26479#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:56,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {26479#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26479#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:56,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {26479#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26480#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:56,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {26480#(<= main_~i~1 5)} assume true; {26480#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:56,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {26480#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26480#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:56,983 INFO L273 TraceCheckUtils]: 23: Hoare triple {26480#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26481#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:56,984 INFO L273 TraceCheckUtils]: 24: Hoare triple {26481#(<= main_~i~1 6)} assume true; {26481#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:56,984 INFO L273 TraceCheckUtils]: 25: Hoare triple {26481#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26481#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:56,985 INFO L273 TraceCheckUtils]: 26: Hoare triple {26481#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26482#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:56,985 INFO L273 TraceCheckUtils]: 27: Hoare triple {26482#(<= main_~i~1 7)} assume true; {26482#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:56,986 INFO L273 TraceCheckUtils]: 28: Hoare triple {26482#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26482#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:56,987 INFO L273 TraceCheckUtils]: 29: Hoare triple {26482#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26483#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:56,987 INFO L273 TraceCheckUtils]: 30: Hoare triple {26483#(<= main_~i~1 8)} assume true; {26483#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:56,987 INFO L273 TraceCheckUtils]: 31: Hoare triple {26483#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26483#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:56,988 INFO L273 TraceCheckUtils]: 32: Hoare triple {26483#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26484#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:56,989 INFO L273 TraceCheckUtils]: 33: Hoare triple {26484#(<= main_~i~1 9)} assume true; {26484#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:56,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {26484#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26484#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:56,990 INFO L273 TraceCheckUtils]: 35: Hoare triple {26484#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26485#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:56,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {26485#(<= main_~i~1 10)} assume true; {26485#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:56,991 INFO L273 TraceCheckUtils]: 37: Hoare triple {26485#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26485#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:56,991 INFO L273 TraceCheckUtils]: 38: Hoare triple {26485#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26486#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:56,992 INFO L273 TraceCheckUtils]: 39: Hoare triple {26486#(<= main_~i~1 11)} assume true; {26486#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:56,992 INFO L273 TraceCheckUtils]: 40: Hoare triple {26486#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26486#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:56,993 INFO L273 TraceCheckUtils]: 41: Hoare triple {26486#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26487#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:56,993 INFO L273 TraceCheckUtils]: 42: Hoare triple {26487#(<= main_~i~1 12)} assume true; {26487#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:56,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {26487#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26487#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:56,995 INFO L273 TraceCheckUtils]: 44: Hoare triple {26487#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26488#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:56,995 INFO L273 TraceCheckUtils]: 45: Hoare triple {26488#(<= main_~i~1 13)} assume true; {26488#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:56,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {26488#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26488#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:56,996 INFO L273 TraceCheckUtils]: 47: Hoare triple {26488#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26489#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:56,997 INFO L273 TraceCheckUtils]: 48: Hoare triple {26489#(<= main_~i~1 14)} assume true; {26489#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:56,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {26489#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26489#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:56,998 INFO L273 TraceCheckUtils]: 50: Hoare triple {26489#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26490#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:56,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {26490#(<= main_~i~1 15)} assume true; {26490#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:56,999 INFO L273 TraceCheckUtils]: 52: Hoare triple {26490#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26490#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:56,999 INFO L273 TraceCheckUtils]: 53: Hoare triple {26490#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26491#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:57,000 INFO L273 TraceCheckUtils]: 54: Hoare triple {26491#(<= main_~i~1 16)} assume true; {26491#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:57,000 INFO L273 TraceCheckUtils]: 55: Hoare triple {26491#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26491#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:57,001 INFO L273 TraceCheckUtils]: 56: Hoare triple {26491#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26492#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:57,001 INFO L273 TraceCheckUtils]: 57: Hoare triple {26492#(<= main_~i~1 17)} assume true; {26492#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:57,002 INFO L273 TraceCheckUtils]: 58: Hoare triple {26492#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26492#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:57,003 INFO L273 TraceCheckUtils]: 59: Hoare triple {26492#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26493#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:57,003 INFO L273 TraceCheckUtils]: 60: Hoare triple {26493#(<= main_~i~1 18)} assume true; {26493#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:57,004 INFO L273 TraceCheckUtils]: 61: Hoare triple {26493#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26493#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:57,004 INFO L273 TraceCheckUtils]: 62: Hoare triple {26493#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26494#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:57,005 INFO L273 TraceCheckUtils]: 63: Hoare triple {26494#(<= main_~i~1 19)} assume true; {26494#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:57,005 INFO L273 TraceCheckUtils]: 64: Hoare triple {26494#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26494#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:57,006 INFO L273 TraceCheckUtils]: 65: Hoare triple {26494#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26495#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:57,006 INFO L273 TraceCheckUtils]: 66: Hoare triple {26495#(<= main_~i~1 20)} assume true; {26495#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:57,007 INFO L273 TraceCheckUtils]: 67: Hoare triple {26495#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26495#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:57,007 INFO L273 TraceCheckUtils]: 68: Hoare triple {26495#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26496#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:57,008 INFO L273 TraceCheckUtils]: 69: Hoare triple {26496#(<= main_~i~1 21)} assume true; {26496#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:57,008 INFO L273 TraceCheckUtils]: 70: Hoare triple {26496#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26496#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:57,009 INFO L273 TraceCheckUtils]: 71: Hoare triple {26496#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26497#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:57,009 INFO L273 TraceCheckUtils]: 72: Hoare triple {26497#(<= main_~i~1 22)} assume true; {26497#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:57,010 INFO L273 TraceCheckUtils]: 73: Hoare triple {26497#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26497#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:57,011 INFO L273 TraceCheckUtils]: 74: Hoare triple {26497#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26498#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:57,011 INFO L273 TraceCheckUtils]: 75: Hoare triple {26498#(<= main_~i~1 23)} assume true; {26498#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:57,012 INFO L273 TraceCheckUtils]: 76: Hoare triple {26498#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26498#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:57,012 INFO L273 TraceCheckUtils]: 77: Hoare triple {26498#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26499#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:57,013 INFO L273 TraceCheckUtils]: 78: Hoare triple {26499#(<= main_~i~1 24)} assume true; {26499#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:57,013 INFO L273 TraceCheckUtils]: 79: Hoare triple {26499#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26499#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:57,014 INFO L273 TraceCheckUtils]: 80: Hoare triple {26499#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26500#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:57,014 INFO L273 TraceCheckUtils]: 81: Hoare triple {26500#(<= main_~i~1 25)} assume true; {26500#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:57,015 INFO L273 TraceCheckUtils]: 82: Hoare triple {26500#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26500#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:57,015 INFO L273 TraceCheckUtils]: 83: Hoare triple {26500#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26501#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:57,016 INFO L273 TraceCheckUtils]: 84: Hoare triple {26501#(<= main_~i~1 26)} assume true; {26501#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:57,016 INFO L273 TraceCheckUtils]: 85: Hoare triple {26501#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26501#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:57,017 INFO L273 TraceCheckUtils]: 86: Hoare triple {26501#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26502#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:57,017 INFO L273 TraceCheckUtils]: 87: Hoare triple {26502#(<= main_~i~1 27)} assume true; {26502#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:57,018 INFO L273 TraceCheckUtils]: 88: Hoare triple {26502#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26502#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:57,019 INFO L273 TraceCheckUtils]: 89: Hoare triple {26502#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26503#(<= main_~i~1 28)} is VALID [2018-11-14 17:09:57,019 INFO L273 TraceCheckUtils]: 90: Hoare triple {26503#(<= main_~i~1 28)} assume true; {26503#(<= main_~i~1 28)} is VALID [2018-11-14 17:09:57,020 INFO L273 TraceCheckUtils]: 91: Hoare triple {26503#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26503#(<= main_~i~1 28)} is VALID [2018-11-14 17:09:57,020 INFO L273 TraceCheckUtils]: 92: Hoare triple {26503#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26504#(<= main_~i~1 29)} is VALID [2018-11-14 17:09:57,021 INFO L273 TraceCheckUtils]: 93: Hoare triple {26504#(<= main_~i~1 29)} assume true; {26504#(<= main_~i~1 29)} is VALID [2018-11-14 17:09:57,021 INFO L273 TraceCheckUtils]: 94: Hoare triple {26504#(<= main_~i~1 29)} assume !(~i~1 < 1000); {26474#false} is VALID [2018-11-14 17:09:57,021 INFO L256 TraceCheckUtils]: 95: Hoare triple {26474#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {26473#true} is VALID [2018-11-14 17:09:57,022 INFO L273 TraceCheckUtils]: 96: Hoare triple {26473#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26473#true} is VALID [2018-11-14 17:09:57,022 INFO L273 TraceCheckUtils]: 97: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,022 INFO L273 TraceCheckUtils]: 98: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,022 INFO L273 TraceCheckUtils]: 99: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,022 INFO L273 TraceCheckUtils]: 100: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,022 INFO L273 TraceCheckUtils]: 101: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,023 INFO L273 TraceCheckUtils]: 102: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,023 INFO L273 TraceCheckUtils]: 103: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,023 INFO L273 TraceCheckUtils]: 104: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,023 INFO L273 TraceCheckUtils]: 105: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,023 INFO L273 TraceCheckUtils]: 106: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,023 INFO L273 TraceCheckUtils]: 107: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,024 INFO L273 TraceCheckUtils]: 108: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,024 INFO L273 TraceCheckUtils]: 109: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,024 INFO L273 TraceCheckUtils]: 110: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,024 INFO L273 TraceCheckUtils]: 111: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,024 INFO L273 TraceCheckUtils]: 112: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,024 INFO L273 TraceCheckUtils]: 113: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,024 INFO L273 TraceCheckUtils]: 114: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,024 INFO L273 TraceCheckUtils]: 115: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,024 INFO L273 TraceCheckUtils]: 116: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,025 INFO L273 TraceCheckUtils]: 117: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,025 INFO L273 TraceCheckUtils]: 118: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,025 INFO L273 TraceCheckUtils]: 119: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,025 INFO L273 TraceCheckUtils]: 120: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,025 INFO L273 TraceCheckUtils]: 121: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,025 INFO L273 TraceCheckUtils]: 122: Hoare triple {26473#true} assume !(~i~0 < 1000); {26473#true} is VALID [2018-11-14 17:09:57,025 INFO L273 TraceCheckUtils]: 123: Hoare triple {26473#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26473#true} is VALID [2018-11-14 17:09:57,025 INFO L273 TraceCheckUtils]: 124: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,025 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26473#true} {26474#false} #73#return; {26474#false} is VALID [2018-11-14 17:09:57,025 INFO L273 TraceCheckUtils]: 126: Hoare triple {26474#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {26474#false} is VALID [2018-11-14 17:09:57,026 INFO L256 TraceCheckUtils]: 127: Hoare triple {26474#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {26473#true} is VALID [2018-11-14 17:09:57,026 INFO L273 TraceCheckUtils]: 128: Hoare triple {26473#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26473#true} is VALID [2018-11-14 17:09:57,026 INFO L273 TraceCheckUtils]: 129: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,026 INFO L273 TraceCheckUtils]: 130: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,026 INFO L273 TraceCheckUtils]: 131: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,026 INFO L273 TraceCheckUtils]: 132: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,026 INFO L273 TraceCheckUtils]: 133: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,026 INFO L273 TraceCheckUtils]: 134: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,026 INFO L273 TraceCheckUtils]: 135: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,026 INFO L273 TraceCheckUtils]: 136: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 137: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 138: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 139: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 140: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 141: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 142: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 143: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 144: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 145: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,027 INFO L273 TraceCheckUtils]: 146: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 147: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 148: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 149: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 150: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 151: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 152: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 153: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 154: Hoare triple {26473#true} assume !(~i~0 < 1000); {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 155: Hoare triple {26473#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26473#true} is VALID [2018-11-14 17:09:57,028 INFO L273 TraceCheckUtils]: 156: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,029 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {26473#true} {26474#false} #75#return; {26474#false} is VALID [2018-11-14 17:09:57,029 INFO L273 TraceCheckUtils]: 158: Hoare triple {26474#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26474#false} is VALID [2018-11-14 17:09:57,029 INFO L273 TraceCheckUtils]: 159: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,029 INFO L273 TraceCheckUtils]: 160: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,029 INFO L273 TraceCheckUtils]: 161: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,029 INFO L273 TraceCheckUtils]: 162: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,029 INFO L273 TraceCheckUtils]: 163: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,029 INFO L273 TraceCheckUtils]: 164: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,029 INFO L273 TraceCheckUtils]: 165: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 166: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 167: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 168: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 169: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 170: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 171: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 172: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 173: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 174: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,030 INFO L273 TraceCheckUtils]: 175: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,031 INFO L273 TraceCheckUtils]: 176: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,031 INFO L273 TraceCheckUtils]: 177: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,031 INFO L273 TraceCheckUtils]: 178: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,031 INFO L273 TraceCheckUtils]: 179: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,031 INFO L273 TraceCheckUtils]: 180: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,031 INFO L273 TraceCheckUtils]: 181: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,031 INFO L273 TraceCheckUtils]: 182: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,032 INFO L273 TraceCheckUtils]: 183: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,032 INFO L273 TraceCheckUtils]: 184: Hoare triple {26474#false} assume !(~i~2 < 999); {26474#false} is VALID [2018-11-14 17:09:57,032 INFO L273 TraceCheckUtils]: 185: Hoare triple {26474#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {26474#false} is VALID [2018-11-14 17:09:57,032 INFO L256 TraceCheckUtils]: 186: Hoare triple {26474#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {26473#true} is VALID [2018-11-14 17:09:57,032 INFO L273 TraceCheckUtils]: 187: Hoare triple {26473#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~res~0;call #t~mem0 := read~int(~x.base, ~x.offset + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26473#true} is VALID [2018-11-14 17:09:57,032 INFO L273 TraceCheckUtils]: 188: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,032 INFO L273 TraceCheckUtils]: 189: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,032 INFO L273 TraceCheckUtils]: 190: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,032 INFO L273 TraceCheckUtils]: 191: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 192: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 193: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 194: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 195: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 196: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 197: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 198: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 199: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 200: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 201: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,033 INFO L273 TraceCheckUtils]: 202: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,034 INFO L273 TraceCheckUtils]: 203: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,034 INFO L273 TraceCheckUtils]: 204: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,034 INFO L273 TraceCheckUtils]: 205: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,034 INFO L273 TraceCheckUtils]: 206: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,034 INFO L273 TraceCheckUtils]: 207: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,034 INFO L273 TraceCheckUtils]: 208: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,034 INFO L273 TraceCheckUtils]: 209: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,034 INFO L273 TraceCheckUtils]: 210: Hoare triple {26473#true} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26473#true} is VALID [2018-11-14 17:09:57,034 INFO L273 TraceCheckUtils]: 211: Hoare triple {26473#true} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26473#true} is VALID [2018-11-14 17:09:57,035 INFO L273 TraceCheckUtils]: 212: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,035 INFO L273 TraceCheckUtils]: 213: Hoare triple {26473#true} assume !(~i~0 < 1000); {26473#true} is VALID [2018-11-14 17:09:57,035 INFO L273 TraceCheckUtils]: 214: Hoare triple {26473#true} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26473#true} is VALID [2018-11-14 17:09:57,035 INFO L273 TraceCheckUtils]: 215: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,035 INFO L268 TraceCheckUtils]: 216: Hoare quadruple {26473#true} {26474#false} #77#return; {26474#false} is VALID [2018-11-14 17:09:57,035 INFO L273 TraceCheckUtils]: 217: Hoare triple {26474#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26474#false} is VALID [2018-11-14 17:09:57,035 INFO L273 TraceCheckUtils]: 218: Hoare triple {26474#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26474#false} is VALID [2018-11-14 17:09:57,035 INFO L273 TraceCheckUtils]: 219: Hoare triple {26474#false} assume !false; {26474#false} is VALID [2018-11-14 17:09:57,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2366 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 17:09:57,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:09:57,081 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-14 17:09:57,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:09:57,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:09:57,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:09:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:09:57,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:09:57,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {26473#true} call ULTIMATE.init(); {26473#true} is VALID [2018-11-14 17:09:57,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {26473#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26473#true} is VALID [2018-11-14 17:09:57,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {26473#true} assume true; {26473#true} is VALID [2018-11-14 17:09:57,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26473#true} {26473#true} #69#return; {26473#true} is VALID [2018-11-14 17:09:57,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {26473#true} call #t~ret13 := main(); {26473#true} is VALID [2018-11-14 17:09:57,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {26473#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(4000);havoc ~temp~0;havoc ~ret~0;havoc ~ret2~0;havoc ~ret5~0;~i~1 := 0; {26523#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:57,480 INFO L273 TraceCheckUtils]: 6: Hoare triple {26523#(<= main_~i~1 0)} assume true; {26523#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:57,480 INFO L273 TraceCheckUtils]: 7: Hoare triple {26523#(<= main_~i~1 0)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26523#(<= main_~i~1 0)} is VALID [2018-11-14 17:09:57,481 INFO L273 TraceCheckUtils]: 8: Hoare triple {26523#(<= main_~i~1 0)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26476#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:57,481 INFO L273 TraceCheckUtils]: 9: Hoare triple {26476#(<= main_~i~1 1)} assume true; {26476#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:57,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {26476#(<= main_~i~1 1)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26476#(<= main_~i~1 1)} is VALID [2018-11-14 17:09:57,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {26476#(<= main_~i~1 1)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26477#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:57,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {26477#(<= main_~i~1 2)} assume true; {26477#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:57,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {26477#(<= main_~i~1 2)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26477#(<= main_~i~1 2)} is VALID [2018-11-14 17:09:57,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {26477#(<= main_~i~1 2)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26478#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:57,484 INFO L273 TraceCheckUtils]: 15: Hoare triple {26478#(<= main_~i~1 3)} assume true; {26478#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:57,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {26478#(<= main_~i~1 3)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26478#(<= main_~i~1 3)} is VALID [2018-11-14 17:09:57,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {26478#(<= main_~i~1 3)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26479#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:57,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {26479#(<= main_~i~1 4)} assume true; {26479#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:57,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {26479#(<= main_~i~1 4)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26479#(<= main_~i~1 4)} is VALID [2018-11-14 17:09:57,486 INFO L273 TraceCheckUtils]: 20: Hoare triple {26479#(<= main_~i~1 4)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26480#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:57,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {26480#(<= main_~i~1 5)} assume true; {26480#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:57,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {26480#(<= main_~i~1 5)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26480#(<= main_~i~1 5)} is VALID [2018-11-14 17:09:57,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {26480#(<= main_~i~1 5)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26481#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:57,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {26481#(<= main_~i~1 6)} assume true; {26481#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:57,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {26481#(<= main_~i~1 6)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26481#(<= main_~i~1 6)} is VALID [2018-11-14 17:09:57,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {26481#(<= main_~i~1 6)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26482#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:57,490 INFO L273 TraceCheckUtils]: 27: Hoare triple {26482#(<= main_~i~1 7)} assume true; {26482#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:57,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {26482#(<= main_~i~1 7)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26482#(<= main_~i~1 7)} is VALID [2018-11-14 17:09:57,491 INFO L273 TraceCheckUtils]: 29: Hoare triple {26482#(<= main_~i~1 7)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26483#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:57,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {26483#(<= main_~i~1 8)} assume true; {26483#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:57,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {26483#(<= main_~i~1 8)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26483#(<= main_~i~1 8)} is VALID [2018-11-14 17:09:57,493 INFO L273 TraceCheckUtils]: 32: Hoare triple {26483#(<= main_~i~1 8)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26484#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:57,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {26484#(<= main_~i~1 9)} assume true; {26484#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:57,494 INFO L273 TraceCheckUtils]: 34: Hoare triple {26484#(<= main_~i~1 9)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26484#(<= main_~i~1 9)} is VALID [2018-11-14 17:09:57,494 INFO L273 TraceCheckUtils]: 35: Hoare triple {26484#(<= main_~i~1 9)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26485#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:57,495 INFO L273 TraceCheckUtils]: 36: Hoare triple {26485#(<= main_~i~1 10)} assume true; {26485#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:57,495 INFO L273 TraceCheckUtils]: 37: Hoare triple {26485#(<= main_~i~1 10)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26485#(<= main_~i~1 10)} is VALID [2018-11-14 17:09:57,496 INFO L273 TraceCheckUtils]: 38: Hoare triple {26485#(<= main_~i~1 10)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26486#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:57,497 INFO L273 TraceCheckUtils]: 39: Hoare triple {26486#(<= main_~i~1 11)} assume true; {26486#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:57,497 INFO L273 TraceCheckUtils]: 40: Hoare triple {26486#(<= main_~i~1 11)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26486#(<= main_~i~1 11)} is VALID [2018-11-14 17:09:57,498 INFO L273 TraceCheckUtils]: 41: Hoare triple {26486#(<= main_~i~1 11)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26487#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:57,498 INFO L273 TraceCheckUtils]: 42: Hoare triple {26487#(<= main_~i~1 12)} assume true; {26487#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:57,499 INFO L273 TraceCheckUtils]: 43: Hoare triple {26487#(<= main_~i~1 12)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26487#(<= main_~i~1 12)} is VALID [2018-11-14 17:09:57,499 INFO L273 TraceCheckUtils]: 44: Hoare triple {26487#(<= main_~i~1 12)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26488#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:57,500 INFO L273 TraceCheckUtils]: 45: Hoare triple {26488#(<= main_~i~1 13)} assume true; {26488#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:57,500 INFO L273 TraceCheckUtils]: 46: Hoare triple {26488#(<= main_~i~1 13)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26488#(<= main_~i~1 13)} is VALID [2018-11-14 17:09:57,501 INFO L273 TraceCheckUtils]: 47: Hoare triple {26488#(<= main_~i~1 13)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26489#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:57,501 INFO L273 TraceCheckUtils]: 48: Hoare triple {26489#(<= main_~i~1 14)} assume true; {26489#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:57,502 INFO L273 TraceCheckUtils]: 49: Hoare triple {26489#(<= main_~i~1 14)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26489#(<= main_~i~1 14)} is VALID [2018-11-14 17:09:57,502 INFO L273 TraceCheckUtils]: 50: Hoare triple {26489#(<= main_~i~1 14)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26490#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:57,503 INFO L273 TraceCheckUtils]: 51: Hoare triple {26490#(<= main_~i~1 15)} assume true; {26490#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:57,503 INFO L273 TraceCheckUtils]: 52: Hoare triple {26490#(<= main_~i~1 15)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26490#(<= main_~i~1 15)} is VALID [2018-11-14 17:09:57,504 INFO L273 TraceCheckUtils]: 53: Hoare triple {26490#(<= main_~i~1 15)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26491#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:57,505 INFO L273 TraceCheckUtils]: 54: Hoare triple {26491#(<= main_~i~1 16)} assume true; {26491#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:57,505 INFO L273 TraceCheckUtils]: 55: Hoare triple {26491#(<= main_~i~1 16)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26491#(<= main_~i~1 16)} is VALID [2018-11-14 17:09:57,506 INFO L273 TraceCheckUtils]: 56: Hoare triple {26491#(<= main_~i~1 16)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26492#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:57,506 INFO L273 TraceCheckUtils]: 57: Hoare triple {26492#(<= main_~i~1 17)} assume true; {26492#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:57,507 INFO L273 TraceCheckUtils]: 58: Hoare triple {26492#(<= main_~i~1 17)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26492#(<= main_~i~1 17)} is VALID [2018-11-14 17:09:57,507 INFO L273 TraceCheckUtils]: 59: Hoare triple {26492#(<= main_~i~1 17)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26493#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:57,508 INFO L273 TraceCheckUtils]: 60: Hoare triple {26493#(<= main_~i~1 18)} assume true; {26493#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:57,508 INFO L273 TraceCheckUtils]: 61: Hoare triple {26493#(<= main_~i~1 18)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26493#(<= main_~i~1 18)} is VALID [2018-11-14 17:09:57,509 INFO L273 TraceCheckUtils]: 62: Hoare triple {26493#(<= main_~i~1 18)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26494#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:57,509 INFO L273 TraceCheckUtils]: 63: Hoare triple {26494#(<= main_~i~1 19)} assume true; {26494#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:57,510 INFO L273 TraceCheckUtils]: 64: Hoare triple {26494#(<= main_~i~1 19)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26494#(<= main_~i~1 19)} is VALID [2018-11-14 17:09:57,510 INFO L273 TraceCheckUtils]: 65: Hoare triple {26494#(<= main_~i~1 19)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26495#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:57,511 INFO L273 TraceCheckUtils]: 66: Hoare triple {26495#(<= main_~i~1 20)} assume true; {26495#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:57,511 INFO L273 TraceCheckUtils]: 67: Hoare triple {26495#(<= main_~i~1 20)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26495#(<= main_~i~1 20)} is VALID [2018-11-14 17:09:57,512 INFO L273 TraceCheckUtils]: 68: Hoare triple {26495#(<= main_~i~1 20)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26496#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:57,512 INFO L273 TraceCheckUtils]: 69: Hoare triple {26496#(<= main_~i~1 21)} assume true; {26496#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:57,513 INFO L273 TraceCheckUtils]: 70: Hoare triple {26496#(<= main_~i~1 21)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26496#(<= main_~i~1 21)} is VALID [2018-11-14 17:09:57,514 INFO L273 TraceCheckUtils]: 71: Hoare triple {26496#(<= main_~i~1 21)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26497#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:57,514 INFO L273 TraceCheckUtils]: 72: Hoare triple {26497#(<= main_~i~1 22)} assume true; {26497#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:57,515 INFO L273 TraceCheckUtils]: 73: Hoare triple {26497#(<= main_~i~1 22)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26497#(<= main_~i~1 22)} is VALID [2018-11-14 17:09:57,515 INFO L273 TraceCheckUtils]: 74: Hoare triple {26497#(<= main_~i~1 22)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26498#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:57,516 INFO L273 TraceCheckUtils]: 75: Hoare triple {26498#(<= main_~i~1 23)} assume true; {26498#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:57,516 INFO L273 TraceCheckUtils]: 76: Hoare triple {26498#(<= main_~i~1 23)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26498#(<= main_~i~1 23)} is VALID [2018-11-14 17:09:57,517 INFO L273 TraceCheckUtils]: 77: Hoare triple {26498#(<= main_~i~1 23)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26499#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:57,517 INFO L273 TraceCheckUtils]: 78: Hoare triple {26499#(<= main_~i~1 24)} assume true; {26499#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:57,518 INFO L273 TraceCheckUtils]: 79: Hoare triple {26499#(<= main_~i~1 24)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26499#(<= main_~i~1 24)} is VALID [2018-11-14 17:09:57,518 INFO L273 TraceCheckUtils]: 80: Hoare triple {26499#(<= main_~i~1 24)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26500#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:57,519 INFO L273 TraceCheckUtils]: 81: Hoare triple {26500#(<= main_~i~1 25)} assume true; {26500#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:57,519 INFO L273 TraceCheckUtils]: 82: Hoare triple {26500#(<= main_~i~1 25)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26500#(<= main_~i~1 25)} is VALID [2018-11-14 17:09:57,520 INFO L273 TraceCheckUtils]: 83: Hoare triple {26500#(<= main_~i~1 25)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26501#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:57,520 INFO L273 TraceCheckUtils]: 84: Hoare triple {26501#(<= main_~i~1 26)} assume true; {26501#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:57,521 INFO L273 TraceCheckUtils]: 85: Hoare triple {26501#(<= main_~i~1 26)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26501#(<= main_~i~1 26)} is VALID [2018-11-14 17:09:57,522 INFO L273 TraceCheckUtils]: 86: Hoare triple {26501#(<= main_~i~1 26)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26502#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:57,522 INFO L273 TraceCheckUtils]: 87: Hoare triple {26502#(<= main_~i~1 27)} assume true; {26502#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:57,522 INFO L273 TraceCheckUtils]: 88: Hoare triple {26502#(<= main_~i~1 27)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26502#(<= main_~i~1 27)} is VALID [2018-11-14 17:09:57,523 INFO L273 TraceCheckUtils]: 89: Hoare triple {26502#(<= main_~i~1 27)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26503#(<= main_~i~1 28)} is VALID [2018-11-14 17:09:57,524 INFO L273 TraceCheckUtils]: 90: Hoare triple {26503#(<= main_~i~1 28)} assume true; {26503#(<= main_~i~1 28)} is VALID [2018-11-14 17:09:57,524 INFO L273 TraceCheckUtils]: 91: Hoare triple {26503#(<= main_~i~1 28)} assume !!(~i~1 < 1000);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#x~0.base, ~#x~0.offset + ~i~1 * 4, 4);havoc #t~nondet4; {26503#(<= main_~i~1 28)} is VALID [2018-11-14 17:09:57,525 INFO L273 TraceCheckUtils]: 92: Hoare triple {26503#(<= main_~i~1 28)} #t~post3 := ~i~1;~i~1 := #t~post3 + 1;havoc #t~post3; {26504#(<= main_~i~1 29)} is VALID [2018-11-14 17:09:57,525 INFO L273 TraceCheckUtils]: 93: Hoare triple {26504#(<= main_~i~1 29)} assume true; {26504#(<= main_~i~1 29)} is VALID [2018-11-14 17:09:57,526 INFO L273 TraceCheckUtils]: 94: Hoare triple {26504#(<= main_~i~1 29)} assume !(~i~1 < 1000); {26474#false} is VALID [2018-11-14 17:09:57,526 INFO L256 TraceCheckUtils]: 95: Hoare triple {26474#false} call #t~ret5 := xor(~#x~0.base, ~#x~0.offset); {26474#false} is VALID [2018-11-14 17:09:57,526 INFO L273 TraceCheckUtils]: 96: Hoare triple {26474#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26474#false} is VALID [2018-11-14 17:09:57,526 INFO L273 TraceCheckUtils]: 97: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,527 INFO L273 TraceCheckUtils]: 98: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,527 INFO L273 TraceCheckUtils]: 99: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,527 INFO L273 TraceCheckUtils]: 100: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,527 INFO L273 TraceCheckUtils]: 101: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,527 INFO L273 TraceCheckUtils]: 102: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,527 INFO L273 TraceCheckUtils]: 103: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,527 INFO L273 TraceCheckUtils]: 104: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,528 INFO L273 TraceCheckUtils]: 105: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,528 INFO L273 TraceCheckUtils]: 106: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,528 INFO L273 TraceCheckUtils]: 107: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,528 INFO L273 TraceCheckUtils]: 108: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,528 INFO L273 TraceCheckUtils]: 109: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,528 INFO L273 TraceCheckUtils]: 110: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,529 INFO L273 TraceCheckUtils]: 111: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,529 INFO L273 TraceCheckUtils]: 112: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,529 INFO L273 TraceCheckUtils]: 113: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,529 INFO L273 TraceCheckUtils]: 114: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,529 INFO L273 TraceCheckUtils]: 115: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,529 INFO L273 TraceCheckUtils]: 116: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,530 INFO L273 TraceCheckUtils]: 117: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,530 INFO L273 TraceCheckUtils]: 118: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,530 INFO L273 TraceCheckUtils]: 119: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,530 INFO L273 TraceCheckUtils]: 120: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,530 INFO L273 TraceCheckUtils]: 121: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,530 INFO L273 TraceCheckUtils]: 122: Hoare triple {26474#false} assume !(~i~0 < 1000); {26474#false} is VALID [2018-11-14 17:09:57,531 INFO L273 TraceCheckUtils]: 123: Hoare triple {26474#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26474#false} is VALID [2018-11-14 17:09:57,531 INFO L273 TraceCheckUtils]: 124: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,531 INFO L268 TraceCheckUtils]: 125: Hoare quadruple {26474#false} {26474#false} #73#return; {26474#false} is VALID [2018-11-14 17:09:57,531 INFO L273 TraceCheckUtils]: 126: Hoare triple {26474#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 + 0, 4);~temp~0 := #t~mem6;havoc #t~mem6;call #t~mem7 := read~int(~#x~0.base, ~#x~0.offset + 4, 4);call write~int(#t~mem7, ~#x~0.base, ~#x~0.offset + 0, 4);havoc #t~mem7;call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 4, 4); {26474#false} is VALID [2018-11-14 17:09:57,531 INFO L256 TraceCheckUtils]: 127: Hoare triple {26474#false} call #t~ret8 := xor(~#x~0.base, ~#x~0.offset); {26474#false} is VALID [2018-11-14 17:09:57,531 INFO L273 TraceCheckUtils]: 128: Hoare triple {26474#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26474#false} is VALID [2018-11-14 17:09:57,531 INFO L273 TraceCheckUtils]: 129: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,531 INFO L273 TraceCheckUtils]: 130: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,531 INFO L273 TraceCheckUtils]: 131: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 132: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 133: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 134: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 135: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 136: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 137: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 138: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 139: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 140: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,532 INFO L273 TraceCheckUtils]: 141: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 142: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 143: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 144: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 145: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 146: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 147: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 148: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 149: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 150: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,533 INFO L273 TraceCheckUtils]: 151: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L273 TraceCheckUtils]: 152: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L273 TraceCheckUtils]: 153: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L273 TraceCheckUtils]: 154: Hoare triple {26474#false} assume !(~i~0 < 1000); {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L273 TraceCheckUtils]: 155: Hoare triple {26474#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L273 TraceCheckUtils]: 156: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L268 TraceCheckUtils]: 157: Hoare quadruple {26474#false} {26474#false} #75#return; {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L273 TraceCheckUtils]: 158: Hoare triple {26474#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 + 0, 4);~temp~0 := #t~mem9;havoc #t~mem9;~i~2 := 0; {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L273 TraceCheckUtils]: 159: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L273 TraceCheckUtils]: 160: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,534 INFO L273 TraceCheckUtils]: 161: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 162: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 163: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 164: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 165: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 166: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 167: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 168: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 169: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 170: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,535 INFO L273 TraceCheckUtils]: 171: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 172: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 173: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 174: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 175: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 176: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 177: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 178: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 179: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 180: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,536 INFO L273 TraceCheckUtils]: 181: Hoare triple {26474#false} assume !!(~i~2 < 999);call #t~mem11 := read~int(~#x~0.base, ~#x~0.offset + (~i~2 + 1) * 4, 4);call write~int(#t~mem11, ~#x~0.base, ~#x~0.offset + ~i~2 * 4, 4);havoc #t~mem11; {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L273 TraceCheckUtils]: 182: Hoare triple {26474#false} #t~post10 := ~i~2;~i~2 := #t~post10 + 1;havoc #t~post10; {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L273 TraceCheckUtils]: 183: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L273 TraceCheckUtils]: 184: Hoare triple {26474#false} assume !(~i~2 < 999); {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L273 TraceCheckUtils]: 185: Hoare triple {26474#false} call write~int(~temp~0, ~#x~0.base, ~#x~0.offset + 3996, 4); {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L256 TraceCheckUtils]: 186: Hoare triple {26474#false} call #t~ret12 := xor(~#x~0.base, ~#x~0.offset); {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L273 TraceCheckUtils]: 187: Hoare triple {26474#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 + 0, 4);~res~0 := #t~mem0;havoc #t~mem0;~i~0 := 1; {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L273 TraceCheckUtils]: 188: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L273 TraceCheckUtils]: 189: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L273 TraceCheckUtils]: 190: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,537 INFO L273 TraceCheckUtils]: 191: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 192: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 193: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 194: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 195: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 196: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 197: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 198: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 199: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 200: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,538 INFO L273 TraceCheckUtils]: 201: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 202: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 203: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 204: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 205: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 206: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 207: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 208: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 209: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 210: Hoare triple {26474#false} assume !!(~i~0 < 1000);call #t~mem2 := read~int(~x.base, ~x.offset + ~i~0 * 4, 4);~res~0 := ~bitwiseXor(~res~0, #t~mem2);havoc #t~mem2; {26474#false} is VALID [2018-11-14 17:09:57,539 INFO L273 TraceCheckUtils]: 211: Hoare triple {26474#false} #t~post1 := ~i~0;~i~0 := #t~post1 + 1;havoc #t~post1; {26474#false} is VALID [2018-11-14 17:09:57,540 INFO L273 TraceCheckUtils]: 212: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,540 INFO L273 TraceCheckUtils]: 213: Hoare triple {26474#false} assume !(~i~0 < 1000); {26474#false} is VALID [2018-11-14 17:09:57,540 INFO L273 TraceCheckUtils]: 214: Hoare triple {26474#false} #res := (if ~res~0 % 4294967296 <= 2147483647 then ~res~0 % 4294967296 else ~res~0 % 4294967296 - 4294967296); {26474#false} is VALID [2018-11-14 17:09:57,540 INFO L273 TraceCheckUtils]: 215: Hoare triple {26474#false} assume true; {26474#false} is VALID [2018-11-14 17:09:57,540 INFO L268 TraceCheckUtils]: 216: Hoare quadruple {26474#false} {26474#false} #77#return; {26474#false} is VALID [2018-11-14 17:09:57,540 INFO L273 TraceCheckUtils]: 217: Hoare triple {26474#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647;~ret5~0 := #t~ret12;havoc #t~ret12; {26474#false} is VALID [2018-11-14 17:09:57,540 INFO L273 TraceCheckUtils]: 218: Hoare triple {26474#false} assume ~ret~0 != ~ret2~0 || ~ret~0 != ~ret5~0; {26474#false} is VALID [2018-11-14 17:09:57,540 INFO L273 TraceCheckUtils]: 219: Hoare triple {26474#false} assume !false; {26474#false} is VALID [2018-11-14 17:09:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2366 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2018-11-14 17:09:57,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:09:57,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-14 17:09:57,584 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 220 [2018-11-14 17:09:57,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:09:57,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 17:09:57,706 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-14 17:09:57,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 17:09:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 17:09:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 17:09:57,708 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 33 states. [2018-11-14 17:09:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:58,495 INFO L93 Difference]: Finished difference Result 231 states and 239 transitions. [2018-11-14 17:09:58,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 17:09:58,495 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 220 [2018-11-14 17:09:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:09:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:09:58,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 147 transitions. [2018-11-14 17:09:58,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:09:58,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 147 transitions. [2018-11-14 17:09:58,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 147 transitions. [2018-11-14 17:09:58,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:09:58,658 INFO L225 Difference]: With dead ends: 231 [2018-11-14 17:09:58,658 INFO L226 Difference]: Without dead ends: 165 [2018-11-14 17:09:58,659 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 17:09:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-14 17:09:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-11-14 17:09:59,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:09:59,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 164 states. [2018-11-14 17:09:59,017 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 164 states. [2018-11-14 17:09:59,018 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 164 states. [2018-11-14 17:09:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:59,021 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-11-14 17:09:59,021 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-11-14 17:09:59,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:59,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:59,022 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 165 states. [2018-11-14 17:09:59,022 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 165 states. [2018-11-14 17:09:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:09:59,025 INFO L93 Difference]: Finished difference Result 165 states and 169 transitions. [2018-11-14 17:09:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-11-14 17:09:59,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:09:59,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:09:59,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:09:59,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:09:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-11-14 17:09:59,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2018-11-14 17:09:59,029 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 220 [2018-11-14 17:09:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:09:59,029 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2018-11-14 17:09:59,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 17:09:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-11-14 17:09:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-11-14 17:09:59,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:09:59,031 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 27, 24, 24, 9, 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-14 17:09:59,031 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:09:59,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:09:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2077684496, now seen corresponding path program 29 times [2018-11-14 17:09:59,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:09:59,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:09:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:59,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:09:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:09:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat