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_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:22,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:22,271 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:22,283 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:22,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:22,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:22,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:22,288 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:22,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:22,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:22,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:22,292 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:22,293 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:22,297 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:22,300 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:22,301 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:22,302 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:22,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:22,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:22,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:22,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:22,318 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:22,320 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:22,321 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:22,321 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:22,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:22,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:22,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:22,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:22,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:22,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:22,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:22,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:22,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:22,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:22,329 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:22,330 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 10:02:22,351 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:22,352 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:22,353 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:22,353 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:22,357 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:22,357 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:22,357 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:22,358 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:22,358 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:22,358 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:22,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:22,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:22,359 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:22,359 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:22,359 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:22,359 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:22,359 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:22,360 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:22,360 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:22,361 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:22,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:22,361 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:22,361 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:22,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:22,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:22,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:22,362 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:22,362 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:22,363 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:22,363 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:22,363 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:22,364 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:22,364 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:22,415 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:22,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:22,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:22,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:22,435 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:22,436 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_true-unreach-call_ground.i [2018-11-23 10:02:22,496 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07bb8c391/8f854ddb84ae4e40b7e5769f4b8e4fff/FLAG9b7f33ef8 [2018-11-23 10:02:23,023 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:23,023 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_true-unreach-call_ground.i [2018-11-23 10:02:23,029 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07bb8c391/8f854ddb84ae4e40b7e5769f4b8e4fff/FLAG9b7f33ef8 [2018-11-23 10:02:23,359 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07bb8c391/8f854ddb84ae4e40b7e5769f4b8e4fff [2018-11-23 10:02:23,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:23,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:23,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:23,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:23,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:23,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54afdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23, skipping insertion in model container [2018-11-23 10:02:23,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:23,424 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:23,656 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:23,661 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:23,713 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:23,753 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:23,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23 WrapperNode [2018-11-23 10:02:23,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:23,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:23,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:23,756 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:23,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:23,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:23,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:23,793 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:23,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (1/1) ... [2018-11-23 10:02:23,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:23,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:23,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:23,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:23,882 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (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 10:02:24,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:24,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:24,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:24,046 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:24,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:24,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:24,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:02:24,935 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:24,937 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 10:02:24,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:24 BoogieIcfgContainer [2018-11-23 10:02:24,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:24,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:24,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:24,943 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:24,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:23" (1/3) ... [2018-11-23 10:02:24,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fd26b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:24, skipping insertion in model container [2018-11-23 10:02:24,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:23" (2/3) ... [2018-11-23 10:02:24,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fd26b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:24, skipping insertion in model container [2018-11-23 10:02:24,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:24" (3/3) ... [2018-11-23 10:02:24,947 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_true-unreach-call_ground.i [2018-11-23 10:02:24,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:24,967 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:24,986 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:25,020 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:25,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:25,021 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:25,021 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:25,023 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:25,023 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:25,023 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:25,023 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:25,024 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 10:02:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:02:25,050 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:25,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:25,053 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:25,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1945224924, now seen corresponding path program 1 times [2018-11-23 10:02:25,064 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:25,064 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 10:02:25,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:25,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:25,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 10:02:25,221 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 10:02:25,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 10:02:25,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #130#return; {45#true} is VALID [2018-11-23 10:02:25,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret15 := main(); {45#true} is VALID [2018-11-23 10:02:25,223 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 10:02:25,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 10:02:25,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~x~0 := 0bv32; {46#false} is VALID [2018-11-23 10:02:25,225 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 10:02:25,225 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 10:02:25,225 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 10:02:25,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-23 10:02:25,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume 0bv32 == ~cond; {46#false} is VALID [2018-11-23 10:02:25,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 10:02:25,229 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 10:02:25,229 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:25,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:25,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:02:25,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:25,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:25,347 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 10:02:25,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:25,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:25,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:25,362 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 10:02:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:25,799 INFO L93 Difference]: Finished difference Result 78 states and 117 transitions. [2018-11-23 10:02:25,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:25,802 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:02:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 10:02:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:25,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 10:02:25,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-23 10:02:26,433 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 10:02:26,449 INFO L225 Difference]: With dead ends: 78 [2018-11-23 10:02:26,450 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:02:26,455 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 10:02:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:02:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 10:02:26,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:26,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:26,686 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:26,687 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:26,699 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 10:02:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 10:02:26,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:26,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:26,703 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:26,703 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 10:02:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:26,712 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 10:02:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 10:02:26,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:26,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:26,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:26,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 10:02:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 10:02:26,719 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 14 [2018-11-23 10:02:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:26,719 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 10:02:26,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 10:02:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:02:26,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:26,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:26,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:26,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1826279014, now seen corresponding path program 1 times [2018-11-23 10:02:26,723 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:26,723 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 10:02:26,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:26,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:26,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-23 10:02:26,852 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 10:02:26,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-23 10:02:26,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #130#return; {318#true} is VALID [2018-11-23 10:02:26,852 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret15 := main(); {318#true} is VALID [2018-11-23 10:02:26,853 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 10:02:26,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 10:02:26,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#false} ~x~0 := 0bv32; {319#false} is VALID [2018-11-23 10:02:26,854 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 10:02:26,855 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 10:02:26,855 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 10:02:26,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#false} ~cond := #in~cond; {319#false} is VALID [2018-11-23 10:02:26,856 INFO L273 TraceCheckUtils]: 12: Hoare triple {319#false} assume 0bv32 == ~cond; {319#false} is VALID [2018-11-23 10:02:26,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-23 10:02:26,858 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 10:02:26,858 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:26,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:26,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:26,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:02:26,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:26,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:26,902 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 10:02:26,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:26,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:26,903 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 3 states. [2018-11-23 10:02:27,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:27,417 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 10:02:27,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:27,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:02:27,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 10:02:27,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:27,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 10:02:27,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 10:02:27,714 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 10:02:27,718 INFO L225 Difference]: With dead ends: 68 [2018-11-23 10:02:27,718 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 10:02:27,720 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 10:02:27,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 10:02:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-11-23 10:02:27,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:27,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 38 states. [2018-11-23 10:02:27,745 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 38 states. [2018-11-23 10:02:27,745 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 38 states. [2018-11-23 10:02:27,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:27,752 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 10:02:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 10:02:27,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:27,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:27,754 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 55 states. [2018-11-23 10:02:27,754 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 55 states. [2018-11-23 10:02:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:27,759 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 10:02:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 10:02:27,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:27,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:27,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:27,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 10:02:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-23 10:02:27,764 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 14 [2018-11-23 10:02:27,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:27,765 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-23 10:02:27,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:27,765 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-23 10:02:27,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:02:27,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:27,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:27,767 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:27,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:27,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1905148503, now seen corresponding path program 1 times [2018-11-23 10:02:27,768 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:27,768 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 10:02:27,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:27,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:27,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2018-11-23 10:02:27,914 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 10:02:27,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2018-11-23 10:02:27,915 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #130#return; {620#true} is VALID [2018-11-23 10:02:27,915 INFO L256 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret15 := main(); {620#true} is VALID [2018-11-23 10:02:27,915 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 10:02:27,916 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 10:02:27,920 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 10:02:27,921 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 10:02:27,921 INFO L273 TraceCheckUtils]: 9: Hoare triple {621#false} ~x~0 := 0bv32; {621#false} is VALID [2018-11-23 10:02:27,922 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 10:02:27,922 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 10:02:27,922 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 10:02:27,923 INFO L273 TraceCheckUtils]: 13: Hoare triple {621#false} ~cond := #in~cond; {621#false} is VALID [2018-11-23 10:02:27,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#false} assume 0bv32 == ~cond; {621#false} is VALID [2018-11-23 10:02:27,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {621#false} assume !false; {621#false} is VALID [2018-11-23 10:02:27,926 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 10:02:27,926 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:02:27,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:27,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:27,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:02:27,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:27,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:27,967 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 10:02:27,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:27,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:27,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:27,969 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 3 states. [2018-11-23 10:02:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:28,285 INFO L93 Difference]: Finished difference Result 86 states and 114 transitions. [2018-11-23 10:02:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:28,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:02:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 10:02:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2018-11-23 10:02:28,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2018-11-23 10:02:28,500 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 10:02:28,503 INFO L225 Difference]: With dead ends: 86 [2018-11-23 10:02:28,504 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 10:02:28,504 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 10:02:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 10:02:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2018-11-23 10:02:28,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:28,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 42 states. [2018-11-23 10:02:28,545 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 42 states. [2018-11-23 10:02:28,545 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 42 states. [2018-11-23 10:02:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:28,549 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 10:02:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 10:02:28,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:28,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:28,551 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 55 states. [2018-11-23 10:02:28,551 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 55 states. [2018-11-23 10:02:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:28,555 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-23 10:02:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-23 10:02:28,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:28,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:28,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:28,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 10:02:28,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-11-23 10:02:28,560 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 16 [2018-11-23 10:02:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:28,560 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2018-11-23 10:02:28,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2018-11-23 10:02:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:02:28,562 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:28,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:28,562 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:28,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:28,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1580472167, now seen corresponding path program 1 times [2018-11-23 10:02:28,563 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:28,563 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 10:02:28,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:28,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:28,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {958#true} call ULTIMATE.init(); {958#true} is VALID [2018-11-23 10:02:28,693 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 10:02:28,694 INFO L273 TraceCheckUtils]: 2: Hoare triple {958#true} assume true; {958#true} is VALID [2018-11-23 10:02:28,694 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {958#true} {958#true} #130#return; {958#true} is VALID [2018-11-23 10:02:28,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {958#true} call #t~ret15 := main(); {958#true} is VALID [2018-11-23 10:02:28,696 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 10:02:28,696 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 10:02:28,701 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 10:02:28,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#false} assume !(~s~0 != ~i~0); {959#false} is VALID [2018-11-23 10:02:28,702 INFO L273 TraceCheckUtils]: 9: Hoare triple {959#false} ~x~0 := 0bv32; {959#false} is VALID [2018-11-23 10:02:28,702 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 10:02:28,702 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 10:02:28,702 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 10:02:28,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {959#false} ~cond := #in~cond; {959#false} is VALID [2018-11-23 10:02:28,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {959#false} assume 0bv32 == ~cond; {959#false} is VALID [2018-11-23 10:02:28,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {959#false} assume !false; {959#false} is VALID [2018-11-23 10:02:28,704 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 10:02:28,704 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:28,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:28,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:02:28,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 10:02:28,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:28,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:02:28,728 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 10:02:28,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:02:28,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:02:28,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:02:28,729 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 4 states. [2018-11-23 10:02:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:29,266 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2018-11-23 10:02:29,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:02:29,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 10:02:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:02:29,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 10:02:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:02:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 10:02:29,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2018-11-23 10:02:29,506 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 10:02:29,509 INFO L225 Difference]: With dead ends: 102 [2018-11-23 10:02:29,509 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 10:02:29,510 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 10:02:29,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 10:02:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-23 10:02:29,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:29,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 43 states. [2018-11-23 10:02:29,563 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 43 states. [2018-11-23 10:02:29,563 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 43 states. [2018-11-23 10:02:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:29,567 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 10:02:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 10:02:29,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:29,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:29,569 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 67 states. [2018-11-23 10:02:29,569 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 67 states. [2018-11-23 10:02:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:29,573 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 10:02:29,574 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 10:02:29,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:29,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:29,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:29,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 10:02:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2018-11-23 10:02:29,578 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2018-11-23 10:02:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:29,578 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2018-11-23 10:02:29,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:02:29,579 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2018-11-23 10:02:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:02:29,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:29,580 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 10:02:29,580 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:29,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1505214684, now seen corresponding path program 1 times [2018-11-23 10:02:29,581 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:29,581 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 10:02:29,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:29,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:29,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1345#true} is VALID [2018-11-23 10:02:29,750 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 10:02:29,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-23 10:02:29,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #130#return; {1345#true} is VALID [2018-11-23 10:02:29,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret15 := main(); {1345#true} is VALID [2018-11-23 10:02:29,754 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 10:02:29,755 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 10:02:29,755 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 10:02:29,756 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 10:02:29,756 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 10:02:29,757 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 10:02:29,757 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 10:02:29,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {1346#false} ~x~0 := 0bv32; {1346#false} is VALID [2018-11-23 10:02:29,758 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 10:02:29,758 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 10:02:29,759 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 10:02:29,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {1346#false} ~cond := #in~cond; {1346#false} is VALID [2018-11-23 10:02:29,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {1346#false} assume 0bv32 == ~cond; {1346#false} is VALID [2018-11-23 10:02:29,760 INFO L273 TraceCheckUtils]: 18: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2018-11-23 10:02:29,761 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 10:02:29,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:29,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {1346#false} assume !false; {1346#false} is VALID [2018-11-23 10:02:29,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {1346#false} assume 0bv32 == ~cond; {1346#false} is VALID [2018-11-23 10:02:29,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {1346#false} ~cond := #in~cond; {1346#false} is VALID [2018-11-23 10:02:29,839 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 10:02:29,839 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 10:02:29,840 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 10:02:29,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {1346#false} ~x~0 := 0bv32; {1346#false} is VALID [2018-11-23 10:02:29,840 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 10:02:29,842 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 10:02:29,843 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 10:02:29,845 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 10:02:29,846 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 10:02:29,850 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 10:02:29,851 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 10:02:29,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {1345#true} call #t~ret15 := main(); {1345#true} is VALID [2018-11-23 10:02:29,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1345#true} {1345#true} #130#return; {1345#true} is VALID [2018-11-23 10:02:29,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {1345#true} assume true; {1345#true} is VALID [2018-11-23 10:02:29,852 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 10:02:29,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {1345#true} call ULTIMATE.init(); {1345#true} is VALID [2018-11-23 10:02:29,854 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 10:02:29,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:29,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 10:02:29,856 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 10:02:29,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:29,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:02:29,906 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 10:02:29,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:02:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:02:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:02:29,907 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 8 states. [2018-11-23 10:02:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:31,198 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2018-11-23 10:02:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 10:02:31,198 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 10:02:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:02:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2018-11-23 10:02:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:02:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2018-11-23 10:02:31,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 173 transitions. [2018-11-23 10:02:31,531 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 10:02:31,535 INFO L225 Difference]: With dead ends: 151 [2018-11-23 10:02:31,535 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 10:02:31,536 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 10:02:31,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 10:02:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 88. [2018-11-23 10:02:31,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:31,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand 88 states. [2018-11-23 10:02:31,595 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 88 states. [2018-11-23 10:02:31,595 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 88 states. [2018-11-23 10:02:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:31,601 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2018-11-23 10:02:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2018-11-23 10:02:31,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:31,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:31,602 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 116 states. [2018-11-23 10:02:31,603 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 116 states. [2018-11-23 10:02:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:31,610 INFO L93 Difference]: Finished difference Result 116 states and 157 transitions. [2018-11-23 10:02:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 157 transitions. [2018-11-23 10:02:31,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:31,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:31,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:31,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 10:02:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2018-11-23 10:02:31,615 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 19 [2018-11-23 10:02:31,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:31,616 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2018-11-23 10:02:31,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:02:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2018-11-23 10:02:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 10:02:31,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:31,617 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 10:02:31,618 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:31,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:31,618 INFO L82 PathProgramCache]: Analyzing trace with hash 965884393, now seen corresponding path program 2 times [2018-11-23 10:02:31,619 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:31,619 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 10:02:31,641 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:31,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:02:31,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:31,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:31,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {2041#true} call ULTIMATE.init(); {2041#true} is VALID [2018-11-23 10:02:31,785 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 10:02:31,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {2041#true} assume true; {2041#true} is VALID [2018-11-23 10:02:31,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2041#true} {2041#true} #130#return; {2041#true} is VALID [2018-11-23 10:02:31,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {2041#true} call #t~ret15 := main(); {2041#true} is VALID [2018-11-23 10:02:31,787 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 10:02:31,788 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 10:02:31,793 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 10:02:31,793 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 10:02:31,795 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 10:02:31,795 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 10:02:31,796 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 10:02:31,796 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 10:02:31,797 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 10:02:31,798 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 10:02:31,798 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 10:02:31,799 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 10:02:31,800 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 10:02:31,801 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 10:02:31,801 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 10:02:31,802 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 10:02:31,803 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 10:02:31,804 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 10:02:31,804 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 10:02:31,805 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 10:02:31,805 INFO L273 TraceCheckUtils]: 25: Hoare triple {2042#false} ~cond := #in~cond; {2042#false} is VALID [2018-11-23 10:02:31,806 INFO L273 TraceCheckUtils]: 26: Hoare triple {2042#false} assume 0bv32 == ~cond; {2042#false} is VALID [2018-11-23 10:02:31,806 INFO L273 TraceCheckUtils]: 27: Hoare triple {2042#false} assume !false; {2042#false} is VALID [2018-11-23 10:02:31,809 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 10:02:31,809 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:31,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:31,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:02:31,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 10:02:31,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:31,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:02:31,873 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 10:02:31,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:02:31,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:02:31,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:02:31,874 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand 4 states. [2018-11-23 10:02:32,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,191 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2018-11-23 10:02:32,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:02:32,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 10:02:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:32,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:02:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2018-11-23 10:02:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:02:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2018-11-23 10:02:32,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 113 transitions. [2018-11-23 10:02:32,431 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 10:02:32,433 INFO L225 Difference]: With dead ends: 141 [2018-11-23 10:02:32,433 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 10:02:32,434 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 10:02:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 10:02:32,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2018-11-23 10:02:32,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:32,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 84 states. [2018-11-23 10:02:32,563 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 84 states. [2018-11-23 10:02:32,563 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 84 states. [2018-11-23 10:02:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,568 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2018-11-23 10:02:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2018-11-23 10:02:32,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,569 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 87 states. [2018-11-23 10:02:32,570 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 87 states. [2018-11-23 10:02:32,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,574 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2018-11-23 10:02:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2018-11-23 10:02:32,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:32,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 10:02:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2018-11-23 10:02:32,579 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 28 [2018-11-23 10:02:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:32,579 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2018-11-23 10:02:32,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:02:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2018-11-23 10:02:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:02:32,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:32,580 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 10:02:32,581 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:32,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:32,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1605949511, now seen corresponding path program 1 times [2018-11-23 10:02:32,581 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:32,582 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 10:02:32,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:02:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:32,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {2617#true} call ULTIMATE.init(); {2617#true} is VALID [2018-11-23 10:02:32,836 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 10:02:32,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {2617#true} assume true; {2617#true} is VALID [2018-11-23 10:02:32,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2617#true} {2617#true} #130#return; {2617#true} is VALID [2018-11-23 10:02:32,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {2617#true} call #t~ret15 := main(); {2617#true} is VALID [2018-11-23 10:02:32,839 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 10:02:32,845 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 10:02:32,845 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 10:02:32,846 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 10:02:32,846 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 10:02:32,847 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 10:02:32,847 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 10:02:32,848 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 10:02:32,849 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 10:02:32,849 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 10:02:32,850 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 10:02:32,851 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 10:02:32,852 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 10:02:32,853 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 10:02:32,855 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 10:02:32,855 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 10:02:32,855 INFO L273 TraceCheckUtils]: 21: Hoare triple {2618#false} ~x~0 := 0bv32; {2618#false} is VALID [2018-11-23 10:02:32,856 INFO L273 TraceCheckUtils]: 22: Hoare triple {2618#false} assume !~bvslt32(~x~0, ~i~0); {2618#false} is VALID [2018-11-23 10:02:32,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {2618#false} ~x~0 := ~i~0; {2618#false} is VALID [2018-11-23 10:02:32,857 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 10:02:32,857 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 10:02:32,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {2618#false} ~cond := #in~cond; {2618#false} is VALID [2018-11-23 10:02:32,858 INFO L273 TraceCheckUtils]: 27: Hoare triple {2618#false} assume 0bv32 == ~cond; {2618#false} is VALID [2018-11-23 10:02:32,858 INFO L273 TraceCheckUtils]: 28: Hoare triple {2618#false} assume !false; {2618#false} is VALID [2018-11-23 10:02:32,860 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 10:02:32,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:33,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {2618#false} assume !false; {2618#false} is VALID [2018-11-23 10:02:33,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {2618#false} assume 0bv32 == ~cond; {2618#false} is VALID [2018-11-23 10:02:33,084 INFO L273 TraceCheckUtils]: 26: Hoare triple {2618#false} ~cond := #in~cond; {2618#false} is VALID [2018-11-23 10:02:33,084 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 10:02:33,085 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 10:02:33,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {2618#false} ~x~0 := ~i~0; {2618#false} is VALID [2018-11-23 10:02:33,085 INFO L273 TraceCheckUtils]: 22: Hoare triple {2618#false} assume !~bvslt32(~x~0, ~i~0); {2618#false} is VALID [2018-11-23 10:02:33,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {2618#false} ~x~0 := 0bv32; {2618#false} is VALID [2018-11-23 10:02:33,086 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 10:02:33,086 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 10:02:33,087 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 10:02:33,087 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 10:02:33,088 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 10:02:33,093 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 10:02:33,093 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 10:02:33,094 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 10:02:33,101 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 10:02:33,101 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 10:02:33,102 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 10:02:33,108 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 10:02:33,109 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 10:02:33,109 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 10:02:33,116 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 10:02:33,117 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 10:02:33,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {2617#true} call #t~ret15 := main(); {2617#true} is VALID [2018-11-23 10:02:33,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2617#true} {2617#true} #130#return; {2617#true} is VALID [2018-11-23 10:02:33,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {2617#true} assume true; {2617#true} is VALID [2018-11-23 10:02:33,118 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 10:02:33,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {2617#true} call ULTIMATE.init(); {2617#true} is VALID [2018-11-23 10:02:33,120 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 10:02:33,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:33,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:02:33,122 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 10:02:33,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:33,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:02:33,208 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 10:02:33,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:02:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:02:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:02:33,209 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand 14 states. [2018-11-23 10:02:35,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,941 INFO L93 Difference]: Finished difference Result 219 states and 310 transitions. [2018-11-23 10:02:35,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 10:02:35,941 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 10:02:35,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:35,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:02:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 205 transitions. [2018-11-23 10:02:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:02:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 205 transitions. [2018-11-23 10:02:35,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 205 transitions. [2018-11-23 10:02:36,418 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 10:02:36,422 INFO L225 Difference]: With dead ends: 219 [2018-11-23 10:02:36,422 INFO L226 Difference]: Without dead ends: 166 [2018-11-23 10:02:36,423 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 10:02:36,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-23 10:02:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 138. [2018-11-23 10:02:36,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:36,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 138 states. [2018-11-23 10:02:36,517 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 138 states. [2018-11-23 10:02:36,517 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 138 states. [2018-11-23 10:02:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,524 INFO L93 Difference]: Finished difference Result 166 states and 222 transitions. [2018-11-23 10:02:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2018-11-23 10:02:36,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,525 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 166 states. [2018-11-23 10:02:36,525 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 166 states. [2018-11-23 10:02:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,531 INFO L93 Difference]: Finished difference Result 166 states and 222 transitions. [2018-11-23 10:02:36,531 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2018-11-23 10:02:36,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:36,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 10:02:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2018-11-23 10:02:36,538 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 29 [2018-11-23 10:02:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:36,538 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2018-11-23 10:02:36,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:02:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2018-11-23 10:02:36,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 10:02:36,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:36,540 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 10:02:36,540 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:36,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1339551065, now seen corresponding path program 2 times [2018-11-23 10:02:36,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:36,541 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 10:02:36,570 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:36,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:02:36,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:36,840 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 10:02:36,962 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 10:02:36,980 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 10:02:37,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:02:37,126 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 10:02:37,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 10:02:37,148 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 10:02:37,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:02:37,154 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 10:02:37,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:7 [2018-11-23 10:02:37,263 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 10:02:37,268 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 10:02:37,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:02:37,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:02:37,279 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 10:02:37,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 10:02:37,283 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:02:37,284 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 10:02:37,284 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem10| |main_#t~mem9|) [2018-11-23 10:02:37,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {3657#true} call ULTIMATE.init(); {3657#true} is VALID [2018-11-23 10:02:37,497 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 10:02:37,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {3657#true} assume true; {3657#true} is VALID [2018-11-23 10:02:37,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3657#true} {3657#true} #130#return; {3657#true} is VALID [2018-11-23 10:02:37,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {3657#true} call #t~ret15 := main(); {3657#true} is VALID [2018-11-23 10:02:37,502 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 10:02:37,503 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 10:02:37,507 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 10:02:37,508 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 10:02:37,508 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 10:02:37,509 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 10:02:37,509 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 10:02:37,510 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 10:02:37,510 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 10:02:37,511 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 10:02:37,512 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 10:02:37,513 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 10:02:37,514 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 10:02:37,514 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 10:02:37,522 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 10:02:37,523 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 10:02:37,523 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 10:02:37,524 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 10:02:37,524 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 10:02:37,525 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 10:02:37,526 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 10:02:37,526 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 10:02:37,527 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 10:02:37,528 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 10:02:37,529 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 10:02:37,530 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 10:02:37,531 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 10:02:37,531 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 10:02:37,532 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 10:02:37,533 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 10:02:37,534 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 10:02:37,534 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 10:02:37,535 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 10:02:37,536 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 10:02:37,537 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 10:02:37,538 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 10:02:37,539 INFO L273 TraceCheckUtils]: 41: Hoare triple {3677#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~x~0 := ~i~0; {3786#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~x~0 main_~i~0))} is VALID [2018-11-23 10:02:37,541 INFO L273 TraceCheckUtils]: 42: Hoare triple {3786#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~x~0 main_~i~0))} 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 10:02:37,542 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 10:02:37,542 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 10:02:37,555 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 10:02:37,555 INFO L273 TraceCheckUtils]: 46: Hoare triple {3658#false} assume !false; {3658#false} is VALID [2018-11-23 10:02:37,560 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 10:02:37,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:37,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:37,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 10:02:37,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 10:02:37,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:37,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 10:02:37,673 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 10:02:37,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 10:02:37,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 10:02:37,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:37,674 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand 7 states. [2018-11-23 10:02:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:38,622 INFO L93 Difference]: Finished difference Result 147 states and 191 transitions. [2018-11-23 10:02:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:02:38,622 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 10:02:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 10:02:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 10:02:38,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 10:02:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 75 transitions. [2018-11-23 10:02:38,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 75 transitions. [2018-11-23 10:02:39,252 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 10:02:39,255 INFO L225 Difference]: With dead ends: 147 [2018-11-23 10:02:39,255 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 10:02:39,256 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 10:02:39,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 10:02:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-11-23 10:02:39,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:39,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 143 states. [2018-11-23 10:02:39,464 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 143 states. [2018-11-23 10:02:39,464 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 143 states. [2018-11-23 10:02:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,469 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2018-11-23 10:02:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2018-11-23 10:02:39,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,470 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 145 states. [2018-11-23 10:02:39,470 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 145 states. [2018-11-23 10:02:39,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,476 INFO L93 Difference]: Finished difference Result 145 states and 189 transitions. [2018-11-23 10:02:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2018-11-23 10:02:39,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:39,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:39,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:39,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-23 10:02:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2018-11-23 10:02:39,482 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 47 [2018-11-23 10:02:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:39,483 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2018-11-23 10:02:39,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 10:02:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2018-11-23 10:02:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 10:02:39,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:39,484 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 10:02:39,485 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:39,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash -186475156, now seen corresponding path program 1 times [2018-11-23 10:02:39,485 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:39,486 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 10:02:39,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:02:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:39,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:40,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {4496#true} call ULTIMATE.init(); {4496#true} is VALID [2018-11-23 10:02:40,383 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 10:02:40,383 INFO L273 TraceCheckUtils]: 2: Hoare triple {4496#true} assume true; {4496#true} is VALID [2018-11-23 10:02:40,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4496#true} {4496#true} #130#return; {4496#true} is VALID [2018-11-23 10:02:40,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {4496#true} call #t~ret15 := main(); {4496#true} is VALID [2018-11-23 10:02:40,384 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 10:02:40,385 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 10:02:40,386 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 10:02:40,386 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 10:02:40,387 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 10:02:40,387 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 10:02:40,387 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 10:02:40,388 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 10:02:40,388 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 10:02:40,389 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 10:02:40,389 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 10:02:40,400 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 10:02:40,401 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 10:02:40,401 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 10:02:40,402 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 10:02:40,402 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 10:02:40,403 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 10:02:40,404 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 10:02:40,407 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 10:02:40,410 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 10:02:40,412 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 10:02:40,412 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 10:02:40,412 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 10:02:40,413 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 10:02:40,413 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 10:02:40,414 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 10:02:40,414 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 10:02:40,414 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 10:02:40,415 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 10:02:40,416 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 10:02:40,417 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 10:02:40,417 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 10:02:40,418 INFO L273 TraceCheckUtils]: 37: Hoare triple {4620#(= (_ bv11 32) main_~k~0)} assume !~bvslt32(~k~0, 100000bv32); {4497#false} is VALID [2018-11-23 10:02:40,418 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 10:02:40,419 INFO L273 TraceCheckUtils]: 39: Hoare triple {4497#false} ~x~0 := 0bv32; {4497#false} is VALID [2018-11-23 10:02:40,419 INFO L273 TraceCheckUtils]: 40: Hoare triple {4497#false} assume !~bvslt32(~x~0, ~i~0); {4497#false} is VALID [2018-11-23 10:02:40,419 INFO L273 TraceCheckUtils]: 41: Hoare triple {4497#false} ~x~0 := ~i~0; {4497#false} is VALID [2018-11-23 10:02:40,419 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 10:02:40,420 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 10:02:40,420 INFO L273 TraceCheckUtils]: 44: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2018-11-23 10:02:40,420 INFO L273 TraceCheckUtils]: 45: Hoare triple {4497#false} assume !(0bv32 == ~cond); {4497#false} is VALID [2018-11-23 10:02:40,421 INFO L273 TraceCheckUtils]: 46: Hoare triple {4497#false} assume true; {4497#false} is VALID [2018-11-23 10:02:40,421 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4497#false} {4497#false} #136#return; {4497#false} is VALID [2018-11-23 10:02:40,421 INFO L273 TraceCheckUtils]: 48: Hoare triple {4497#false} havoc #t~mem9;havoc #t~mem10; {4497#false} is VALID [2018-11-23 10:02:40,421 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 10:02:40,421 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 10:02:40,422 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 10:02:40,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2018-11-23 10:02:40,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {4497#false} assume 0bv32 == ~cond; {4497#false} is VALID [2018-11-23 10:02:40,422 INFO L273 TraceCheckUtils]: 54: Hoare triple {4497#false} assume !false; {4497#false} is VALID [2018-11-23 10:02:40,425 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 10:02:40,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:41,101 INFO L273 TraceCheckUtils]: 54: Hoare triple {4497#false} assume !false; {4497#false} is VALID [2018-11-23 10:02:41,102 INFO L273 TraceCheckUtils]: 53: Hoare triple {4497#false} assume 0bv32 == ~cond; {4497#false} is VALID [2018-11-23 10:02:41,102 INFO L273 TraceCheckUtils]: 52: Hoare triple {4497#false} ~cond := #in~cond; {4497#false} is VALID [2018-11-23 10:02:41,102 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 10:02:41,102 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 10:02:41,102 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 10:02:41,102 INFO L273 TraceCheckUtils]: 48: Hoare triple {4497#false} havoc #t~mem9;havoc #t~mem10; {4497#false} is VALID [2018-11-23 10:02:41,102 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4496#true} {4497#false} #136#return; {4497#false} is VALID [2018-11-23 10:02:41,103 INFO L273 TraceCheckUtils]: 46: Hoare triple {4496#true} assume true; {4496#true} is VALID [2018-11-23 10:02:41,103 INFO L273 TraceCheckUtils]: 45: Hoare triple {4496#true} assume !(0bv32 == ~cond); {4496#true} is VALID [2018-11-23 10:02:41,103 INFO L273 TraceCheckUtils]: 44: Hoare triple {4496#true} ~cond := #in~cond; {4496#true} is VALID [2018-11-23 10:02:41,103 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 10:02:41,103 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 10:02:41,103 INFO L273 TraceCheckUtils]: 41: Hoare triple {4497#false} ~x~0 := ~i~0; {4497#false} is VALID [2018-11-23 10:02:41,104 INFO L273 TraceCheckUtils]: 40: Hoare triple {4497#false} assume !~bvslt32(~x~0, ~i~0); {4497#false} is VALID [2018-11-23 10:02:41,104 INFO L273 TraceCheckUtils]: 39: Hoare triple {4497#false} ~x~0 := 0bv32; {4497#false} is VALID [2018-11-23 10:02:41,104 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 10:02:41,104 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 10:02:41,106 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 10:02:41,109 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 10:02:41,109 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 10:02:41,115 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 10:02:41,116 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 10:02:41,116 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 10:02:41,123 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 10:02:41,124 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 10:02:41,126 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 10:02:41,133 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 10:02:41,134 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 10:02:41,140 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 10:02:41,146 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 10:02:41,147 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 10:02:41,147 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 10:02:41,153 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 10:02:41,153 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 10:02:41,154 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 10:02:41,159 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 10:02:41,159 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 10:02:41,159 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 10:02:41,164 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 10:02:41,164 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 10:02:41,165 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 10:02:41,170 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 10:02:41,170 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 10:02:41,171 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 10:02:41,176 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 10:02:41,177 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 10:02:41,177 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 10:02:41,183 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 10:02:41,183 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 10:02:41,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {4496#true} call #t~ret15 := main(); {4496#true} is VALID [2018-11-23 10:02:41,184 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4496#true} {4496#true} #130#return; {4496#true} is VALID [2018-11-23 10:02:41,184 INFO L273 TraceCheckUtils]: 2: Hoare triple {4496#true} assume true; {4496#true} is VALID [2018-11-23 10:02:41,184 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 10:02:41,184 INFO L256 TraceCheckUtils]: 0: Hoare triple {4496#true} call ULTIMATE.init(); {4496#true} is VALID [2018-11-23 10:02:41,187 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 10:02:41,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:41,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 10:02:41,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-11-23 10:02:41,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:41,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 10:02:41,386 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 10:02:41,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 10:02:41,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 10:02:41,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2018-11-23 10:02:41,387 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand 26 states. [2018-11-23 10:02:50,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:50,169 INFO L93 Difference]: Finished difference Result 355 states and 506 transitions. [2018-11-23 10:02:50,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 10:02:50,169 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-11-23 10:02:50,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:02:50,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 286 transitions. [2018-11-23 10:02:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:02:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 286 transitions. [2018-11-23 10:02:50,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 286 transitions. [2018-11-23 10:02:50,756 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 10:02:50,763 INFO L225 Difference]: With dead ends: 355 [2018-11-23 10:02:50,764 INFO L226 Difference]: Without dead ends: 279 [2018-11-23 10:02:50,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=974, Invalid=2448, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 10:02:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-23 10:02:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 251. [2018-11-23 10:02:51,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:51,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand 251 states. [2018-11-23 10:02:51,089 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand 251 states. [2018-11-23 10:02:51,089 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 251 states. [2018-11-23 10:02:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:51,100 INFO L93 Difference]: Finished difference Result 279 states and 371 transitions. [2018-11-23 10:02:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 371 transitions. [2018-11-23 10:02:51,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:51,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:51,102 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand 279 states. [2018-11-23 10:02:51,102 INFO L87 Difference]: Start difference. First operand 251 states. Second operand 279 states. [2018-11-23 10:02:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:51,113 INFO L93 Difference]: Finished difference Result 279 states and 371 transitions. [2018-11-23 10:02:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 371 transitions. [2018-11-23 10:02:51,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:51,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:51,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:51,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-23 10:02:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 331 transitions. [2018-11-23 10:02:51,123 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 331 transitions. Word has length 55 [2018-11-23 10:02:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:51,124 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 331 transitions. [2018-11-23 10:02:51,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 10:02:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 331 transitions. [2018-11-23 10:02:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 10:02:51,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:51,125 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 10:02:51,126 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:51,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:51,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1991798956, now seen corresponding path program 2 times [2018-11-23 10:02:51,127 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:51,127 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 10:02:51,154 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:51,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:51,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:51,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:52,044 INFO L256 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6299#true} is VALID [2018-11-23 10:02:52,044 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 10:02:52,044 INFO L273 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-23 10:02:52,045 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #130#return; {6299#true} is VALID [2018-11-23 10:02:52,045 INFO L256 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret15 := main(); {6299#true} is VALID [2018-11-23 10:02:52,046 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 10:02:52,046 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 10:02:52,047 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 10:02:52,047 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 10:02:52,047 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 10:02:52,048 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 10:02:52,054 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 10:02:52,055 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 10:02:52,055 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 10:02:52,055 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 10:02:52,056 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 10:02:52,056 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 10:02:52,057 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 10:02:52,057 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 10:02:52,058 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 10:02:52,058 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 10:02:52,059 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 10:02:52,059 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 10:02:52,060 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 10:02:52,060 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 10:02:52,061 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 10:02:52,062 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 10:02:52,062 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 10:02:52,063 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 10:02:52,063 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 10:02:52,064 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 10:02:52,065 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 10:02:52,065 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 10:02:52,066 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 10:02:52,067 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 10:02:52,067 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 10:02:52,068 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 10:02:52,069 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 10:02:52,069 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 10:02:52,070 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 10:02:52,070 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 10:02:52,074 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 10:02:52,074 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 10:02:52,077 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 10:02:52,077 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 10:02:52,078 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 10:02:52,078 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 10:02:52,078 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 10:02:52,079 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 10:02:52,079 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 10:02:52,079 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 10:02:52,080 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 10:02:52,080 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 10:02:52,080 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 10:02:52,081 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 10:02:52,081 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 10:02:52,082 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 10:02:52,082 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 10:02:52,083 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 10:02:52,084 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 10:02:52,084 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 10:02:52,085 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 10:02:52,085 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 10:02:52,086 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 10:02:52,087 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 10:02:52,087 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 10:02:52,088 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 10:02:52,088 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 10:02:52,089 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 10:02:52,090 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 10:02:52,090 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 10:02:52,091 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 10:02:52,092 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 10:02:52,092 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 10:02:52,092 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 10:02:52,093 INFO L273 TraceCheckUtils]: 75: Hoare triple {6300#false} ~x~0 := 0bv32; {6300#false} is VALID [2018-11-23 10:02:52,093 INFO L273 TraceCheckUtils]: 76: Hoare triple {6300#false} assume !~bvslt32(~x~0, ~i~0); {6300#false} is VALID [2018-11-23 10:02:52,093 INFO L273 TraceCheckUtils]: 77: Hoare triple {6300#false} ~x~0 := ~i~0; {6300#false} is VALID [2018-11-23 10:02:52,093 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 10:02:52,094 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 10:02:52,094 INFO L273 TraceCheckUtils]: 80: Hoare triple {6300#false} ~cond := #in~cond; {6300#false} is VALID [2018-11-23 10:02:52,094 INFO L273 TraceCheckUtils]: 81: Hoare triple {6300#false} assume !(0bv32 == ~cond); {6300#false} is VALID [2018-11-23 10:02:52,094 INFO L273 TraceCheckUtils]: 82: Hoare triple {6300#false} assume true; {6300#false} is VALID [2018-11-23 10:02:52,095 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {6300#false} {6300#false} #136#return; {6300#false} is VALID [2018-11-23 10:02:52,095 INFO L273 TraceCheckUtils]: 84: Hoare triple {6300#false} havoc #t~mem9;havoc #t~mem10; {6300#false} is VALID [2018-11-23 10:02:52,095 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 10:02:52,095 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 10:02:52,096 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 10:02:52,096 INFO L273 TraceCheckUtils]: 88: Hoare triple {6300#false} ~cond := #in~cond; {6300#false} is VALID [2018-11-23 10:02:52,096 INFO L273 TraceCheckUtils]: 89: Hoare triple {6300#false} assume 0bv32 == ~cond; {6300#false} is VALID [2018-11-23 10:02:52,097 INFO L273 TraceCheckUtils]: 90: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2018-11-23 10:02:52,104 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 10:02:52,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:53,876 INFO L273 TraceCheckUtils]: 90: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2018-11-23 10:02:53,876 INFO L273 TraceCheckUtils]: 89: Hoare triple {6300#false} assume 0bv32 == ~cond; {6300#false} is VALID [2018-11-23 10:02:53,877 INFO L273 TraceCheckUtils]: 88: Hoare triple {6300#false} ~cond := #in~cond; {6300#false} is VALID [2018-11-23 10:02:53,877 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 10:02:53,877 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 10:02:53,877 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 10:02:53,878 INFO L273 TraceCheckUtils]: 84: Hoare triple {6300#false} havoc #t~mem9;havoc #t~mem10; {6300#false} is VALID [2018-11-23 10:02:53,878 INFO L268 TraceCheckUtils]: 83: Hoare quadruple {6299#true} {6300#false} #136#return; {6300#false} is VALID [2018-11-23 10:02:53,878 INFO L273 TraceCheckUtils]: 82: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-23 10:02:53,878 INFO L273 TraceCheckUtils]: 81: Hoare triple {6299#true} assume !(0bv32 == ~cond); {6299#true} is VALID [2018-11-23 10:02:53,879 INFO L273 TraceCheckUtils]: 80: Hoare triple {6299#true} ~cond := #in~cond; {6299#true} is VALID [2018-11-23 10:02:53,879 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 10:02:53,879 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 10:02:53,879 INFO L273 TraceCheckUtils]: 77: Hoare triple {6300#false} ~x~0 := ~i~0; {6300#false} is VALID [2018-11-23 10:02:53,879 INFO L273 TraceCheckUtils]: 76: Hoare triple {6300#false} assume !~bvslt32(~x~0, ~i~0); {6300#false} is VALID [2018-11-23 10:02:53,879 INFO L273 TraceCheckUtils]: 75: Hoare triple {6300#false} ~x~0 := 0bv32; {6300#false} is VALID [2018-11-23 10:02:53,880 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 10:02:53,880 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 10:02:53,881 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 10:02:53,882 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 10:02:53,882 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 10:02:53,888 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 10:02:53,889 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 10:02:53,889 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 10:02:53,895 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 10:02:53,896 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 10:02:53,896 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 10:02:53,904 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 10:02:53,905 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 10:02:53,906 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 10:02:53,913 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 10:02:53,913 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 10:02:53,914 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 10:02:53,919 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 10:02:53,919 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 10:02:53,920 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 10:02:53,926 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 10:02:53,926 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 10:02:53,927 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 10:02:53,934 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 10:02:53,934 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 10:02:53,935 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 10:02:53,940 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 10:02:53,940 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 10:02:53,941 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 10:02:53,947 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 10:02:53,948 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 10:02:53,948 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 10:02:53,955 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 10:02:53,955 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 10:02:53,955 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 10:02:53,960 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 10:02:53,960 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 10:02:53,961 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 10:02:53,965 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 10:02:53,966 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 10:02:53,967 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 10:02:53,971 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 10:02:53,972 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 10:02:53,972 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 10:02:53,978 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 10:02:53,979 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 10:02:53,979 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 10:02:53,984 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 10:02:53,984 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 10:02:53,985 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 10:02:53,988 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 10:02:53,989 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 10:02:53,989 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 10:02:53,994 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 10:02:53,995 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 10:02:53,995 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 10:02:54,001 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 10:02:54,002 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 10:02:54,002 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 10:02:54,007 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 10:02:54,007 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 10:02:54,008 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 10:02:54,018 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 10:02:54,019 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 10:02:54,032 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 10:02:54,040 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 10:02:54,041 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 10:02:54,041 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 10:02:54,047 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 10:02:54,048 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 10:02:54,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret15 := main(); {6299#true} is VALID [2018-11-23 10:02:54,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #130#return; {6299#true} is VALID [2018-11-23 10:02:54,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2018-11-23 10:02:54,050 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 10:02:54,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6299#true} is VALID [2018-11-23 10:02:54,067 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 10:02:54,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:54,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-23 10:02:54,075 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 91 [2018-11-23 10:02:54,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:54,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 10:02:54,529 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 10:02:54,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 10:02:54,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 10:02:54,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1823, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 10:02:54,531 INFO L87 Difference]: Start difference. First operand 251 states and 331 transitions. Second operand 50 states. [2018-11-23 10:03:04,905 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 10 [2018-11-23 10:03:05,460 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 10 [2018-11-23 10:03:06,056 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2018-11-23 10:03:06,762 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 10 [2018-11-23 10:03:07,411 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 10 [2018-11-23 10:03:08,075 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 10 [2018-11-23 10:03:08,745 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 10 [2018-11-23 10:03:09,419 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2018-11-23 10:03:10,103 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 10 [2018-11-23 10:03:18,547 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2018-11-23 10:03:19,624 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 11 [2018-11-23 10:03:20,514 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 11 [2018-11-23 10:03:21,342 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 11 [2018-11-23 10:03:22,210 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 11 [2018-11-23 10:03:23,108 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 11 [2018-11-23 10:03:24,025 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 11 [2018-11-23 10:03:24,951 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 11 [2018-11-23 10:03:25,927 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 11 [2018-11-23 10:03:26,865 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 11 [2018-11-23 10:03:27,796 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 11 [2018-11-23 10:03:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:36,025 INFO L93 Difference]: Finished difference Result 607 states and 878 transitions. [2018-11-23 10:03:36,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-23 10:03:36,025 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 91 [2018-11-23 10:03:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:03:36,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 10:03:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 448 transitions. [2018-11-23 10:03:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 10:03:36,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 448 transitions. [2018-11-23 10:03:36,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 448 transitions. [2018-11-23 10:03:37,617 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 10:03:37,633 INFO L225 Difference]: With dead ends: 607 [2018-11-23 10:03:37,633 INFO L226 Difference]: Without dead ends: 495 [2018-11-23 10:03:37,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2369 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=3824, Invalid=10218, Unknown=0, NotChecked=0, Total=14042 [2018-11-23 10:03:37,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-11-23 10:03:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 467. [2018-11-23 10:03:38,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:03:38,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 495 states. Second operand 467 states. [2018-11-23 10:03:38,234 INFO L74 IsIncluded]: Start isIncluded. First operand 495 states. Second operand 467 states. [2018-11-23 10:03:38,234 INFO L87 Difference]: Start difference. First operand 495 states. Second operand 467 states. [2018-11-23 10:03:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:38,252 INFO L93 Difference]: Finished difference Result 495 states and 659 transitions. [2018-11-23 10:03:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 659 transitions. [2018-11-23 10:03:38,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:38,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:38,254 INFO L74 IsIncluded]: Start isIncluded. First operand 467 states. Second operand 495 states. [2018-11-23 10:03:38,254 INFO L87 Difference]: Start difference. First operand 467 states. Second operand 495 states. [2018-11-23 10:03:38,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:38,272 INFO L93 Difference]: Finished difference Result 495 states and 659 transitions. [2018-11-23 10:03:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 659 transitions. [2018-11-23 10:03:38,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:38,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:38,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:03:38,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:03:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-11-23 10:03:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 619 transitions. [2018-11-23 10:03:38,292 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 619 transitions. Word has length 91 [2018-11-23 10:03:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:03:38,292 INFO L480 AbstractCegarLoop]: Abstraction has 467 states and 619 transitions. [2018-11-23 10:03:38,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 10:03:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 619 transitions. [2018-11-23 10:03:38,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-23 10:03:38,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:03:38,295 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 10:03:38,296 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:03:38,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:03:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash -158714068, now seen corresponding path program 3 times [2018-11-23 10:03:38,297 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:03:38,297 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 10:03:38,326 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:04:08,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-11-23 10:04:08,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:04:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:04:08,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:04:10,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {9470#true} call ULTIMATE.init(); {9470#true} is VALID [2018-11-23 10:04:10,834 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 10:04:10,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {9470#true} assume true; {9470#true} is VALID [2018-11-23 10:04:10,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9470#true} {9470#true} #130#return; {9470#true} is VALID [2018-11-23 10:04:10,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {9470#true} call #t~ret15 := main(); {9470#true} is VALID [2018-11-23 10:04:10,836 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 10:04:10,836 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 10:04:10,837 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 10:04:10,837 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 10:04:10,837 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 10:04:10,838 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 10:04:10,838 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 10:04:10,839 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 10:04:10,839 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 10:04:10,839 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 10:04:10,840 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 10:04:10,841 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 10:04:10,841 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 10:04:10,842 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 10:04:10,843 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 10:04:10,843 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 10:04:10,844 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 10:04:10,845 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 10:04:10,845 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 10:04:10,846 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 10:04:10,846 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 10:04:10,847 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 10:04:10,848 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 10:04:10,848 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 10:04:10,849 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 10:04:10,849 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 10:04:10,850 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 10:04:10,850 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 10:04:10,851 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 10:04:10,852 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 10:04:10,852 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 10:04:10,853 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 10:04:10,854 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 10:04:10,854 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 10:04:10,855 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 10:04:10,855 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 10:04:10,856 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 10:04:10,857 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 10:04:10,857 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 10:04:10,858 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 10:04:10,859 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 10:04:10,859 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 10:04:10,860 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 10:04:10,861 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 10:04:10,861 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 10:04:10,862 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 10:04:10,863 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 10:04:10,863 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 10:04:10,864 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 10:04:10,865 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 10:04:10,865 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 10:04:10,866 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 10:04:10,867 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 10:04:10,867 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 10:04:10,868 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 10:04:10,869 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 10:04:10,869 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 10:04:10,870 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 10:04:10,870 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 10:04:10,871 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 10:04:10,871 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 10:04:10,872 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 10:04:10,873 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 10:04:10,873 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 10:04:10,874 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 10:04:10,875 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 10:04:10,875 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 10:04:10,876 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 10:04:10,876 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 10:04:10,877 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 10:04:10,878 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 10:04:10,878 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 10:04:10,879 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 10:04:10,880 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 10:04:10,880 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 10:04:10,881 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 10:04:10,882 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 10:04:10,882 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 10:04:10,883 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 10:04:10,883 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 10:04:10,884 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 10:04:10,885 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 10:04:10,885 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 10:04:10,886 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 10:04:10,886 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 10:04:10,887 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 10:04:10,888 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 10:04:10,888 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 10:04:10,889 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 10:04:10,889 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 10:04:10,890 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 10:04:10,891 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 10:04:10,896 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 10:04:10,897 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 10:04:10,897 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 10:04:10,898 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 10:04:10,898 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 10:04:10,898 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 10:04:10,899 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 10:04:10,899 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 10:04:10,899 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 10:04:10,900 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 10:04:10,901 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 10:04:10,901 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 10:04:10,902 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 10:04:10,902 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 10:04:10,903 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 10:04:10,904 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 10:04:10,904 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 10:04:10,905 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 10:04:10,906 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 10:04:10,906 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 10:04:10,907 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 10:04:10,907 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 10:04:10,908 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 10:04:10,909 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 10:04:10,909 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 10:04:10,910 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 10:04:10,910 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 10:04:10,911 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 10:04:10,911 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 10:04:10,912 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 10:04:10,913 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 10:04:10,913 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 10:04:10,914 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 10:04:10,914 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 10:04:10,915 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 10:04:10,916 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 10:04:10,916 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 10:04:10,917 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 10:04:10,918 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 10:04:10,918 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 10:04:10,919 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 10:04:10,920 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 10:04:10,920 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 10:04:10,941 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 10:04:10,944 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 10:04:10,944 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 10:04:10,944 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 10:04:10,945 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 10:04:10,945 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 10:04:10,945 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 10:04:10,946 INFO L273 TraceCheckUtils]: 147: Hoare triple {9471#false} ~x~0 := 0bv32; {9471#false} is VALID [2018-11-23 10:04:10,946 INFO L273 TraceCheckUtils]: 148: Hoare triple {9471#false} assume !~bvslt32(~x~0, ~i~0); {9471#false} is VALID [2018-11-23 10:04:10,946 INFO L273 TraceCheckUtils]: 149: Hoare triple {9471#false} ~x~0 := ~i~0; {9471#false} is VALID [2018-11-23 10:04:10,946 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 10:04:10,946 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 10:04:10,946 INFO L273 TraceCheckUtils]: 152: Hoare triple {9471#false} ~cond := #in~cond; {9471#false} is VALID [2018-11-23 10:04:10,946 INFO L273 TraceCheckUtils]: 153: Hoare triple {9471#false} assume !(0bv32 == ~cond); {9471#false} is VALID [2018-11-23 10:04:10,946 INFO L273 TraceCheckUtils]: 154: Hoare triple {9471#false} assume true; {9471#false} is VALID [2018-11-23 10:04:10,947 INFO L268 TraceCheckUtils]: 155: Hoare quadruple {9471#false} {9471#false} #136#return; {9471#false} is VALID [2018-11-23 10:04:10,947 INFO L273 TraceCheckUtils]: 156: Hoare triple {9471#false} havoc #t~mem9;havoc #t~mem10; {9471#false} is VALID [2018-11-23 10:04:10,947 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 10:04:10,947 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 10:04:10,947 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 10:04:10,947 INFO L273 TraceCheckUtils]: 160: Hoare triple {9471#false} ~cond := #in~cond; {9471#false} is VALID [2018-11-23 10:04:10,947 INFO L273 TraceCheckUtils]: 161: Hoare triple {9471#false} assume 0bv32 == ~cond; {9471#false} is VALID [2018-11-23 10:04:10,947 INFO L273 TraceCheckUtils]: 162: Hoare triple {9471#false} assume !false; {9471#false} is VALID [2018-11-23 10:04:10,984 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 10:04:10,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:04:22,618 INFO L273 TraceCheckUtils]: 162: Hoare triple {9471#false} assume !false; {9471#false} is VALID [2018-11-23 10:04:22,619 INFO L273 TraceCheckUtils]: 161: Hoare triple {9471#false} assume 0bv32 == ~cond; {9471#false} is VALID [2018-11-23 10:04:22,619 INFO L273 TraceCheckUtils]: 160: Hoare triple {9471#false} ~cond := #in~cond; {9471#false} is VALID [2018-11-23 10:04:22,619 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 10:04:22,619 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 10:04:22,619 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 10:04:22,619 INFO L273 TraceCheckUtils]: 156: Hoare triple {9471#false} havoc #t~mem9;havoc #t~mem10; {9471#false} is VALID [2018-11-23 10:04:22,620 INFO L268 TraceCheckUtils]: 155: Hoare quadruple {9470#true} {9471#false} #136#return; {9471#false} is VALID [2018-11-23 10:04:22,620 INFO L273 TraceCheckUtils]: 154: Hoare triple {9470#true} assume true; {9470#true} is VALID [2018-11-23 10:04:22,620 INFO L273 TraceCheckUtils]: 153: Hoare triple {9470#true} assume !(0bv32 == ~cond); {9470#true} is VALID [2018-11-23 10:04:22,620 INFO L273 TraceCheckUtils]: 152: Hoare triple {9470#true} ~cond := #in~cond; {9470#true} is VALID [2018-11-23 10:04:22,620 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 10:04:22,621 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 10:04:22,621 INFO L273 TraceCheckUtils]: 149: Hoare triple {9471#false} ~x~0 := ~i~0; {9471#false} is VALID [2018-11-23 10:04:22,621 INFO L273 TraceCheckUtils]: 148: Hoare triple {9471#false} assume !~bvslt32(~x~0, ~i~0); {9471#false} is VALID [2018-11-23 10:04:22,621 INFO L273 TraceCheckUtils]: 147: Hoare triple {9471#false} ~x~0 := 0bv32; {9471#false} is VALID [2018-11-23 10:04:22,621 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 10:04:22,622 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 10:04:22,623 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 10:04:22,624 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 10:04:22,624 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 10:04:22,628 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 10:04:22,628 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 10:04:22,629 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 10:04:22,633 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 10:04:22,634 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 10:04:22,634 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 10:04:22,639 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 10:04:22,640 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 10:04:22,640 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 10:04:22,645 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 10:04:22,646 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 10:04:22,646 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 10:04:22,651 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 10:04:22,651 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 10:04:22,652 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 10:04:22,656 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 10:04:22,657 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 10:04:22,657 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 10:04:22,661 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 10:04:22,662 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 10:04:22,662 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 10:04:22,667 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 10:04:22,667 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 10:04:22,668 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 10:04:22,672 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 10:04:22,673 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 10:04:22,673 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 10:04:22,677 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 10:04:22,678 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 10:04:22,678 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 10:04:22,683 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 10:04:22,684 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 10:04:22,684 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 10:04:22,688 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 10:04:22,689 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 10:04:22,689 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 10:04:22,694 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 10:04:22,694 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 10:04:22,695 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 10:04:22,699 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 10:04:22,700 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 10:04:22,700 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 10:04:22,704 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 10:04:22,705 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 10:04:22,705 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 10:04:22,710 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 10:04:22,711 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 10:04:22,711 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 10:04:22,715 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 10:04:22,716 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 10:04:22,716 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 10:04:22,720 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 10:04:22,721 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 10:04:22,721 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 10:04:22,725 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 10:04:22,726 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 10:04:22,726 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 10:04:22,730 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 10:04:22,731 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 10:04:22,731 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 10:04:22,735 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 10:04:22,735 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 10:04:22,736 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 10:04:22,741 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 10:04:22,742 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 10:04:22,742 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 10:04:22,746 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 10:04:22,747 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 10:04:22,747 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 10:04:22,752 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 10:04:22,752 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 10:04:22,772 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 10:04:22,787 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 10:04:22,802 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 10:04:22,811 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 10:04:22,827 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 10:04:22,829 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 10:04:22,848 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 10:04:22,864 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 10:04:22,868 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 10:04:22,869 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 10:04:22,873 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 10:04:22,874 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 10:04:22,874 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 10:04:22,879 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 10:04:22,879 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 10:04:22,880 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 10:04:22,884 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 10:04:22,885 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 10:04:22,885 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 10:04:22,890 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 10:04:22,891 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 10:04:22,891 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 10:04:22,896 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 10:04:22,896 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 10:04:22,897 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 10:04:22,910 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 10:04:22,911 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 10:04:22,911 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 10:04:22,916 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 10:04:22,916 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 10:04:22,917 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 10:04:22,922 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 10:04:22,923 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 10:04:22,924 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 10:04:22,929 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 10:04:22,929 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 10:04:22,930 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 10:04:22,935 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 10:04:22,936 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 10:04:22,936 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 10:04:22,940 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 10:04:22,941 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 10:04:22,941 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 10:04:22,946 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 10:04:22,946 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 10:04:22,947 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 10:04:22,954 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 10:04:22,955 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 10:04:22,955 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 10:04:22,960 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 10:04:22,961 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 10:04:22,961 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 10:04:22,968 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 10:04:22,969 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 10:04:22,969 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 10:04:22,974 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 10:04:22,975 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 10:04:22,975 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 10:04:22,981 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 10:04:22,981 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 10:04:22,982 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 10:04:22,986 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 10:04:22,987 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 10:04:22,987 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 10:04:22,992 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 10:04:22,993 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 10:04:22,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {9470#true} call #t~ret15 := main(); {9470#true} is VALID [2018-11-23 10:04:22,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9470#true} {9470#true} #130#return; {9470#true} is VALID [2018-11-23 10:04:22,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {9470#true} assume true; {9470#true} is VALID [2018-11-23 10:04:22,994 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 10:04:22,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {9470#true} call ULTIMATE.init(); {9470#true} is VALID [2018-11-23 10:04:23,050 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 10:04:23,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:04:23,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 51] total 99 [2018-11-23 10:04:23,057 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 163 [2018-11-23 10:04:23,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:04:23,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 99 states. [2018-11-23 10:04:24,439 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 10:04:24,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-11-23 10:04:24,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-11-23 10:04:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2453, Invalid=7249, Unknown=0, NotChecked=0, Total=9702 [2018-11-23 10:04:24,443 INFO L87 Difference]: Start difference. First operand 467 states and 619 transitions. Second operand 99 states. [2018-11-23 10:05:03,615 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 235 DAG size of output: 10 [2018-11-23 10:05:06,940 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 230 DAG size of output: 10 [2018-11-23 10:05:10,340 WARN L180 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 225 DAG size of output: 10 [2018-11-23 10:05:13,791 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 220 DAG size of output: 10 [2018-11-23 10:05:17,247 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 215 DAG size of output: 10 [2018-11-23 10:05:20,990 WARN L180 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 210 DAG size of output: 10 [2018-11-23 10:05:24,670 WARN L180 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 205 DAG size of output: 10 [2018-11-23 10:05:28,314 WARN L180 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 200 DAG size of output: 10 [2018-11-23 10:05:32,065 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 195 DAG size of output: 10 [2018-11-23 10:05:35,686 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 190 DAG size of output: 10 [2018-11-23 10:05:39,214 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 185 DAG size of output: 10 [2018-11-23 10:05:42,736 WARN L180 SmtUtils]: Spent 965.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 10 [2018-11-23 10:05:46,187 WARN L180 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 10 [2018-11-23 10:05:49,624 WARN L180 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 10 [2018-11-23 10:05:53,025 WARN L180 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 10 [2018-11-23 10:05:56,266 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 10