java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:54:54,739 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:54:54,741 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:54:54,758 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:54:54,759 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:54:54,760 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:54:54,764 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:54:54,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:54:54,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:54:54,770 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:54:54,773 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:54:54,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:54:54,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:54:54,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:54:54,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:54:54,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:54:54,788 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:54:54,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:54:54,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:54:54,799 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:54:54,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:54:54,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:54:54,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:54:54,809 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:54:54,809 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:54:54,810 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:54:54,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:54:54,814 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:54:54,815 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:54:54,818 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:54:54,818 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:54:54,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:54:54,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:54:54,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:54:54,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:54:54,823 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:54:54,823 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:54:54,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:54:54,851 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:54:54,852 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:54:54,852 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:54:54,853 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:54:54,853 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:54:54,853 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:54:54,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:54:54,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:54:54,854 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:54:54,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:54:54,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:54:54,855 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:54:54,855 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:54:54,855 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:54:54,855 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:54:54,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:54:54,856 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:54:54,856 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:54:54,856 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:54:54,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:54:54,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:54:54,857 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:54:54,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:54:54,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:54,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:54:54,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:54:54,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:54:54,858 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:54:54,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:54:54,858 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:54:54,859 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:54:54,859 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:54:54,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:54:54,942 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:54:54,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:54:54,948 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:54:54,949 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:54:54,950 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i [2018-11-23 09:54:55,016 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72302be8f/c4a86586e22349de84a28c51aeb92c58/FLAGf8c0b7df6 [2018-11-23 09:54:55,499 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:54:55,500 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i [2018-11-23 09:54:55,509 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72302be8f/c4a86586e22349de84a28c51aeb92c58/FLAGf8c0b7df6 [2018-11-23 09:54:55,819 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72302be8f/c4a86586e22349de84a28c51aeb92c58 [2018-11-23 09:54:55,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:54:55,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:54:55,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:55,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:54:55,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:54:55,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4d5ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:55, skipping insertion in model container [2018-11-23 09:54:55,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:54:55,877 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:54:56,132 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,138 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:54:56,175 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,199 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:54:56,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56 WrapperNode [2018-11-23 09:54:56,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:56,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:54:56,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:54:56,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:54:56,234 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:54:56,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:54:56,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:54:56,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:54:56,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:56,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:54:56,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:54:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:54:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:54:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:54:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:54:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:54:56,425 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:54:56,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:54:56,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:54:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:54:56,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:54:57,256 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:54:57,257 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 09:54:57,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57 BoogieIcfgContainer [2018-11-23 09:54:57,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:54:57,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:54:57,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:54:57,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:54:57,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:54:55" (1/3) ... [2018-11-23 09:54:57,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c1c12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (2/3) ... [2018-11-23 09:54:57,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c1c12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57" (3/3) ... [2018-11-23 09:54:57,267 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_false-unreach-call_ground.i [2018-11-23 09:54:57,277 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:54:57,286 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:54:57,305 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:54:57,337 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:54:57,338 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:54:57,338 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:54:57,338 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:54:57,338 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:54:57,338 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:54:57,339 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:54:57,339 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:54:57,339 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:54:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 09:54:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:54:57,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:57,364 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:57,366 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:57,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1945224924, now seen corresponding path program 1 times [2018-11-23 09:54:57,377 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:57,378 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:54:57,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:57,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 09:54:57,642 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-23 09:54:57,643 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 09:54:57,643 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #130#return; {45#true} is VALID [2018-11-23 09:54:57,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret15 := main(); {45#true} is VALID [2018-11-23 09:54:57,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {45#true} is VALID [2018-11-23 09:54:57,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 09:54:57,645 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~x~0 := 0bv32; {46#false} is VALID [2018-11-23 09:54:57,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !!~bvslt32(~x~0, 100000bv32);~y~0 := ~bvadd32(1bv32, ~x~0); {46#false} is VALID [2018-11-23 09:54:57,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !!~bvslt32(~y~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {46#false} is VALID [2018-11-23 09:54:57,646 INFO L256 TraceCheckUtils]: 10: Hoare triple {46#false} call __VERIFIER_assert((if ~bvsle32(#t~mem13, #t~mem14) then 1bv32 else 0bv32)); {46#false} is VALID [2018-11-23 09:54:57,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-23 09:54:57,647 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume 0bv32 == ~cond; {46#false} is VALID [2018-11-23 09:54:57,647 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 09:54:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:54:57,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:57,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:54:57,666 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 09:54:57,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:57,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:54:57,724 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:57,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:54:57,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:54:57,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:57,737 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 09:54:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:57,929 INFO L93 Difference]: Finished difference Result 78 states and 117 transitions. [2018-11-23 09:54:57,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:54:57,930 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 09:54:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:57,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 09:54:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 09:54:57,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-23 09:54:58,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,673 INFO L225 Difference]: With dead ends: 78 [2018-11-23 09:54:58,673 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 09:54:58,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:58,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 09:54:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 09:54:58,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:58,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,896 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,896 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,903 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 09:54:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 09:54:58,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,905 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,905 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,914 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 09:54:58,914 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 09:54:58,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:58,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 09:54:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 09:54:58,926 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 14 [2018-11-23 09:54:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:58,927 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 09:54:58,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:54:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 09:54:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:54:58,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:58,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:58,929 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:58,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:58,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1826279014, now seen corresponding path program 1 times [2018-11-23 09:54:58,930 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:58,930 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:54:58,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:59,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-23 09:54:59,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {318#true} is VALID [2018-11-23 09:54:59,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-23 09:54:59,066 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #130#return; {318#true} is VALID [2018-11-23 09:54:59,066 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret15 := main(); {318#true} is VALID [2018-11-23 09:54:59,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {338#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 09:54:59,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#false} ~x~0 := 0bv32; {319#false} is VALID [2018-11-23 09:54:59,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {319#false} assume !!~bvslt32(~x~0, 100000bv32);~y~0 := ~bvadd32(1bv32, ~x~0); {319#false} is VALID [2018-11-23 09:54:59,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#false} assume !!~bvslt32(~y~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {319#false} is VALID [2018-11-23 09:54:59,071 INFO L256 TraceCheckUtils]: 10: Hoare triple {319#false} call __VERIFIER_assert((if ~bvsle32(#t~mem13, #t~mem14) then 1bv32 else 0bv32)); {319#false} is VALID [2018-11-23 09:54:59,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#false} ~cond := #in~cond; {319#false} is VALID [2018-11-23 09:54:59,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {319#false} assume 0bv32 == ~cond; {319#false} is VALID [2018-11-23 09:54:59,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-23 09:54:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:54:59,074 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:59,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:59,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:54:59,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 09:54:59,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:59,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:54:59,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:54:59,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:54:59,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:59,116 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 3 states. [2018-11-23 09:54:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,931 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 09:54:59,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:54:59,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 09:54:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 09:54:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 09:54:59,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 09:55:00,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,239 INFO L225 Difference]: With dead ends: 68 [2018-11-23 09:55:00,239 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 09:55:00,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 09:55:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-11-23 09:55:00,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:00,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 38 states. [2018-11-23 09:55:00,270 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 38 states. [2018-11-23 09:55:00,271 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 38 states. [2018-11-23 09:55:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,276 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 09:55:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 09:55:00,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,278 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 55 states. [2018-11-23 09:55:00,278 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 55 states. [2018-11-23 09:55:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,284 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 09:55:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 09:55:00,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:00,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 09:55:00,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-23 09:55:00,289 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 14 [2018-11-23 09:55:00,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:00,289 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-23 09:55:00,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:55:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-23 09:55:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 09:55:00,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:00,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:00,291 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:00,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:00,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1905148503, now seen corresponding path program 1 times [2018-11-23 09:55:00,292 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:00,292 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:00,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:55:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:00,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2018-11-23 09:55:00,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {620#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {620#true} is VALID [2018-11-23 09:55:00,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2018-11-23 09:55:00,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #130#return; {620#true} is VALID [2018-11-23 09:55:00,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret15 := main(); {620#true} is VALID [2018-11-23 09:55:00,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {620#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {620#true} is VALID [2018-11-23 09:55:00,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {620#true} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {643#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 09:55:00,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {643#(= main_~s~0 main_~i~0)} assume !~bvslt32(~k~0, 100000bv32); {643#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 09:55:00,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {643#(= main_~s~0 main_~i~0)} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {621#false} is VALID [2018-11-23 09:55:00,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {621#false} ~x~0 := 0bv32; {621#false} is VALID [2018-11-23 09:55:00,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {621#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {621#false} is VALID [2018-11-23 09:55:00,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {621#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {621#false} is VALID [2018-11-23 09:55:00,425 INFO L256 TraceCheckUtils]: 12: Hoare triple {621#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {621#false} is VALID [2018-11-23 09:55:00,425 INFO L273 TraceCheckUtils]: 13: Hoare triple {621#false} ~cond := #in~cond; {621#false} is VALID [2018-11-23 09:55:00,426 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#false} assume 0bv32 == ~cond; {621#false} is VALID [2018-11-23 09:55:00,426 INFO L273 TraceCheckUtils]: 15: Hoare triple {621#false} assume !false; {621#false} is VALID [2018-11-23 09:55:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:00,427 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:00,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:00,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:55:00,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 09:55:00,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:00,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:55:00,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:55:00,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:55:00,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:00,473 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 3 states. [2018-11-23 09:55:00,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,813 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2018-11-23 09:55:00,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:55:00,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 09:55:00,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 09:55:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:55:00,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 09:55:00,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2018-11-23 09:55:01,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,036 INFO L225 Difference]: With dead ends: 86 [2018-11-23 09:55:01,036 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 09:55:01,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:55:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 09:55:01,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-11-23 09:55:01,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:01,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 42 states. [2018-11-23 09:55:01,074 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 42 states. [2018-11-23 09:55:01,074 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 42 states. [2018-11-23 09:55:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,079 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 09:55:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 09:55:01,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,081 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 55 states. [2018-11-23 09:55:01,081 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 55 states. [2018-11-23 09:55:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,085 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 09:55:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 09:55:01,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:01,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:01,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:01,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 09:55:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-11-23 09:55:01,090 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 16 [2018-11-23 09:55:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:01,090 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2018-11-23 09:55:01,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:55:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2018-11-23 09:55:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 09:55:01,092 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:01,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:01,092 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:01,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:01,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1580472167, now seen corresponding path program 1 times [2018-11-23 09:55:01,093 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:01,093 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:01,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:55:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:01,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:01,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {958#true} call ULTIMATE.init(); {958#true} is VALID [2018-11-23 09:55:01,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {958#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {958#true} is VALID [2018-11-23 09:55:01,230 INFO L273 TraceCheckUtils]: 2: Hoare triple {958#true} assume true; {958#true} is VALID [2018-11-23 09:55:01,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {958#true} {958#true} #130#return; {958#true} is VALID [2018-11-23 09:55:01,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {958#true} call #t~ret15 := main(); {958#true} is VALID [2018-11-23 09:55:01,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {958#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {978#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:01,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {978#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {982#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:01,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {982#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {959#false} is VALID [2018-11-23 09:55:01,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#false} assume !(~s~0 != ~i~0); {959#false} is VALID [2018-11-23 09:55:01,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {959#false} ~x~0 := 0bv32; {959#false} is VALID [2018-11-23 09:55:01,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {959#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {959#false} is VALID [2018-11-23 09:55:01,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {959#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {959#false} is VALID [2018-11-23 09:55:01,238 INFO L256 TraceCheckUtils]: 12: Hoare triple {959#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {959#false} is VALID [2018-11-23 09:55:01,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {959#false} ~cond := #in~cond; {959#false} is VALID [2018-11-23 09:55:01,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {959#false} assume 0bv32 == ~cond; {959#false} is VALID [2018-11-23 09:55:01,239 INFO L273 TraceCheckUtils]: 15: Hoare triple {959#false} assume !false; {959#false} is VALID [2018-11-23 09:55:01,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:01,240 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:01,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:01,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:55:01,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 09:55:01,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:01,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 09:55:01,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:55:01,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:55:01,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:55:01,270 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 4 states. [2018-11-23 09:55:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,744 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2018-11-23 09:55:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:55:01,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 09:55:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:01,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 09:55:01,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 09:55:01,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2018-11-23 09:55:02,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:02,003 INFO L225 Difference]: With dead ends: 102 [2018-11-23 09:55:02,003 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 09:55:02,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 09:55:02,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 09:55:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-23 09:55:02,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:02,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 43 states. [2018-11-23 09:55:02,057 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 43 states. [2018-11-23 09:55:02,057 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 43 states. [2018-11-23 09:55:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,061 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 09:55:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 09:55:02,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,063 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 67 states. [2018-11-23 09:55:02,063 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 67 states. [2018-11-23 09:55:02,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,068 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 09:55:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 09:55:02,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:02,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 09:55:02,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-23 09:55:02,072 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2018-11-23 09:55:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:02,073 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-11-23 09:55:02,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:55:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 09:55:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 09:55:02,074 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:02,074 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:02,074 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:02,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1505214684, now seen corresponding path program 1 times [2018-11-23 09:55:02,075 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:02,075 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:02,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:55:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:02,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:02,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1345#true} is VALID [2018-11-23 09:55:02,298 INFO L273 TraceCheckUtils]: 1: Hoare triple {1345#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1345#true} is VALID [2018-11-23 09:55:02,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-23 09:55:02,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #130#return; {1345#true} is VALID [2018-11-23 09:55:02,300 INFO L256 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret15 := main(); {1345#true} is VALID [2018-11-23 09:55:02,301 INFO L273 TraceCheckUtils]: 5: Hoare triple {1345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1365#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {1365#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {1369#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:02,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {1369#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {1369#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:02,303 INFO L273 TraceCheckUtils]: 8: Hoare triple {1369#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1369#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:02,304 INFO L273 TraceCheckUtils]: 9: Hoare triple {1369#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {1379#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:02,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {1379#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {1346#false} is VALID [2018-11-23 09:55:02,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {1346#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1346#false} is VALID [2018-11-23 09:55:02,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {1346#false} ~x~0 := 0bv32; {1346#false} is VALID [2018-11-23 09:55:02,305 INFO L273 TraceCheckUtils]: 13: Hoare triple {1346#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1346#false} is VALID [2018-11-23 09:55:02,305 INFO L273 TraceCheckUtils]: 14: Hoare triple {1346#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {1346#false} is VALID [2018-11-23 09:55:02,305 INFO L256 TraceCheckUtils]: 15: Hoare triple {1346#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1346#false} is VALID [2018-11-23 09:55:02,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {1346#false} ~cond := #in~cond; {1346#false} is VALID [2018-11-23 09:55:02,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {1346#false} assume 0bv32 == ~cond; {1346#false} is VALID [2018-11-23 09:55:02,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2018-11-23 09:55:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:02,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:02,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2018-11-23 09:55:02,384 INFO L273 TraceCheckUtils]: 17: Hoare triple {1346#false} assume 0bv32 == ~cond; {1346#false} is VALID [2018-11-23 09:55:02,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {1346#false} ~cond := #in~cond; {1346#false} is VALID [2018-11-23 09:55:02,385 INFO L256 TraceCheckUtils]: 15: Hoare triple {1346#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1346#false} is VALID [2018-11-23 09:55:02,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {1346#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {1346#false} is VALID [2018-11-23 09:55:02,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {1346#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1346#false} is VALID [2018-11-23 09:55:02,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {1346#false} ~x~0 := 0bv32; {1346#false} is VALID [2018-11-23 09:55:02,386 INFO L273 TraceCheckUtils]: 11: Hoare triple {1346#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1346#false} is VALID [2018-11-23 09:55:02,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {1431#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {1346#false} is VALID [2018-11-23 09:55:02,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {1435#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {1431#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:02,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {1435#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1435#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {1435#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {1435#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {1445#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {1435#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {1345#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1445#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret15 := main(); {1345#true} is VALID [2018-11-23 09:55:02,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #130#return; {1345#true} is VALID [2018-11-23 09:55:02,401 INFO L273 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-23 09:55:02,401 INFO L273 TraceCheckUtils]: 1: Hoare triple {1345#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1345#true} is VALID [2018-11-23 09:55:02,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1345#true} is VALID [2018-11-23 09:55:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:02,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:02,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 09:55:02,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 09:55:02,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:02,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 09:55:02,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:02,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 09:55:02,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 09:55:02,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 09:55:02,445 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 8 states. [2018-11-23 09:55:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:03,736 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2018-11-23 09:55:03,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 09:55:03,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 09:55:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 09:55:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2018-11-23 09:55:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 09:55:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2018-11-23 09:55:03,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 173 transitions. [2018-11-23 09:55:04,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:04,098 INFO L225 Difference]: With dead ends: 151 [2018-11-23 09:55:04,098 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 09:55:04,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-23 09:55:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 09:55:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 88. [2018-11-23 09:55:04,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:04,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 88 states. [2018-11-23 09:55:04,172 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 88 states. [2018-11-23 09:55:04,172 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 88 states. [2018-11-23 09:55:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,179 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2018-11-23 09:55:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2018-11-23 09:55:04,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:04,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:04,180 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 116 states. [2018-11-23 09:55:04,181 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 116 states. [2018-11-23 09:55:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,186 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2018-11-23 09:55:04,186 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2018-11-23 09:55:04,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:04,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:04,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:04,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 09:55:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2018-11-23 09:55:04,191 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 19 [2018-11-23 09:55:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:04,192 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2018-11-23 09:55:04,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 09:55:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2018-11-23 09:55:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 09:55:04,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:04,193 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:04,193 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:04,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash 965884393, now seen corresponding path program 2 times [2018-11-23 09:55:04,194 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:04,194 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:04,215 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:04,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:55:04,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:04,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:04,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {2041#true} call ULTIMATE.init(); {2041#true} is VALID [2018-11-23 09:55:04,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {2041#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2041#true} is VALID [2018-11-23 09:55:04,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {2041#true} assume true; {2041#true} is VALID [2018-11-23 09:55:04,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2041#true} {2041#true} #130#return; {2041#true} is VALID [2018-11-23 09:55:04,340 INFO L256 TraceCheckUtils]: 4: Hoare triple {2041#true} call #t~ret15 := main(); {2041#true} is VALID [2018-11-23 09:55:04,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {2041#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,347 INFO L273 TraceCheckUtils]: 7: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,353 INFO L273 TraceCheckUtils]: 9: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,355 INFO L273 TraceCheckUtils]: 12: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,359 INFO L273 TraceCheckUtils]: 13: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2061#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {2061#(= main_~i~0 (_ bv0 32))} ~x~0 := 0bv32; {2110#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:04,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {2110#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {2042#false} is VALID [2018-11-23 09:55:04,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {2042#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {2042#false} is VALID [2018-11-23 09:55:04,364 INFO L256 TraceCheckUtils]: 24: Hoare triple {2042#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {2042#false} is VALID [2018-11-23 09:55:04,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {2042#false} ~cond := #in~cond; {2042#false} is VALID [2018-11-23 09:55:04,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {2042#false} assume 0bv32 == ~cond; {2042#false} is VALID [2018-11-23 09:55:04,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {2042#false} assume !false; {2042#false} is VALID [2018-11-23 09:55:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 09:55:04,369 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:04,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:04,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:55:04,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 09:55:04,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:04,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 09:55:04,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:04,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:55:04,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:55:04,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:55:04,435 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand 4 states. [2018-11-23 09:55:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,790 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2018-11-23 09:55:04,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:55:04,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 09:55:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2018-11-23 09:55:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2018-11-23 09:55:04,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 113 transitions. [2018-11-23 09:55:05,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:05,060 INFO L225 Difference]: With dead ends: 141 [2018-11-23 09:55:05,060 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 09:55:05,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:55:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 09:55:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-11-23 09:55:05,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:05,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 84 states. [2018-11-23 09:55:05,185 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 84 states. [2018-11-23 09:55:05,185 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 84 states. [2018-11-23 09:55:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:05,189 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2018-11-23 09:55:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2018-11-23 09:55:05,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:05,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:05,190 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 87 states. [2018-11-23 09:55:05,190 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 87 states. [2018-11-23 09:55:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:05,194 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2018-11-23 09:55:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2018-11-23 09:55:05,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:05,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:05,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:05,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:05,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 09:55:05,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2018-11-23 09:55:05,199 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 28 [2018-11-23 09:55:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:05,199 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2018-11-23 09:55:05,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:55:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2018-11-23 09:55:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 09:55:05,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:05,201 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:05,201 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:05,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1605949511, now seen corresponding path program 1 times [2018-11-23 09:55:05,202 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:05,202 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:05,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:55:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:05,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:05,466 INFO L256 TraceCheckUtils]: 0: Hoare triple {2617#true} call ULTIMATE.init(); {2617#true} is VALID [2018-11-23 09:55:05,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {2617#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2617#true} is VALID [2018-11-23 09:55:05,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {2617#true} assume true; {2617#true} is VALID [2018-11-23 09:55:05,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2617#true} {2617#true} #130#return; {2617#true} is VALID [2018-11-23 09:55:05,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {2617#true} call #t~ret15 := main(); {2617#true} is VALID [2018-11-23 09:55:05,471 INFO L273 TraceCheckUtils]: 5: Hoare triple {2617#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {2637#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:05,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {2637#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {2641#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,472 INFO L273 TraceCheckUtils]: 7: Hoare triple {2641#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2641#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,473 INFO L273 TraceCheckUtils]: 8: Hoare triple {2641#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2641#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,473 INFO L273 TraceCheckUtils]: 9: Hoare triple {2641#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2651#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {2651#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2651#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {2651#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2651#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,475 INFO L273 TraceCheckUtils]: 12: Hoare triple {2651#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2661#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,476 INFO L273 TraceCheckUtils]: 13: Hoare triple {2661#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2661#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {2661#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2661#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {2661#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2671#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,479 INFO L273 TraceCheckUtils]: 16: Hoare triple {2671#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2671#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {2671#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2671#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,482 INFO L273 TraceCheckUtils]: 18: Hoare triple {2671#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2681#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,482 INFO L273 TraceCheckUtils]: 19: Hoare triple {2681#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {2618#false} is VALID [2018-11-23 09:55:05,483 INFO L273 TraceCheckUtils]: 20: Hoare triple {2618#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2618#false} is VALID [2018-11-23 09:55:05,483 INFO L273 TraceCheckUtils]: 21: Hoare triple {2618#false} ~x~0 := 0bv32; {2618#false} is VALID [2018-11-23 09:55:05,483 INFO L273 TraceCheckUtils]: 22: Hoare triple {2618#false} assume !~bvslt32(~x~0, ~i~0); {2618#false} is VALID [2018-11-23 09:55:05,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {2618#false} ~x~0 := 0bv32; {2618#false} is VALID [2018-11-23 09:55:05,484 INFO L273 TraceCheckUtils]: 24: Hoare triple {2618#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2618#false} is VALID [2018-11-23 09:55:05,485 INFO L256 TraceCheckUtils]: 25: Hoare triple {2618#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {2618#false} is VALID [2018-11-23 09:55:05,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {2618#false} ~cond := #in~cond; {2618#false} is VALID [2018-11-23 09:55:05,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {2618#false} assume 0bv32 == ~cond; {2618#false} is VALID [2018-11-23 09:55:05,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {2618#false} assume !false; {2618#false} is VALID [2018-11-23 09:55:05,489 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:05,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:05,696 INFO L273 TraceCheckUtils]: 28: Hoare triple {2618#false} assume !false; {2618#false} is VALID [2018-11-23 09:55:05,697 INFO L273 TraceCheckUtils]: 27: Hoare triple {2618#false} assume 0bv32 == ~cond; {2618#false} is VALID [2018-11-23 09:55:05,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {2618#false} ~cond := #in~cond; {2618#false} is VALID [2018-11-23 09:55:05,698 INFO L256 TraceCheckUtils]: 25: Hoare triple {2618#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {2618#false} is VALID [2018-11-23 09:55:05,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {2618#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2618#false} is VALID [2018-11-23 09:55:05,698 INFO L273 TraceCheckUtils]: 23: Hoare triple {2618#false} ~x~0 := 0bv32; {2618#false} is VALID [2018-11-23 09:55:05,698 INFO L273 TraceCheckUtils]: 22: Hoare triple {2618#false} assume !~bvslt32(~x~0, ~i~0); {2618#false} is VALID [2018-11-23 09:55:05,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {2618#false} ~x~0 := 0bv32; {2618#false} is VALID [2018-11-23 09:55:05,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {2618#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2618#false} is VALID [2018-11-23 09:55:05,699 INFO L273 TraceCheckUtils]: 19: Hoare triple {2739#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {2618#false} is VALID [2018-11-23 09:55:05,700 INFO L273 TraceCheckUtils]: 18: Hoare triple {2743#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2739#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:05,701 INFO L273 TraceCheckUtils]: 17: Hoare triple {2743#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2743#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {2743#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2743#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {2753#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2743#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,707 INFO L273 TraceCheckUtils]: 14: Hoare triple {2753#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2753#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {2753#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2753#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,715 INFO L273 TraceCheckUtils]: 12: Hoare triple {2763#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2753#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {2763#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2763#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {2763#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2763#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {2773#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2763#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {2773#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2773#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {2773#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2773#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {2783#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {2773#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {2617#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {2783#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {2617#true} call #t~ret15 := main(); {2617#true} is VALID [2018-11-23 09:55:05,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2617#true} {2617#true} #130#return; {2617#true} is VALID [2018-11-23 09:55:05,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {2617#true} assume true; {2617#true} is VALID [2018-11-23 09:55:05,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {2617#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2617#true} is VALID [2018-11-23 09:55:05,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {2617#true} call ULTIMATE.init(); {2617#true} is VALID [2018-11-23 09:55:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:05,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:05,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 09:55:05,736 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 09:55:05,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:05,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 09:55:05,836 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-23 09:55:05,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 09:55:05,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 09:55:05,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 09:55:05,837 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand 14 states. [2018-11-23 09:55:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:08,537 INFO L93 Difference]: Finished difference Result 219 states and 310 transitions. [2018-11-23 09:55:08,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 09:55:08,537 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 09:55:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:08,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 09:55:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 205 transitions. [2018-11-23 09:55:08,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 09:55:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 205 transitions. [2018-11-23 09:55:08,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 205 transitions. [2018-11-23 09:55:09,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:09,099 INFO L225 Difference]: With dead ends: 219 [2018-11-23 09:55:09,099 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 09:55:09,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2018-11-23 09:55:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 09:55:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 138. [2018-11-23 09:55:09,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:09,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 138 states. [2018-11-23 09:55:09,237 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 138 states. [2018-11-23 09:55:09,237 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 138 states. [2018-11-23 09:55:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,244 INFO L93 Difference]: Finished difference Result 166 states and 222 transitions. [2018-11-23 09:55:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2018-11-23 09:55:09,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:09,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:09,246 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 166 states. [2018-11-23 09:55:09,246 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 166 states. [2018-11-23 09:55:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,252 INFO L93 Difference]: Finished difference Result 166 states and 222 transitions. [2018-11-23 09:55:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2018-11-23 09:55:09,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:09,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:09,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:09,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 09:55:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2018-11-23 09:55:09,259 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 29 [2018-11-23 09:55:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:09,259 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2018-11-23 09:55:09,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 09:55:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2018-11-23 09:55:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 09:55:09,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:09,261 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:09,261 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:09,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:09,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1339551065, now seen corresponding path program 2 times [2018-11-23 09:55:09,262 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:09,262 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:09,287 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:09,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:55:09,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:09,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:09,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2018-11-23 09:55:09,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2018-11-23 09:55:09,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-23 09:55:09,757 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 09:55:09,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-11-23 09:55:09,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 09:55:09,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:55:09,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:55:09,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:55:09,881 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:7 [2018-11-23 09:55:09,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 09:55:09,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 09:55:09,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:55:09,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:55:09,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:55:09,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 09:55:09,971 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 09:55:09,971 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) (_ bv0 32)))) (and (= |main_#t~mem10| .cse0) (= .cse0 |main_#t~mem9|))) [2018-11-23 09:55:09,971 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem10| |main_#t~mem9|) [2018-11-23 09:55:10,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {3657#true} call ULTIMATE.init(); {3657#true} is VALID [2018-11-23 09:55:10,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {3657#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3657#true} is VALID [2018-11-23 09:55:10,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {3657#true} assume true; {3657#true} is VALID [2018-11-23 09:55:10,164 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3657#true} {3657#true} #130#return; {3657#true} is VALID [2018-11-23 09:55:10,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {3657#true} call #t~ret15 := main(); {3657#true} is VALID [2018-11-23 09:55:10,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {3657#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,167 INFO L273 TraceCheckUtils]: 6: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,202 INFO L273 TraceCheckUtils]: 9: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,206 INFO L273 TraceCheckUtils]: 11: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,223 INFO L273 TraceCheckUtils]: 27: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,224 INFO L273 TraceCheckUtils]: 28: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,228 INFO L273 TraceCheckUtils]: 30: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,229 INFO L273 TraceCheckUtils]: 31: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,229 INFO L273 TraceCheckUtils]: 32: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,230 INFO L273 TraceCheckUtils]: 34: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,231 INFO L273 TraceCheckUtils]: 35: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,231 INFO L273 TraceCheckUtils]: 36: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,232 INFO L273 TraceCheckUtils]: 37: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~k~0, 100000bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,233 INFO L273 TraceCheckUtils]: 38: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~x~0 := 0bv32; {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~x~0, ~i~0); {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,240 INFO L273 TraceCheckUtils]: 41: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~x~0 := 0bv32; {3786#(and (= main_~x~0 (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:10,241 INFO L273 TraceCheckUtils]: 42: Hoare triple {3786#(and (= main_~x~0 (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3790#(= |main_#t~mem10| |main_#t~mem9|)} is VALID [2018-11-23 09:55:10,242 INFO L256 TraceCheckUtils]: 43: Hoare triple {3790#(= |main_#t~mem10| |main_#t~mem9|)} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {3794#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:10,242 INFO L273 TraceCheckUtils]: 44: Hoare triple {3794#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3798#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:10,242 INFO L273 TraceCheckUtils]: 45: Hoare triple {3798#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3658#false} is VALID [2018-11-23 09:55:10,243 INFO L273 TraceCheckUtils]: 46: Hoare triple {3658#false} assume !false; {3658#false} is VALID [2018-11-23 09:55:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 09:55:10,248 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:10,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:10,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 09:55:10,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 09:55:10,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:10,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 09:55:10,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:10,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 09:55:10,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 09:55:10,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:55:10,348 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand 7 states. [2018-11-23 09:55:11,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:11,297 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2018-11-23 09:55:11,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 09:55:11,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 09:55:11,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 09:55:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 09:55:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 09:55:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 09:55:11,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2018-11-23 09:55:11,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:11,983 INFO L225 Difference]: With dead ends: 147 [2018-11-23 09:55:11,983 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 09:55:11,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 09:55:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 09:55:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 09:55:12,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:12,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 09:55:12,074 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 09:55:12,074 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 09:55:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:12,080 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2018-11-23 09:55:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2018-11-23 09:55:12,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:12,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:12,081 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 09:55:12,081 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 09:55:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:12,087 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2018-11-23 09:55:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2018-11-23 09:55:12,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:12,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:12,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:12,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 09:55:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2018-11-23 09:55:12,094 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 47 [2018-11-23 09:55:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:12,094 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2018-11-23 09:55:12,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 09:55:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2018-11-23 09:55:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 09:55:12,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:12,095 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:12,096 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:12,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash -186475156, now seen corresponding path program 1 times [2018-11-23 09:55:12,096 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:12,097 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:12,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:55:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:12,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:12,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {4496#true} call ULTIMATE.init(); {4496#true} is VALID [2018-11-23 09:55:12,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {4496#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4496#true} is VALID [2018-11-23 09:55:12,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {4496#true} assume true; {4496#true} is VALID [2018-11-23 09:55:12,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4496#true} {4496#true} #130#return; {4496#true} is VALID [2018-11-23 09:55:12,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {4496#true} call #t~ret15 := main(); {4496#true} is VALID [2018-11-23 09:55:12,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {4496#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {4516#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:12,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {4516#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {4520#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {4520#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4520#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {4520#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4520#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {4520#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4530#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:12,727 INFO L273 TraceCheckUtils]: 10: Hoare triple {4530#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4530#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:12,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {4530#(= (_ bv2 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4530#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:12,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {4530#(= (_ bv2 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {4540#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {4540#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4540#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {4540#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4540#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {4540#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4550#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {4550#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4550#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,741 INFO L273 TraceCheckUtils]: 17: Hoare triple {4550#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4550#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,742 INFO L273 TraceCheckUtils]: 18: Hoare triple {4550#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4560#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,742 INFO L273 TraceCheckUtils]: 19: Hoare triple {4560#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4560#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,742 INFO L273 TraceCheckUtils]: 20: Hoare triple {4560#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4560#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,743 INFO L273 TraceCheckUtils]: 21: Hoare triple {4560#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4570#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:55:12,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {4570#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4570#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:55:12,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {4570#(= (_ bv6 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4570#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:55:12,751 INFO L273 TraceCheckUtils]: 24: Hoare triple {4570#(= (_ bv6 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {4580#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {4580#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4580#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {4580#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4580#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,755 INFO L273 TraceCheckUtils]: 27: Hoare triple {4580#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4590#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,755 INFO L273 TraceCheckUtils]: 28: Hoare triple {4590#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4590#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {4590#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4590#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,756 INFO L273 TraceCheckUtils]: 30: Hoare triple {4590#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4600#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 09:55:12,757 INFO L273 TraceCheckUtils]: 31: Hoare triple {4600#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4600#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 09:55:12,757 INFO L273 TraceCheckUtils]: 32: Hoare triple {4600#(= (_ bv9 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4600#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 09:55:12,758 INFO L273 TraceCheckUtils]: 33: Hoare triple {4600#(= (_ bv9 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {4610#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,759 INFO L273 TraceCheckUtils]: 34: Hoare triple {4610#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4610#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,760 INFO L273 TraceCheckUtils]: 35: Hoare triple {4610#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4610#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:12,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {4610#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4620#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 09:55:12,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {4620#(= (_ bv11 32) main_~k~0)} assume !~bvslt32(~k~0, 100000bv32); {4497#false} is VALID [2018-11-23 09:55:12,761 INFO L273 TraceCheckUtils]: 38: Hoare triple {4497#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4497#false} is VALID [2018-11-23 09:55:12,762 INFO L273 TraceCheckUtils]: 39: Hoare triple {4497#false} ~x~0 := 0bv32; {4497#false} is VALID [2018-11-23 09:55:12,762 INFO L273 TraceCheckUtils]: 40: Hoare triple {4497#false} assume !~bvslt32(~x~0, ~i~0); {4497#false} is VALID [2018-11-23 09:55:12,762 INFO L273 TraceCheckUtils]: 41: Hoare triple {4497#false} ~x~0 := 0bv32; {4497#false} is VALID [2018-11-23 09:55:12,762 INFO L273 TraceCheckUtils]: 42: Hoare triple {4497#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4497#false} is VALID [2018-11-23 09:55:12,762 INFO L256 TraceCheckUtils]: 43: Hoare triple {4497#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {4497#false} is VALID [2018-11-23 09:55:12,762 INFO L273 TraceCheckUtils]: 44: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2018-11-23 09:55:12,763 INFO L273 TraceCheckUtils]: 45: Hoare triple {4497#false} assume !(0bv32 == ~cond); {4497#false} is VALID [2018-11-23 09:55:12,763 INFO L273 TraceCheckUtils]: 46: Hoare triple {4497#false} assume true; {4497#false} is VALID [2018-11-23 09:55:12,763 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4497#false} {4497#false} #136#return; {4497#false} is VALID [2018-11-23 09:55:12,763 INFO L273 TraceCheckUtils]: 48: Hoare triple {4497#false} havoc #t~mem10;havoc #t~mem9; {4497#false} is VALID [2018-11-23 09:55:12,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {4497#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4497#false} is VALID [2018-11-23 09:55:12,763 INFO L273 TraceCheckUtils]: 50: Hoare triple {4497#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4497#false} is VALID [2018-11-23 09:55:12,764 INFO L256 TraceCheckUtils]: 51: Hoare triple {4497#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {4497#false} is VALID [2018-11-23 09:55:12,764 INFO L273 TraceCheckUtils]: 52: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2018-11-23 09:55:12,764 INFO L273 TraceCheckUtils]: 53: Hoare triple {4497#false} assume 0bv32 == ~cond; {4497#false} is VALID [2018-11-23 09:55:12,764 INFO L273 TraceCheckUtils]: 54: Hoare triple {4497#false} assume !false; {4497#false} is VALID [2018-11-23 09:55:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:55:12,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:13,280 INFO L273 TraceCheckUtils]: 54: Hoare triple {4497#false} assume !false; {4497#false} is VALID [2018-11-23 09:55:13,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {4497#false} assume 0bv32 == ~cond; {4497#false} is VALID [2018-11-23 09:55:13,281 INFO L273 TraceCheckUtils]: 52: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2018-11-23 09:55:13,281 INFO L256 TraceCheckUtils]: 51: Hoare triple {4497#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {4497#false} is VALID [2018-11-23 09:55:13,281 INFO L273 TraceCheckUtils]: 50: Hoare triple {4497#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4497#false} is VALID [2018-11-23 09:55:13,282 INFO L273 TraceCheckUtils]: 49: Hoare triple {4497#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4497#false} is VALID [2018-11-23 09:55:13,282 INFO L273 TraceCheckUtils]: 48: Hoare triple {4497#false} havoc #t~mem10;havoc #t~mem9; {4497#false} is VALID [2018-11-23 09:55:13,282 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4496#true} {4497#false} #136#return; {4497#false} is VALID [2018-11-23 09:55:13,282 INFO L273 TraceCheckUtils]: 46: Hoare triple {4496#true} assume true; {4496#true} is VALID [2018-11-23 09:55:13,283 INFO L273 TraceCheckUtils]: 45: Hoare triple {4496#true} assume !(0bv32 == ~cond); {4496#true} is VALID [2018-11-23 09:55:13,283 INFO L273 TraceCheckUtils]: 44: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2018-11-23 09:55:13,283 INFO L256 TraceCheckUtils]: 43: Hoare triple {4497#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {4496#true} is VALID [2018-11-23 09:55:13,283 INFO L273 TraceCheckUtils]: 42: Hoare triple {4497#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4497#false} is VALID [2018-11-23 09:55:13,284 INFO L273 TraceCheckUtils]: 41: Hoare triple {4497#false} ~x~0 := 0bv32; {4497#false} is VALID [2018-11-23 09:55:13,284 INFO L273 TraceCheckUtils]: 40: Hoare triple {4497#false} assume !~bvslt32(~x~0, ~i~0); {4497#false} is VALID [2018-11-23 09:55:13,284 INFO L273 TraceCheckUtils]: 39: Hoare triple {4497#false} ~x~0 := 0bv32; {4497#false} is VALID [2018-11-23 09:55:13,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {4497#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4497#false} is VALID [2018-11-23 09:55:13,284 INFO L273 TraceCheckUtils]: 37: Hoare triple {4726#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {4497#false} is VALID [2018-11-23 09:55:13,285 INFO L273 TraceCheckUtils]: 36: Hoare triple {4730#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4726#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:13,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {4730#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4730#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,288 INFO L273 TraceCheckUtils]: 34: Hoare triple {4730#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4730#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,293 INFO L273 TraceCheckUtils]: 33: Hoare triple {4740#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4730#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,293 INFO L273 TraceCheckUtils]: 32: Hoare triple {4740#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4740#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,294 INFO L273 TraceCheckUtils]: 31: Hoare triple {4740#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4740#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,299 INFO L273 TraceCheckUtils]: 30: Hoare triple {4750#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4740#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,299 INFO L273 TraceCheckUtils]: 29: Hoare triple {4750#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4750#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,318 INFO L273 TraceCheckUtils]: 28: Hoare triple {4750#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4750#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,331 INFO L273 TraceCheckUtils]: 27: Hoare triple {4760#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4750#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,340 INFO L273 TraceCheckUtils]: 26: Hoare triple {4760#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4760#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,348 INFO L273 TraceCheckUtils]: 25: Hoare triple {4760#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4760#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {4770#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4760#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,354 INFO L273 TraceCheckUtils]: 23: Hoare triple {4770#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4770#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {4770#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4770#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {4780#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4770#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,360 INFO L273 TraceCheckUtils]: 20: Hoare triple {4780#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4780#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {4780#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4780#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,367 INFO L273 TraceCheckUtils]: 18: Hoare triple {4790#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4780#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {4790#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4790#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {4790#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4790#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {4800#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4790#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {4800#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4800#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {4800#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4800#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {4810#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4800#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {4810#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4810#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {4810#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4810#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {4820#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4810#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {4820#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4820#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,386 INFO L273 TraceCheckUtils]: 7: Hoare triple {4820#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4820#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,390 INFO L273 TraceCheckUtils]: 6: Hoare triple {4830#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {4820#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {4496#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {4830#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:13,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {4496#true} call #t~ret15 := main(); {4496#true} is VALID [2018-11-23 09:55:13,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4496#true} {4496#true} #130#return; {4496#true} is VALID [2018-11-23 09:55:13,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {4496#true} assume true; {4496#true} is VALID [2018-11-23 09:55:13,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {4496#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4496#true} is VALID [2018-11-23 09:55:13,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {4496#true} call ULTIMATE.init(); {4496#true} is VALID [2018-11-23 09:55:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 145 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:55:13,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:13,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 09:55:13,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-11-23 09:55:13,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:13,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 09:55:13,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:13,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 09:55:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 09:55:13,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2018-11-23 09:55:13,591 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand 26 states. [2018-11-23 09:55:16,177 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 10 [2018-11-23 09:55:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:22,226 INFO L93 Difference]: Finished difference Result 355 states and 506 transitions. [2018-11-23 09:55:22,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 09:55:22,226 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-11-23 09:55:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:22,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 09:55:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 286 transitions. [2018-11-23 09:55:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 09:55:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 286 transitions. [2018-11-23 09:55:22,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 286 transitions. [2018-11-23 09:55:23,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:23,170 INFO L225 Difference]: With dead ends: 355 [2018-11-23 09:55:23,170 INFO L226 Difference]: Without dead ends: 279 [2018-11-23 09:55:23,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=974, Invalid=2448, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 09:55:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-23 09:55:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 251. [2018-11-23 09:55:23,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:23,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand 251 states. [2018-11-23 09:55:23,587 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand 251 states. [2018-11-23 09:55:23,587 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 251 states. [2018-11-23 09:55:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:23,599 INFO L93 Difference]: Finished difference Result 279 states and 371 transitions. [2018-11-23 09:55:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 371 transitions. [2018-11-23 09:55:23,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:23,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:23,600 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand 279 states. [2018-11-23 09:55:23,600 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 279 states. [2018-11-23 09:55:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:23,610 INFO L93 Difference]: Finished difference Result 279 states and 371 transitions. [2018-11-23 09:55:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 371 transitions. [2018-11-23 09:55:23,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:23,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:23,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:23,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-23 09:55:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2018-11-23 09:55:23,622 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 55 [2018-11-23 09:55:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:23,622 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2018-11-23 09:55:23,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 09:55:23,622 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2018-11-23 09:55:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 09:55:23,624 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:23,624 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:23,624 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:23,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:23,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1991798956, now seen corresponding path program 2 times [2018-11-23 09:55:23,625 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:23,657 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:23,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:55:23,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:23,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:24,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6299#true} is VALID [2018-11-23 09:55:24,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {6299#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6299#true} is VALID [2018-11-23 09:55:24,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-23 09:55:24,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #130#return; {6299#true} is VALID [2018-11-23 09:55:24,724 INFO L256 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret15 := main(); {6299#true} is VALID [2018-11-23 09:55:24,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {6299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {6319#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:24,725 INFO L273 TraceCheckUtils]: 6: Hoare triple {6319#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {6323#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {6323#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6323#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {6323#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6323#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {6323#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6333#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:24,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {6333#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6333#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:24,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {6333#(= (_ bv2 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6333#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:24,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {6333#(= (_ bv2 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {6343#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {6343#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6343#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {6343#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6343#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {6343#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6353#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,730 INFO L273 TraceCheckUtils]: 16: Hoare triple {6353#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6353#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {6353#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6353#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {6353#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6363#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {6363#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6363#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {6363#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6363#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,733 INFO L273 TraceCheckUtils]: 21: Hoare triple {6363#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6373#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:55:24,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {6373#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6373#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:55:24,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {6373#(= (_ bv6 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6373#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:55:24,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {6373#(= (_ bv6 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {6383#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,736 INFO L273 TraceCheckUtils]: 25: Hoare triple {6383#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6383#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {6383#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6383#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,737 INFO L273 TraceCheckUtils]: 27: Hoare triple {6383#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6393#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,737 INFO L273 TraceCheckUtils]: 28: Hoare triple {6393#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6393#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,738 INFO L273 TraceCheckUtils]: 29: Hoare triple {6393#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6393#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,739 INFO L273 TraceCheckUtils]: 30: Hoare triple {6393#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6403#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 09:55:24,739 INFO L273 TraceCheckUtils]: 31: Hoare triple {6403#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6403#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 09:55:24,740 INFO L273 TraceCheckUtils]: 32: Hoare triple {6403#(= (_ bv9 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6403#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 09:55:24,741 INFO L273 TraceCheckUtils]: 33: Hoare triple {6403#(= (_ bv9 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {6413#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,741 INFO L273 TraceCheckUtils]: 34: Hoare triple {6413#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6413#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,742 INFO L273 TraceCheckUtils]: 35: Hoare triple {6413#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6413#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,743 INFO L273 TraceCheckUtils]: 36: Hoare triple {6413#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6423#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 09:55:24,743 INFO L273 TraceCheckUtils]: 37: Hoare triple {6423#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6423#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 09:55:24,744 INFO L273 TraceCheckUtils]: 38: Hoare triple {6423#(= (_ bv11 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6423#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 09:55:24,744 INFO L273 TraceCheckUtils]: 39: Hoare triple {6423#(= (_ bv11 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {6433#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {6433#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6433#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,748 INFO L273 TraceCheckUtils]: 41: Hoare triple {6433#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6433#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,749 INFO L273 TraceCheckUtils]: 42: Hoare triple {6433#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6443#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-23 09:55:24,751 INFO L273 TraceCheckUtils]: 43: Hoare triple {6443#(= (_ bv13 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6443#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-23 09:55:24,752 INFO L273 TraceCheckUtils]: 44: Hoare triple {6443#(= (_ bv13 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6443#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-23 09:55:24,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {6443#(= (_ bv13 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {6453#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {6453#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6453#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,753 INFO L273 TraceCheckUtils]: 47: Hoare triple {6453#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6453#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,753 INFO L273 TraceCheckUtils]: 48: Hoare triple {6453#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6463#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 09:55:24,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {6463#(= (_ bv15 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6463#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 09:55:24,754 INFO L273 TraceCheckUtils]: 50: Hoare triple {6463#(= (_ bv15 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6463#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 09:55:24,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {6463#(= (_ bv15 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {6473#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,755 INFO L273 TraceCheckUtils]: 52: Hoare triple {6473#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6473#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,755 INFO L273 TraceCheckUtils]: 53: Hoare triple {6473#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6473#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,756 INFO L273 TraceCheckUtils]: 54: Hoare triple {6473#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6483#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 09:55:24,756 INFO L273 TraceCheckUtils]: 55: Hoare triple {6483#(= (_ bv17 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6483#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 09:55:24,757 INFO L273 TraceCheckUtils]: 56: Hoare triple {6483#(= (_ bv17 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6483#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 09:55:24,758 INFO L273 TraceCheckUtils]: 57: Hoare triple {6483#(= (_ bv17 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {6493#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,769 INFO L273 TraceCheckUtils]: 58: Hoare triple {6493#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6493#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,769 INFO L273 TraceCheckUtils]: 59: Hoare triple {6493#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6493#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,770 INFO L273 TraceCheckUtils]: 60: Hoare triple {6493#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6503#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-23 09:55:24,770 INFO L273 TraceCheckUtils]: 61: Hoare triple {6503#(= (_ bv19 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6503#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-23 09:55:24,770 INFO L273 TraceCheckUtils]: 62: Hoare triple {6503#(= (_ bv19 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6503#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-23 09:55:24,771 INFO L273 TraceCheckUtils]: 63: Hoare triple {6503#(= (_ bv19 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {6513#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {6513#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6513#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,771 INFO L273 TraceCheckUtils]: 65: Hoare triple {6513#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6513#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,772 INFO L273 TraceCheckUtils]: 66: Hoare triple {6513#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6523#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-23 09:55:24,772 INFO L273 TraceCheckUtils]: 67: Hoare triple {6523#(= (_ bv21 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6523#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-23 09:55:24,773 INFO L273 TraceCheckUtils]: 68: Hoare triple {6523#(= (_ bv21 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6523#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-23 09:55:24,773 INFO L273 TraceCheckUtils]: 69: Hoare triple {6523#(= (_ bv21 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {6533#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,773 INFO L273 TraceCheckUtils]: 70: Hoare triple {6533#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6533#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,782 INFO L273 TraceCheckUtils]: 71: Hoare triple {6533#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6533#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,782 INFO L273 TraceCheckUtils]: 72: Hoare triple {6533#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6543#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:24,783 INFO L273 TraceCheckUtils]: 73: Hoare triple {6543#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {6300#false} is VALID [2018-11-23 09:55:24,783 INFO L273 TraceCheckUtils]: 74: Hoare triple {6300#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6300#false} is VALID [2018-11-23 09:55:24,783 INFO L273 TraceCheckUtils]: 75: Hoare triple {6300#false} ~x~0 := 0bv32; {6300#false} is VALID [2018-11-23 09:55:24,783 INFO L273 TraceCheckUtils]: 76: Hoare triple {6300#false} assume !~bvslt32(~x~0, ~i~0); {6300#false} is VALID [2018-11-23 09:55:24,783 INFO L273 TraceCheckUtils]: 77: Hoare triple {6300#false} ~x~0 := 0bv32; {6300#false} is VALID [2018-11-23 09:55:24,784 INFO L273 TraceCheckUtils]: 78: Hoare triple {6300#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6300#false} is VALID [2018-11-23 09:55:24,784 INFO L256 TraceCheckUtils]: 79: Hoare triple {6300#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {6300#false} is VALID [2018-11-23 09:55:24,784 INFO L273 TraceCheckUtils]: 80: Hoare triple {6300#false} ~cond := #in~cond; {6300#false} is VALID [2018-11-23 09:55:24,784 INFO L273 TraceCheckUtils]: 81: Hoare triple {6300#false} assume !(0bv32 == ~cond); {6300#false} is VALID [2018-11-23 09:55:24,784 INFO L273 TraceCheckUtils]: 82: Hoare triple {6300#false} assume true; {6300#false} is VALID [2018-11-23 09:55:24,784 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {6300#false} {6300#false} #136#return; {6300#false} is VALID [2018-11-23 09:55:24,784 INFO L273 TraceCheckUtils]: 84: Hoare triple {6300#false} havoc #t~mem10;havoc #t~mem9; {6300#false} is VALID [2018-11-23 09:55:24,785 INFO L273 TraceCheckUtils]: 85: Hoare triple {6300#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {6300#false} is VALID [2018-11-23 09:55:24,785 INFO L273 TraceCheckUtils]: 86: Hoare triple {6300#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6300#false} is VALID [2018-11-23 09:55:24,785 INFO L256 TraceCheckUtils]: 87: Hoare triple {6300#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {6300#false} is VALID [2018-11-23 09:55:24,785 INFO L273 TraceCheckUtils]: 88: Hoare triple {6300#false} ~cond := #in~cond; {6300#false} is VALID [2018-11-23 09:55:24,785 INFO L273 TraceCheckUtils]: 89: Hoare triple {6300#false} assume 0bv32 == ~cond; {6300#false} is VALID [2018-11-23 09:55:24,785 INFO L273 TraceCheckUtils]: 90: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2018-11-23 09:55:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:55:24,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:26,534 INFO L273 TraceCheckUtils]: 90: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2018-11-23 09:55:26,534 INFO L273 TraceCheckUtils]: 89: Hoare triple {6300#false} assume 0bv32 == ~cond; {6300#false} is VALID [2018-11-23 09:55:26,535 INFO L273 TraceCheckUtils]: 88: Hoare triple {6300#false} ~cond := #in~cond; {6300#false} is VALID [2018-11-23 09:55:26,535 INFO L256 TraceCheckUtils]: 87: Hoare triple {6300#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {6300#false} is VALID [2018-11-23 09:55:26,535 INFO L273 TraceCheckUtils]: 86: Hoare triple {6300#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6300#false} is VALID [2018-11-23 09:55:26,535 INFO L273 TraceCheckUtils]: 85: Hoare triple {6300#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {6300#false} is VALID [2018-11-23 09:55:26,536 INFO L273 TraceCheckUtils]: 84: Hoare triple {6300#false} havoc #t~mem10;havoc #t~mem9; {6300#false} is VALID [2018-11-23 09:55:26,536 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {6299#true} {6300#false} #136#return; {6300#false} is VALID [2018-11-23 09:55:26,536 INFO L273 TraceCheckUtils]: 82: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-23 09:55:26,536 INFO L273 TraceCheckUtils]: 81: Hoare triple {6299#true} assume !(0bv32 == ~cond); {6299#true} is VALID [2018-11-23 09:55:26,536 INFO L273 TraceCheckUtils]: 80: Hoare triple {6299#true} ~cond := #in~cond; {6299#true} is VALID [2018-11-23 09:55:26,537 INFO L256 TraceCheckUtils]: 79: Hoare triple {6300#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {6299#true} is VALID [2018-11-23 09:55:26,537 INFO L273 TraceCheckUtils]: 78: Hoare triple {6300#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6300#false} is VALID [2018-11-23 09:55:26,537 INFO L273 TraceCheckUtils]: 77: Hoare triple {6300#false} ~x~0 := 0bv32; {6300#false} is VALID [2018-11-23 09:55:26,537 INFO L273 TraceCheckUtils]: 76: Hoare triple {6300#false} assume !~bvslt32(~x~0, ~i~0); {6300#false} is VALID [2018-11-23 09:55:26,537 INFO L273 TraceCheckUtils]: 75: Hoare triple {6300#false} ~x~0 := 0bv32; {6300#false} is VALID [2018-11-23 09:55:26,537 INFO L273 TraceCheckUtils]: 74: Hoare triple {6300#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6300#false} is VALID [2018-11-23 09:55:26,538 INFO L273 TraceCheckUtils]: 73: Hoare triple {6649#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {6300#false} is VALID [2018-11-23 09:55:26,539 INFO L273 TraceCheckUtils]: 72: Hoare triple {6653#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6649#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:26,539 INFO L273 TraceCheckUtils]: 71: Hoare triple {6653#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6653#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,540 INFO L273 TraceCheckUtils]: 70: Hoare triple {6653#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6653#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,545 INFO L273 TraceCheckUtils]: 69: Hoare triple {6663#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6653#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,546 INFO L273 TraceCheckUtils]: 68: Hoare triple {6663#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6663#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,546 INFO L273 TraceCheckUtils]: 67: Hoare triple {6663#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6663#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,553 INFO L273 TraceCheckUtils]: 66: Hoare triple {6673#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6663#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,554 INFO L273 TraceCheckUtils]: 65: Hoare triple {6673#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6673#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,554 INFO L273 TraceCheckUtils]: 64: Hoare triple {6673#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6673#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,561 INFO L273 TraceCheckUtils]: 63: Hoare triple {6683#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6673#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,561 INFO L273 TraceCheckUtils]: 62: Hoare triple {6683#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6683#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,562 INFO L273 TraceCheckUtils]: 61: Hoare triple {6683#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6683#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,567 INFO L273 TraceCheckUtils]: 60: Hoare triple {6693#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6683#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,567 INFO L273 TraceCheckUtils]: 59: Hoare triple {6693#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6693#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,568 INFO L273 TraceCheckUtils]: 58: Hoare triple {6693#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6693#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {6703#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6693#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,573 INFO L273 TraceCheckUtils]: 56: Hoare triple {6703#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6703#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,573 INFO L273 TraceCheckUtils]: 55: Hoare triple {6703#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6703#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,579 INFO L273 TraceCheckUtils]: 54: Hoare triple {6713#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6703#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,580 INFO L273 TraceCheckUtils]: 53: Hoare triple {6713#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6713#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,580 INFO L273 TraceCheckUtils]: 52: Hoare triple {6713#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6713#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,585 INFO L273 TraceCheckUtils]: 51: Hoare triple {6723#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6713#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,585 INFO L273 TraceCheckUtils]: 50: Hoare triple {6723#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6723#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,586 INFO L273 TraceCheckUtils]: 49: Hoare triple {6723#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6723#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,595 INFO L273 TraceCheckUtils]: 48: Hoare triple {6733#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6723#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,596 INFO L273 TraceCheckUtils]: 47: Hoare triple {6733#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6733#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,596 INFO L273 TraceCheckUtils]: 46: Hoare triple {6733#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6733#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,603 INFO L273 TraceCheckUtils]: 45: Hoare triple {6743#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6733#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,604 INFO L273 TraceCheckUtils]: 44: Hoare triple {6743#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6743#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,604 INFO L273 TraceCheckUtils]: 43: Hoare triple {6743#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6743#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,610 INFO L273 TraceCheckUtils]: 42: Hoare triple {6753#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6743#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,611 INFO L273 TraceCheckUtils]: 41: Hoare triple {6753#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6753#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,611 INFO L273 TraceCheckUtils]: 40: Hoare triple {6753#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6753#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {6763#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6753#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,616 INFO L273 TraceCheckUtils]: 38: Hoare triple {6763#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6763#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,617 INFO L273 TraceCheckUtils]: 37: Hoare triple {6763#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6763#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,621 INFO L273 TraceCheckUtils]: 36: Hoare triple {6773#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6763#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,621 INFO L273 TraceCheckUtils]: 35: Hoare triple {6773#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6773#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {6773#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6773#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,626 INFO L273 TraceCheckUtils]: 33: Hoare triple {6783#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6773#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,627 INFO L273 TraceCheckUtils]: 32: Hoare triple {6783#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6783#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,627 INFO L273 TraceCheckUtils]: 31: Hoare triple {6783#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6783#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {6793#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6783#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,634 INFO L273 TraceCheckUtils]: 29: Hoare triple {6793#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6793#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,634 INFO L273 TraceCheckUtils]: 28: Hoare triple {6793#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6793#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,640 INFO L273 TraceCheckUtils]: 27: Hoare triple {6803#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6793#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {6803#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6803#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {6803#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6803#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {6813#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6803#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,646 INFO L273 TraceCheckUtils]: 23: Hoare triple {6813#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6813#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {6813#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6813#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {6823#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6813#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,654 INFO L273 TraceCheckUtils]: 20: Hoare triple {6823#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6823#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,655 INFO L273 TraceCheckUtils]: 19: Hoare triple {6823#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6823#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {6833#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6823#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {6833#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6833#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,663 INFO L273 TraceCheckUtils]: 16: Hoare triple {6833#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6833#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {6843#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6833#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {6843#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6843#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {6843#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6843#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {6853#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6843#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {6853#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6853#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {6853#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6853#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {6863#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6853#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {6863#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6863#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {6863#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6863#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {6873#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {6863#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {6299#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {6873#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:26,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret15 := main(); {6299#true} is VALID [2018-11-23 09:55:26,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #130#return; {6299#true} is VALID [2018-11-23 09:55:26,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-23 09:55:26,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {6299#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6299#true} is VALID [2018-11-23 09:55:26,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6299#true} is VALID [2018-11-23 09:55:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 2 proven. 715 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:55:26,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:26,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-23 09:55:26,727 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 91 [2018-11-23 09:55:26,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:26,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 09:55:27,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:27,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 09:55:27,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 09:55:27,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1823, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 09:55:27,123 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand 50 states. [2018-11-23 09:55:37,299 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 10 [2018-11-23 09:55:37,837 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 10 [2018-11-23 09:55:38,463 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2018-11-23 09:55:39,202 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 10 [2018-11-23 09:55:39,903 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 10 [2018-11-23 09:55:40,559 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 10 [2018-11-23 09:55:41,218 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 10 [2018-11-23 09:55:41,880 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2018-11-23 09:55:51,013 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2018-11-23 09:55:52,038 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 11 [2018-11-23 09:55:52,896 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 11 [2018-11-23 09:55:53,690 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 11 [2018-11-23 09:55:54,537 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 11 [2018-11-23 09:55:55,407 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 11 [2018-11-23 09:55:56,297 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 11 [2018-11-23 09:55:57,205 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 11 [2018-11-23 09:55:58,108 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 11 [2018-11-23 09:55:59,021 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 11 [2018-11-23 09:55:59,942 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 11 [2018-11-23 09:56:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:56:07,771 INFO L93 Difference]: Finished difference Result 607 states and 878 transitions. [2018-11-23 09:56:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-23 09:56:07,772 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 91 [2018-11-23 09:56:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:56:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 09:56:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 448 transitions. [2018-11-23 09:56:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 09:56:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 448 transitions. [2018-11-23 09:56:07,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 448 transitions. [2018-11-23 09:56:09,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:56:09,321 INFO L225 Difference]: With dead ends: 607 [2018-11-23 09:56:09,322 INFO L226 Difference]: Without dead ends: 495 [2018-11-23 09:56:09,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2369 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=3824, Invalid=10218, Unknown=0, NotChecked=0, Total=14042 [2018-11-23 09:56:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-11-23 09:56:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 467. [2018-11-23 09:56:09,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:56:09,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand 467 states. [2018-11-23 09:56:09,979 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand 467 states. [2018-11-23 09:56:09,979 INFO L87 Difference]: Start difference. First operand 495 states. Second operand 467 states. [2018-11-23 09:56:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:56:09,997 INFO L93 Difference]: Finished difference Result 495 states and 659 transitions. [2018-11-23 09:56:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 659 transitions. [2018-11-23 09:56:09,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:56:09,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:56:09,999 INFO L74 IsIncluded]: Start isIncluded. First operand 467 states. Second operand 495 states. [2018-11-23 09:56:09,999 INFO L87 Difference]: Start difference. First operand 467 states. Second operand 495 states. [2018-11-23 09:56:10,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:56:10,016 INFO L93 Difference]: Finished difference Result 495 states and 659 transitions. [2018-11-23 09:56:10,016 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 659 transitions. [2018-11-23 09:56:10,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:56:10,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:56:10,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:56:10,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:56:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-11-23 09:56:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 619 transitions. [2018-11-23 09:56:10,035 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 619 transitions. Word has length 91 [2018-11-23 09:56:10,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:56:10,035 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 619 transitions. [2018-11-23 09:56:10,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 09:56:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 619 transitions. [2018-11-23 09:56:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 09:56:10,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:56:10,038 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:56:10,039 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:56:10,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:56:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash -158714068, now seen corresponding path program 3 times [2018-11-23 09:56:10,040 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:56:10,040 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:56:10,067 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:56:40,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-11-23 09:56:40,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:56:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:56:40,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:56:42,721 INFO L256 TraceCheckUtils]: 0: Hoare triple {9470#true} call ULTIMATE.init(); {9470#true} is VALID [2018-11-23 09:56:42,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {9470#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {9470#true} is VALID [2018-11-23 09:56:42,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {9470#true} assume true; {9470#true} is VALID [2018-11-23 09:56:42,722 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9470#true} {9470#true} #130#return; {9470#true} is VALID [2018-11-23 09:56:42,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {9470#true} call #t~ret15 := main(); {9470#true} is VALID [2018-11-23 09:56:42,723 INFO L273 TraceCheckUtils]: 5: Hoare triple {9470#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {9490#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:56:42,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {9490#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {9494#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,724 INFO L273 TraceCheckUtils]: 7: Hoare triple {9494#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9494#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {9494#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9494#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {9494#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9504#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:56:42,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {9504#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9504#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:56:42,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {9504#(= (_ bv2 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9504#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:56:42,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {9504#(= (_ bv2 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9514#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {9514#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9514#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,728 INFO L273 TraceCheckUtils]: 14: Hoare triple {9514#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9514#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {9514#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9524#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {9524#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9524#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {9524#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9524#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,730 INFO L273 TraceCheckUtils]: 18: Hoare triple {9524#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9534#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {9534#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9534#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,732 INFO L273 TraceCheckUtils]: 20: Hoare triple {9534#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9534#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {9534#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9544#(= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {9544#(= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9544#(= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {9544#(= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9544#(= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {9544#(= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9554#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {9554#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9554#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,735 INFO L273 TraceCheckUtils]: 26: Hoare triple {9554#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9554#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {9554#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9564#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,736 INFO L273 TraceCheckUtils]: 28: Hoare triple {9564#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9564#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,737 INFO L273 TraceCheckUtils]: 29: Hoare triple {9564#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9564#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,737 INFO L273 TraceCheckUtils]: 30: Hoare triple {9564#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9574#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,738 INFO L273 TraceCheckUtils]: 31: Hoare triple {9574#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9574#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,738 INFO L273 TraceCheckUtils]: 32: Hoare triple {9574#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9574#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,739 INFO L273 TraceCheckUtils]: 33: Hoare triple {9574#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9584#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,740 INFO L273 TraceCheckUtils]: 34: Hoare triple {9584#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9584#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,740 INFO L273 TraceCheckUtils]: 35: Hoare triple {9584#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9584#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,741 INFO L273 TraceCheckUtils]: 36: Hoare triple {9584#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9594#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,742 INFO L273 TraceCheckUtils]: 37: Hoare triple {9594#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9594#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,742 INFO L273 TraceCheckUtils]: 38: Hoare triple {9594#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9594#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {9594#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9604#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,743 INFO L273 TraceCheckUtils]: 40: Hoare triple {9604#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9604#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {9604#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9604#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,768 INFO L273 TraceCheckUtils]: 42: Hoare triple {9604#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9614#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,769 INFO L273 TraceCheckUtils]: 43: Hoare triple {9614#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9614#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {9614#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9614#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,769 INFO L273 TraceCheckUtils]: 45: Hoare triple {9614#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9624#(= (_ bv14 32) main_~k~0)} is VALID [2018-11-23 09:56:42,770 INFO L273 TraceCheckUtils]: 46: Hoare triple {9624#(= (_ bv14 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9624#(= (_ bv14 32) main_~k~0)} is VALID [2018-11-23 09:56:42,770 INFO L273 TraceCheckUtils]: 47: Hoare triple {9624#(= (_ bv14 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9624#(= (_ bv14 32) main_~k~0)} is VALID [2018-11-23 09:56:42,771 INFO L273 TraceCheckUtils]: 48: Hoare triple {9624#(= (_ bv14 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9634#(= (bvadd main_~k~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,771 INFO L273 TraceCheckUtils]: 49: Hoare triple {9634#(= (bvadd main_~k~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9634#(= (bvadd main_~k~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,771 INFO L273 TraceCheckUtils]: 50: Hoare triple {9634#(= (bvadd main_~k~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9634#(= (bvadd main_~k~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,772 INFO L273 TraceCheckUtils]: 51: Hoare triple {9634#(= (bvadd main_~k~0 (_ bv4294967281 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9644#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,772 INFO L273 TraceCheckUtils]: 52: Hoare triple {9644#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9644#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {9644#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9644#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {9644#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9654#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,774 INFO L273 TraceCheckUtils]: 55: Hoare triple {9654#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9654#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,774 INFO L273 TraceCheckUtils]: 56: Hoare triple {9654#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9654#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,775 INFO L273 TraceCheckUtils]: 57: Hoare triple {9654#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9664#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,776 INFO L273 TraceCheckUtils]: 58: Hoare triple {9664#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9664#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,776 INFO L273 TraceCheckUtils]: 59: Hoare triple {9664#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9664#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,777 INFO L273 TraceCheckUtils]: 60: Hoare triple {9664#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9674#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,778 INFO L273 TraceCheckUtils]: 61: Hoare triple {9674#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9674#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,778 INFO L273 TraceCheckUtils]: 62: Hoare triple {9674#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9674#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,779 INFO L273 TraceCheckUtils]: 63: Hoare triple {9674#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9684#(= (_ bv20 32) main_~k~0)} is VALID [2018-11-23 09:56:42,779 INFO L273 TraceCheckUtils]: 64: Hoare triple {9684#(= (_ bv20 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9684#(= (_ bv20 32) main_~k~0)} is VALID [2018-11-23 09:56:42,780 INFO L273 TraceCheckUtils]: 65: Hoare triple {9684#(= (_ bv20 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9684#(= (_ bv20 32) main_~k~0)} is VALID [2018-11-23 09:56:42,781 INFO L273 TraceCheckUtils]: 66: Hoare triple {9684#(= (_ bv20 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9694#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,781 INFO L273 TraceCheckUtils]: 67: Hoare triple {9694#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9694#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,782 INFO L273 TraceCheckUtils]: 68: Hoare triple {9694#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9694#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,783 INFO L273 TraceCheckUtils]: 69: Hoare triple {9694#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9704#(= (_ bv22 32) main_~k~0)} is VALID [2018-11-23 09:56:42,783 INFO L273 TraceCheckUtils]: 70: Hoare triple {9704#(= (_ bv22 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9704#(= (_ bv22 32) main_~k~0)} is VALID [2018-11-23 09:56:42,784 INFO L273 TraceCheckUtils]: 71: Hoare triple {9704#(= (_ bv22 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9704#(= (_ bv22 32) main_~k~0)} is VALID [2018-11-23 09:56:42,784 INFO L273 TraceCheckUtils]: 72: Hoare triple {9704#(= (_ bv22 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9714#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,785 INFO L273 TraceCheckUtils]: 73: Hoare triple {9714#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9714#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,785 INFO L273 TraceCheckUtils]: 74: Hoare triple {9714#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9714#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,786 INFO L273 TraceCheckUtils]: 75: Hoare triple {9714#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9724#(= (_ bv24 32) main_~k~0)} is VALID [2018-11-23 09:56:42,787 INFO L273 TraceCheckUtils]: 76: Hoare triple {9724#(= (_ bv24 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9724#(= (_ bv24 32) main_~k~0)} is VALID [2018-11-23 09:56:42,787 INFO L273 TraceCheckUtils]: 77: Hoare triple {9724#(= (_ bv24 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9724#(= (_ bv24 32) main_~k~0)} is VALID [2018-11-23 09:56:42,788 INFO L273 TraceCheckUtils]: 78: Hoare triple {9724#(= (_ bv24 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9734#(= (bvadd main_~k~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,789 INFO L273 TraceCheckUtils]: 79: Hoare triple {9734#(= (bvadd main_~k~0 (_ bv4294967271 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9734#(= (bvadd main_~k~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,789 INFO L273 TraceCheckUtils]: 80: Hoare triple {9734#(= (bvadd main_~k~0 (_ bv4294967271 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9734#(= (bvadd main_~k~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,790 INFO L273 TraceCheckUtils]: 81: Hoare triple {9734#(= (bvadd main_~k~0 (_ bv4294967271 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9744#(= (_ bv26 32) main_~k~0)} is VALID [2018-11-23 09:56:42,791 INFO L273 TraceCheckUtils]: 82: Hoare triple {9744#(= (_ bv26 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9744#(= (_ bv26 32) main_~k~0)} is VALID [2018-11-23 09:56:42,791 INFO L273 TraceCheckUtils]: 83: Hoare triple {9744#(= (_ bv26 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9744#(= (_ bv26 32) main_~k~0)} is VALID [2018-11-23 09:56:42,792 INFO L273 TraceCheckUtils]: 84: Hoare triple {9744#(= (_ bv26 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9754#(= (bvadd main_~k~0 (_ bv4294967269 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,793 INFO L273 TraceCheckUtils]: 85: Hoare triple {9754#(= (bvadd main_~k~0 (_ bv4294967269 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9754#(= (bvadd main_~k~0 (_ bv4294967269 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,793 INFO L273 TraceCheckUtils]: 86: Hoare triple {9754#(= (bvadd main_~k~0 (_ bv4294967269 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9754#(= (bvadd main_~k~0 (_ bv4294967269 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,794 INFO L273 TraceCheckUtils]: 87: Hoare triple {9754#(= (bvadd main_~k~0 (_ bv4294967269 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9764#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,794 INFO L273 TraceCheckUtils]: 88: Hoare triple {9764#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9764#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,795 INFO L273 TraceCheckUtils]: 89: Hoare triple {9764#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9764#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,795 INFO L273 TraceCheckUtils]: 90: Hoare triple {9764#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9774#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,796 INFO L273 TraceCheckUtils]: 91: Hoare triple {9774#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9774#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,796 INFO L273 TraceCheckUtils]: 92: Hoare triple {9774#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9774#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,797 INFO L273 TraceCheckUtils]: 93: Hoare triple {9774#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9784#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,798 INFO L273 TraceCheckUtils]: 94: Hoare triple {9784#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9784#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,798 INFO L273 TraceCheckUtils]: 95: Hoare triple {9784#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9784#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,799 INFO L273 TraceCheckUtils]: 96: Hoare triple {9784#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9794#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,800 INFO L273 TraceCheckUtils]: 97: Hoare triple {9794#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9794#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,800 INFO L273 TraceCheckUtils]: 98: Hoare triple {9794#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9794#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,806 INFO L273 TraceCheckUtils]: 99: Hoare triple {9794#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9804#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,806 INFO L273 TraceCheckUtils]: 100: Hoare triple {9804#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9804#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,807 INFO L273 TraceCheckUtils]: 101: Hoare triple {9804#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9804#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,807 INFO L273 TraceCheckUtils]: 102: Hoare triple {9804#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9814#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,808 INFO L273 TraceCheckUtils]: 103: Hoare triple {9814#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9814#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,808 INFO L273 TraceCheckUtils]: 104: Hoare triple {9814#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9814#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,808 INFO L273 TraceCheckUtils]: 105: Hoare triple {9814#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9824#(= (_ bv34 32) main_~k~0)} is VALID [2018-11-23 09:56:42,809 INFO L273 TraceCheckUtils]: 106: Hoare triple {9824#(= (_ bv34 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9824#(= (_ bv34 32) main_~k~0)} is VALID [2018-11-23 09:56:42,809 INFO L273 TraceCheckUtils]: 107: Hoare triple {9824#(= (_ bv34 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9824#(= (_ bv34 32) main_~k~0)} is VALID [2018-11-23 09:56:42,809 INFO L273 TraceCheckUtils]: 108: Hoare triple {9824#(= (_ bv34 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9834#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,810 INFO L273 TraceCheckUtils]: 109: Hoare triple {9834#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9834#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,810 INFO L273 TraceCheckUtils]: 110: Hoare triple {9834#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9834#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,811 INFO L273 TraceCheckUtils]: 111: Hoare triple {9834#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9844#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,811 INFO L273 TraceCheckUtils]: 112: Hoare triple {9844#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9844#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,812 INFO L273 TraceCheckUtils]: 113: Hoare triple {9844#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9844#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,813 INFO L273 TraceCheckUtils]: 114: Hoare triple {9844#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9854#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,813 INFO L273 TraceCheckUtils]: 115: Hoare triple {9854#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9854#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,814 INFO L273 TraceCheckUtils]: 116: Hoare triple {9854#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9854#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,814 INFO L273 TraceCheckUtils]: 117: Hoare triple {9854#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9864#(= (bvadd main_~k~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,815 INFO L273 TraceCheckUtils]: 118: Hoare triple {9864#(= (bvadd main_~k~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9864#(= (bvadd main_~k~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,816 INFO L273 TraceCheckUtils]: 119: Hoare triple {9864#(= (bvadd main_~k~0 (_ bv4294967258 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9864#(= (bvadd main_~k~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,816 INFO L273 TraceCheckUtils]: 120: Hoare triple {9864#(= (bvadd main_~k~0 (_ bv4294967258 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9874#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,817 INFO L273 TraceCheckUtils]: 121: Hoare triple {9874#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9874#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,817 INFO L273 TraceCheckUtils]: 122: Hoare triple {9874#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9874#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,818 INFO L273 TraceCheckUtils]: 123: Hoare triple {9874#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9884#(= (_ bv40 32) main_~k~0)} is VALID [2018-11-23 09:56:42,819 INFO L273 TraceCheckUtils]: 124: Hoare triple {9884#(= (_ bv40 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9884#(= (_ bv40 32) main_~k~0)} is VALID [2018-11-23 09:56:42,819 INFO L273 TraceCheckUtils]: 125: Hoare triple {9884#(= (_ bv40 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9884#(= (_ bv40 32) main_~k~0)} is VALID [2018-11-23 09:56:42,820 INFO L273 TraceCheckUtils]: 126: Hoare triple {9884#(= (_ bv40 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9894#(= (bvadd main_~k~0 (_ bv4294967255 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,820 INFO L273 TraceCheckUtils]: 127: Hoare triple {9894#(= (bvadd main_~k~0 (_ bv4294967255 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9894#(= (bvadd main_~k~0 (_ bv4294967255 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,821 INFO L273 TraceCheckUtils]: 128: Hoare triple {9894#(= (bvadd main_~k~0 (_ bv4294967255 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9894#(= (bvadd main_~k~0 (_ bv4294967255 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,822 INFO L273 TraceCheckUtils]: 129: Hoare triple {9894#(= (bvadd main_~k~0 (_ bv4294967255 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9904#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,822 INFO L273 TraceCheckUtils]: 130: Hoare triple {9904#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9904#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,823 INFO L273 TraceCheckUtils]: 131: Hoare triple {9904#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9904#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,823 INFO L273 TraceCheckUtils]: 132: Hoare triple {9904#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9914#(= (bvadd main_~k~0 (_ bv4294967253 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,824 INFO L273 TraceCheckUtils]: 133: Hoare triple {9914#(= (bvadd main_~k~0 (_ bv4294967253 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9914#(= (bvadd main_~k~0 (_ bv4294967253 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,825 INFO L273 TraceCheckUtils]: 134: Hoare triple {9914#(= (bvadd main_~k~0 (_ bv4294967253 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9914#(= (bvadd main_~k~0 (_ bv4294967253 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,825 INFO L273 TraceCheckUtils]: 135: Hoare triple {9914#(= (bvadd main_~k~0 (_ bv4294967253 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9924#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,826 INFO L273 TraceCheckUtils]: 136: Hoare triple {9924#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9924#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,826 INFO L273 TraceCheckUtils]: 137: Hoare triple {9924#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9924#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,827 INFO L273 TraceCheckUtils]: 138: Hoare triple {9924#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9934#(= (_ bv45 32) main_~k~0)} is VALID [2018-11-23 09:56:42,828 INFO L273 TraceCheckUtils]: 139: Hoare triple {9934#(= (_ bv45 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9934#(= (_ bv45 32) main_~k~0)} is VALID [2018-11-23 09:56:42,846 INFO L273 TraceCheckUtils]: 140: Hoare triple {9934#(= (_ bv45 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9934#(= (_ bv45 32) main_~k~0)} is VALID [2018-11-23 09:56:42,851 INFO L273 TraceCheckUtils]: 141: Hoare triple {9934#(= (_ bv45 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9944#(= (bvadd main_~k~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,852 INFO L273 TraceCheckUtils]: 142: Hoare triple {9944#(= (bvadd main_~k~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9944#(= (bvadd main_~k~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,852 INFO L273 TraceCheckUtils]: 143: Hoare triple {9944#(= (bvadd main_~k~0 (_ bv4294967250 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {9944#(= (bvadd main_~k~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,853 INFO L273 TraceCheckUtils]: 144: Hoare triple {9944#(= (bvadd main_~k~0 (_ bv4294967250 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9954#(= (bvadd main_~k~0 (_ bv4294967249 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:42,853 INFO L273 TraceCheckUtils]: 145: Hoare triple {9954#(= (bvadd main_~k~0 (_ bv4294967249 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {9471#false} is VALID [2018-11-23 09:56:42,853 INFO L273 TraceCheckUtils]: 146: Hoare triple {9471#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9471#false} is VALID [2018-11-23 09:56:42,853 INFO L273 TraceCheckUtils]: 147: Hoare triple {9471#false} ~x~0 := 0bv32; {9471#false} is VALID [2018-11-23 09:56:42,854 INFO L273 TraceCheckUtils]: 148: Hoare triple {9471#false} assume !~bvslt32(~x~0, ~i~0); {9471#false} is VALID [2018-11-23 09:56:42,854 INFO L273 TraceCheckUtils]: 149: Hoare triple {9471#false} ~x~0 := 0bv32; {9471#false} is VALID [2018-11-23 09:56:42,854 INFO L273 TraceCheckUtils]: 150: Hoare triple {9471#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9471#false} is VALID [2018-11-23 09:56:42,854 INFO L256 TraceCheckUtils]: 151: Hoare triple {9471#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {9471#false} is VALID [2018-11-23 09:56:42,854 INFO L273 TraceCheckUtils]: 152: Hoare triple {9471#false} ~cond := #in~cond; {9471#false} is VALID [2018-11-23 09:56:42,854 INFO L273 TraceCheckUtils]: 153: Hoare triple {9471#false} assume !(0bv32 == ~cond); {9471#false} is VALID [2018-11-23 09:56:42,854 INFO L273 TraceCheckUtils]: 154: Hoare triple {9471#false} assume true; {9471#false} is VALID [2018-11-23 09:56:42,854 INFO L268 TraceCheckUtils]: 155: Hoare quadruple {9471#false} {9471#false} #136#return; {9471#false} is VALID [2018-11-23 09:56:42,855 INFO L273 TraceCheckUtils]: 156: Hoare triple {9471#false} havoc #t~mem10;havoc #t~mem9; {9471#false} is VALID [2018-11-23 09:56:42,855 INFO L273 TraceCheckUtils]: 157: Hoare triple {9471#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {9471#false} is VALID [2018-11-23 09:56:42,855 INFO L273 TraceCheckUtils]: 158: Hoare triple {9471#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9471#false} is VALID [2018-11-23 09:56:42,855 INFO L256 TraceCheckUtils]: 159: Hoare triple {9471#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {9471#false} is VALID [2018-11-23 09:56:42,855 INFO L273 TraceCheckUtils]: 160: Hoare triple {9471#false} ~cond := #in~cond; {9471#false} is VALID [2018-11-23 09:56:42,855 INFO L273 TraceCheckUtils]: 161: Hoare triple {9471#false} assume 0bv32 == ~cond; {9471#false} is VALID [2018-11-23 09:56:42,855 INFO L273 TraceCheckUtils]: 162: Hoare triple {9471#false} assume !false; {9471#false} is VALID [2018-11-23 09:56:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3155 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:56:42,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:56:54,187 INFO L273 TraceCheckUtils]: 162: Hoare triple {9471#false} assume !false; {9471#false} is VALID [2018-11-23 09:56:54,187 INFO L273 TraceCheckUtils]: 161: Hoare triple {9471#false} assume 0bv32 == ~cond; {9471#false} is VALID [2018-11-23 09:56:54,188 INFO L273 TraceCheckUtils]: 160: Hoare triple {9471#false} ~cond := #in~cond; {9471#false} is VALID [2018-11-23 09:56:54,188 INFO L256 TraceCheckUtils]: 159: Hoare triple {9471#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {9471#false} is VALID [2018-11-23 09:56:54,188 INFO L273 TraceCheckUtils]: 158: Hoare triple {9471#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9471#false} is VALID [2018-11-23 09:56:54,188 INFO L273 TraceCheckUtils]: 157: Hoare triple {9471#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {9471#false} is VALID [2018-11-23 09:56:54,189 INFO L273 TraceCheckUtils]: 156: Hoare triple {9471#false} havoc #t~mem10;havoc #t~mem9; {9471#false} is VALID [2018-11-23 09:56:54,189 INFO L268 TraceCheckUtils]: 155: Hoare quadruple {9470#true} {9471#false} #136#return; {9471#false} is VALID [2018-11-23 09:56:54,189 INFO L273 TraceCheckUtils]: 154: Hoare triple {9470#true} assume true; {9470#true} is VALID [2018-11-23 09:56:54,189 INFO L273 TraceCheckUtils]: 153: Hoare triple {9470#true} assume !(0bv32 == ~cond); {9470#true} is VALID [2018-11-23 09:56:54,189 INFO L273 TraceCheckUtils]: 152: Hoare triple {9470#true} ~cond := #in~cond; {9470#true} is VALID [2018-11-23 09:56:54,190 INFO L256 TraceCheckUtils]: 151: Hoare triple {9471#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {9470#true} is VALID [2018-11-23 09:56:54,190 INFO L273 TraceCheckUtils]: 150: Hoare triple {9471#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9471#false} is VALID [2018-11-23 09:56:54,190 INFO L273 TraceCheckUtils]: 149: Hoare triple {9471#false} ~x~0 := 0bv32; {9471#false} is VALID [2018-11-23 09:56:54,190 INFO L273 TraceCheckUtils]: 148: Hoare triple {9471#false} assume !~bvslt32(~x~0, ~i~0); {9471#false} is VALID [2018-11-23 09:56:54,190 INFO L273 TraceCheckUtils]: 147: Hoare triple {9471#false} ~x~0 := 0bv32; {9471#false} is VALID [2018-11-23 09:56:54,190 INFO L273 TraceCheckUtils]: 146: Hoare triple {9471#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9471#false} is VALID [2018-11-23 09:56:54,190 INFO L273 TraceCheckUtils]: 145: Hoare triple {10060#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {9471#false} is VALID [2018-11-23 09:56:54,192 INFO L273 TraceCheckUtils]: 144: Hoare triple {10064#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10060#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:56:54,192 INFO L273 TraceCheckUtils]: 143: Hoare triple {10064#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10064#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:54,192 INFO L273 TraceCheckUtils]: 142: Hoare triple {10071#(or (not (bvslt main_~k~0 (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10064#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:54,195 INFO L273 TraceCheckUtils]: 141: Hoare triple {10075#(or (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10071#(or (not (bvslt main_~k~0 (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,195 INFO L273 TraceCheckUtils]: 140: Hoare triple {10075#(or (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10075#(or (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,196 INFO L273 TraceCheckUtils]: 139: Hoare triple {10075#(or (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10075#(or (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,199 INFO L273 TraceCheckUtils]: 138: Hoare triple {10085#(or (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10075#(or (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,200 INFO L273 TraceCheckUtils]: 137: Hoare triple {10085#(or (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10085#(or (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,200 INFO L273 TraceCheckUtils]: 136: Hoare triple {10085#(or (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10085#(or (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,204 INFO L273 TraceCheckUtils]: 135: Hoare triple {10095#(or (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10085#(or (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,205 INFO L273 TraceCheckUtils]: 134: Hoare triple {10095#(or (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10095#(or (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,206 INFO L273 TraceCheckUtils]: 133: Hoare triple {10095#(or (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10095#(or (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,211 INFO L273 TraceCheckUtils]: 132: Hoare triple {10105#(or (not (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10095#(or (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,212 INFO L273 TraceCheckUtils]: 131: Hoare triple {10105#(or (not (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10105#(or (not (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,212 INFO L273 TraceCheckUtils]: 130: Hoare triple {10105#(or (not (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10105#(or (not (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,216 INFO L273 TraceCheckUtils]: 129: Hoare triple {10115#(or (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10105#(or (not (bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,216 INFO L273 TraceCheckUtils]: 128: Hoare triple {10115#(or (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10115#(or (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,217 INFO L273 TraceCheckUtils]: 127: Hoare triple {10115#(or (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10115#(or (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,220 INFO L273 TraceCheckUtils]: 126: Hoare triple {10125#(or (not (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10115#(or (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,221 INFO L273 TraceCheckUtils]: 125: Hoare triple {10125#(or (not (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10125#(or (not (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,221 INFO L273 TraceCheckUtils]: 124: Hoare triple {10125#(or (not (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10125#(or (not (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,225 INFO L273 TraceCheckUtils]: 123: Hoare triple {10135#(or (not (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10125#(or (not (bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,226 INFO L273 TraceCheckUtils]: 122: Hoare triple {10135#(or (not (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10135#(or (not (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,226 INFO L273 TraceCheckUtils]: 121: Hoare triple {10135#(or (not (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10135#(or (not (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,231 INFO L273 TraceCheckUtils]: 120: Hoare triple {10145#(or (not (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10135#(or (not (bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,231 INFO L273 TraceCheckUtils]: 119: Hoare triple {10145#(or (not (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10145#(or (not (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,232 INFO L273 TraceCheckUtils]: 118: Hoare triple {10145#(or (not (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10145#(or (not (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,236 INFO L273 TraceCheckUtils]: 117: Hoare triple {10155#(or (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10145#(or (not (bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,236 INFO L273 TraceCheckUtils]: 116: Hoare triple {10155#(or (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10155#(or (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,237 INFO L273 TraceCheckUtils]: 115: Hoare triple {10155#(or (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10155#(or (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,240 INFO L273 TraceCheckUtils]: 114: Hoare triple {10165#(or (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10155#(or (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,241 INFO L273 TraceCheckUtils]: 113: Hoare triple {10165#(or (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10165#(or (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,241 INFO L273 TraceCheckUtils]: 112: Hoare triple {10165#(or (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10165#(or (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,245 INFO L273 TraceCheckUtils]: 111: Hoare triple {10175#(or (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10165#(or (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,245 INFO L273 TraceCheckUtils]: 110: Hoare triple {10175#(or (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10175#(or (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,246 INFO L273 TraceCheckUtils]: 109: Hoare triple {10175#(or (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10175#(or (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,249 INFO L273 TraceCheckUtils]: 108: Hoare triple {10185#(or (not (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10175#(or (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,250 INFO L273 TraceCheckUtils]: 107: Hoare triple {10185#(or (not (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10185#(or (not (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,251 INFO L273 TraceCheckUtils]: 106: Hoare triple {10185#(or (not (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10185#(or (not (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,254 INFO L273 TraceCheckUtils]: 105: Hoare triple {10195#(or (not (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10185#(or (not (bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,255 INFO L273 TraceCheckUtils]: 104: Hoare triple {10195#(or (not (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10195#(or (not (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,255 INFO L273 TraceCheckUtils]: 103: Hoare triple {10195#(or (not (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10195#(or (not (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,259 INFO L273 TraceCheckUtils]: 102: Hoare triple {10205#(or (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10195#(or (not (bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,259 INFO L273 TraceCheckUtils]: 101: Hoare triple {10205#(or (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10205#(or (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,260 INFO L273 TraceCheckUtils]: 100: Hoare triple {10205#(or (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10205#(or (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,264 INFO L273 TraceCheckUtils]: 99: Hoare triple {10215#(or (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10205#(or (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,264 INFO L273 TraceCheckUtils]: 98: Hoare triple {10215#(or (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10215#(or (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,264 INFO L273 TraceCheckUtils]: 97: Hoare triple {10215#(or (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10215#(or (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,268 INFO L273 TraceCheckUtils]: 96: Hoare triple {10225#(or (not (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10215#(or (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,268 INFO L273 TraceCheckUtils]: 95: Hoare triple {10225#(or (not (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10225#(or (not (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,268 INFO L273 TraceCheckUtils]: 94: Hoare triple {10225#(or (not (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10225#(or (not (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,272 INFO L273 TraceCheckUtils]: 93: Hoare triple {10235#(or (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10225#(or (not (bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,272 INFO L273 TraceCheckUtils]: 92: Hoare triple {10235#(or (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10235#(or (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,273 INFO L273 TraceCheckUtils]: 91: Hoare triple {10235#(or (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10235#(or (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,276 INFO L273 TraceCheckUtils]: 90: Hoare triple {10245#(or (not (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10235#(or (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,276 INFO L273 TraceCheckUtils]: 89: Hoare triple {10245#(or (not (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10245#(or (not (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,277 INFO L273 TraceCheckUtils]: 88: Hoare triple {10245#(or (not (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10245#(or (not (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,280 INFO L273 TraceCheckUtils]: 87: Hoare triple {10255#(or (not (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10245#(or (not (bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,281 INFO L273 TraceCheckUtils]: 86: Hoare triple {10255#(or (not (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10255#(or (not (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,281 INFO L273 TraceCheckUtils]: 85: Hoare triple {10255#(or (not (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10255#(or (not (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,285 INFO L273 TraceCheckUtils]: 84: Hoare triple {10265#(or (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10255#(or (not (bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,285 INFO L273 TraceCheckUtils]: 83: Hoare triple {10265#(or (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10265#(or (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,285 INFO L273 TraceCheckUtils]: 82: Hoare triple {10265#(or (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10265#(or (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,289 INFO L273 TraceCheckUtils]: 81: Hoare triple {10275#(or (not (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10265#(or (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,290 INFO L273 TraceCheckUtils]: 80: Hoare triple {10275#(or (not (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10275#(or (not (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,290 INFO L273 TraceCheckUtils]: 79: Hoare triple {10275#(or (not (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10275#(or (not (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,294 INFO L273 TraceCheckUtils]: 78: Hoare triple {10285#(or (not (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10275#(or (not (bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,298 INFO L273 TraceCheckUtils]: 77: Hoare triple {10285#(or (not (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10285#(or (not (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,299 INFO L273 TraceCheckUtils]: 76: Hoare triple {10285#(or (not (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10285#(or (not (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,303 INFO L273 TraceCheckUtils]: 75: Hoare triple {10295#(or (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10285#(or (not (bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,303 INFO L273 TraceCheckUtils]: 74: Hoare triple {10295#(or (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10295#(or (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,303 INFO L273 TraceCheckUtils]: 73: Hoare triple {10295#(or (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10295#(or (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,307 INFO L273 TraceCheckUtils]: 72: Hoare triple {10305#(or (not (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10295#(or (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,307 INFO L273 TraceCheckUtils]: 71: Hoare triple {10305#(or (not (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10305#(or (not (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,331 INFO L273 TraceCheckUtils]: 70: Hoare triple {10305#(or (not (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10305#(or (not (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,350 INFO L273 TraceCheckUtils]: 69: Hoare triple {10315#(or (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10305#(or (not (bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,363 INFO L273 TraceCheckUtils]: 68: Hoare triple {10315#(or (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10315#(or (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,371 INFO L273 TraceCheckUtils]: 67: Hoare triple {10315#(or (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10315#(or (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,379 INFO L273 TraceCheckUtils]: 66: Hoare triple {10325#(or (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10315#(or (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,380 INFO L273 TraceCheckUtils]: 65: Hoare triple {10325#(or (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10325#(or (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,398 INFO L273 TraceCheckUtils]: 64: Hoare triple {10325#(or (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10325#(or (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,407 INFO L273 TraceCheckUtils]: 63: Hoare triple {10335#(or (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10325#(or (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,422 INFO L273 TraceCheckUtils]: 62: Hoare triple {10335#(or (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10335#(or (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,422 INFO L273 TraceCheckUtils]: 61: Hoare triple {10335#(or (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10335#(or (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,426 INFO L273 TraceCheckUtils]: 60: Hoare triple {10345#(or (not (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10335#(or (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,427 INFO L273 TraceCheckUtils]: 59: Hoare triple {10345#(or (not (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10345#(or (not (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,427 INFO L273 TraceCheckUtils]: 58: Hoare triple {10345#(or (not (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10345#(or (not (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,430 INFO L273 TraceCheckUtils]: 57: Hoare triple {10355#(or (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10345#(or (not (bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,431 INFO L273 TraceCheckUtils]: 56: Hoare triple {10355#(or (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10355#(or (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,431 INFO L273 TraceCheckUtils]: 55: Hoare triple {10355#(or (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10355#(or (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,435 INFO L273 TraceCheckUtils]: 54: Hoare triple {10365#(or (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10355#(or (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,436 INFO L273 TraceCheckUtils]: 53: Hoare triple {10365#(or (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10365#(or (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,436 INFO L273 TraceCheckUtils]: 52: Hoare triple {10365#(or (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10365#(or (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,441 INFO L273 TraceCheckUtils]: 51: Hoare triple {10375#(or (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10365#(or (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,441 INFO L273 TraceCheckUtils]: 50: Hoare triple {10375#(or (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10375#(or (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,442 INFO L273 TraceCheckUtils]: 49: Hoare triple {10375#(or (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10375#(or (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,446 INFO L273 TraceCheckUtils]: 48: Hoare triple {10385#(or (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10375#(or (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,447 INFO L273 TraceCheckUtils]: 47: Hoare triple {10385#(or (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10385#(or (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,447 INFO L273 TraceCheckUtils]: 46: Hoare triple {10385#(or (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10385#(or (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,461 INFO L273 TraceCheckUtils]: 45: Hoare triple {10395#(or (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10385#(or (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,462 INFO L273 TraceCheckUtils]: 44: Hoare triple {10395#(or (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10395#(or (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,462 INFO L273 TraceCheckUtils]: 43: Hoare triple {10395#(or (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10395#(or (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,466 INFO L273 TraceCheckUtils]: 42: Hoare triple {10405#(or (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10395#(or (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,466 INFO L273 TraceCheckUtils]: 41: Hoare triple {10405#(or (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10405#(or (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,467 INFO L273 TraceCheckUtils]: 40: Hoare triple {10405#(or (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10405#(or (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,471 INFO L273 TraceCheckUtils]: 39: Hoare triple {10415#(or (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10405#(or (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,472 INFO L273 TraceCheckUtils]: 38: Hoare triple {10415#(or (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10415#(or (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {10415#(or (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10415#(or (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,476 INFO L273 TraceCheckUtils]: 36: Hoare triple {10425#(or (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10415#(or (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,477 INFO L273 TraceCheckUtils]: 35: Hoare triple {10425#(or (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10425#(or (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,477 INFO L273 TraceCheckUtils]: 34: Hoare triple {10425#(or (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10425#(or (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,482 INFO L273 TraceCheckUtils]: 33: Hoare triple {10435#(or (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10425#(or (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {10435#(or (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10435#(or (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,483 INFO L273 TraceCheckUtils]: 31: Hoare triple {10435#(or (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10435#(or (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,486 INFO L273 TraceCheckUtils]: 30: Hoare triple {10445#(or (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10435#(or (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,487 INFO L273 TraceCheckUtils]: 29: Hoare triple {10445#(or (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10445#(or (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,487 INFO L273 TraceCheckUtils]: 28: Hoare triple {10445#(or (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10445#(or (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {10455#(or (not (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10445#(or (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,491 INFO L273 TraceCheckUtils]: 26: Hoare triple {10455#(or (not (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10455#(or (not (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,492 INFO L273 TraceCheckUtils]: 25: Hoare triple {10455#(or (not (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10455#(or (not (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,499 INFO L273 TraceCheckUtils]: 24: Hoare triple {10465#(or (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10455#(or (not (bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))) (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,499 INFO L273 TraceCheckUtils]: 23: Hoare triple {10465#(or (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10465#(or (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,499 INFO L273 TraceCheckUtils]: 22: Hoare triple {10465#(or (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10465#(or (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,503 INFO L273 TraceCheckUtils]: 21: Hoare triple {10475#(or (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10465#(or (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,504 INFO L273 TraceCheckUtils]: 20: Hoare triple {10475#(or (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10475#(or (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {10475#(or (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10475#(or (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,510 INFO L273 TraceCheckUtils]: 18: Hoare triple {10485#(or (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10475#(or (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,510 INFO L273 TraceCheckUtils]: 17: Hoare triple {10485#(or (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10485#(or (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,511 INFO L273 TraceCheckUtils]: 16: Hoare triple {10485#(or (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10485#(or (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,515 INFO L273 TraceCheckUtils]: 15: Hoare triple {10495#(or (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10485#(or (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {10495#(or (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10495#(or (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,516 INFO L273 TraceCheckUtils]: 13: Hoare triple {10495#(or (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10495#(or (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {10505#(or (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10495#(or (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {10505#(or (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10505#(or (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {10505#(or (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10505#(or (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {10515#(or (bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10505#(or (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,527 INFO L273 TraceCheckUtils]: 8: Hoare triple {10515#(or (bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10515#(or (bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {10515#(or (bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10515#(or (bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {10525#(or (not (bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv47 32)) (_ bv100000 32)))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {10515#(or (bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32)) (not (bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))))} is VALID [2018-11-23 09:56:54,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {9470#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {10525#(or (not (bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))) (bvslt (bvadd main_~i~0 (_ bv47 32)) (_ bv100000 32)))} is VALID [2018-11-23 09:56:54,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {9470#true} call #t~ret15 := main(); {9470#true} is VALID [2018-11-23 09:56:54,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9470#true} {9470#true} #130#return; {9470#true} is VALID [2018-11-23 09:56:54,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {9470#true} assume true; {9470#true} is VALID [2018-11-23 09:56:54,532 INFO L273 TraceCheckUtils]: 1: Hoare triple {9470#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {9470#true} is VALID [2018-11-23 09:56:54,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {9470#true} call ULTIMATE.init(); {9470#true} is VALID [2018-11-23 09:56:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3155 backedges. 2 proven. 3151 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:56:54,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:56:54,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 51] total 99 [2018-11-23 09:56:54,592 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 163 [2018-11-23 09:56:54,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:56:54,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states. [2018-11-23 09:56:55,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:56:55,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-11-23 09:56:55,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-23 09:56:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2453, Invalid=7249, Unknown=0, NotChecked=0, Total=9702 [2018-11-23 09:56:55,922 INFO L87 Difference]: Start difference. First operand 467 states and 619 transitions. Second operand 99 states. [2018-11-23 09:57:32,013 WARN L180 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 235 DAG size of output: 10 [2018-11-23 09:57:35,005 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 230 DAG size of output: 10 [2018-11-23 09:57:38,452 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 225 DAG size of output: 10 [2018-11-23 09:57:41,838 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 220 DAG size of output: 10 [2018-11-23 09:57:45,218 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 215 DAG size of output: 10 [2018-11-23 09:57:48,858 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 210 DAG size of output: 10 [2018-11-23 09:57:52,450 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 205 DAG size of output: 10 [2018-11-23 09:57:55,927 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 200 DAG size of output: 10 [2018-11-23 09:57:59,569 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 195 DAG size of output: 10 [2018-11-23 09:58:03,087 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 190 DAG size of output: 10 [2018-11-23 09:58:06,591 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 185 DAG size of output: 10 [2018-11-23 09:58:10,030 WARN L180 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 10 [2018-11-23 09:58:13,454 WARN L180 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 10 [2018-11-23 09:58:16,734 WARN L180 SmtUtils]: Spent 867.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 10 [2018-11-23 09:58:19,995 WARN L180 SmtUtils]: Spent 810.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 10 [2018-11-23 09:58:23,244 WARN L180 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 10 [2018-11-23 09:58:26,312 WARN L180 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 10