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/standard_maxInArray_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:09:23,919 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:09:23,921 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:09:23,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:09:23,939 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:09:23,941 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:09:23,943 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:09:23,945 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:09:23,951 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:09:23,952 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:09:23,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:09:23,955 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:09:23,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:09:23,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:09:23,961 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:09:23,966 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:09:23,967 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:09:23,969 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:09:23,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:09:23,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:09:23,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:09:23,980 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:09:23,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:09:23,986 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:09:23,986 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:09:23,987 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:09:23,988 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:09:23,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:09:23,993 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:09:23,996 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:09:23,996 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:09:23,997 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:09:23,997 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:09:23,998 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:09:24,000 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:09:24,001 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:09:24,003 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:09:24,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:09:24,032 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:09:24,032 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:09:24,033 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:09:24,033 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:09:24,034 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:09:24,034 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:09:24,034 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:09:24,034 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:09:24,034 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:09:24,035 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:09:24,035 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:09:24,035 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:09:24,035 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:09:24,035 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:09:24,036 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:09:24,036 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:09:24,036 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:09:24,036 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:09:24,036 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:09:24,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:09:24,037 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:09:24,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:09:24,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:09:24,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:09:24,038 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:09:24,038 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:09:24,038 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:09:24,038 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:09:24,038 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:09:24,039 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:09:24,039 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:09:24,039 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:09:24,085 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:09:24,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:09:24,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:09:24,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:09:24,109 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:09:24,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_maxInArray_true-unreach-call_ground.i [2018-11-23 10:09:24,179 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff412c29/d3ef7217c37d4e098b055cce53edef63/FLAG770596cdb [2018-11-23 10:09:24,634 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:09:24,635 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_maxInArray_true-unreach-call_ground.i [2018-11-23 10:09:24,640 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff412c29/d3ef7217c37d4e098b055cce53edef63/FLAG770596cdb [2018-11-23 10:09:24,997 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff412c29/d3ef7217c37d4e098b055cce53edef63 [2018-11-23 10:09:25,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:09:25,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:09:25,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:09:25,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:09:25,018 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:09:25,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:09:24" (1/1) ... [2018-11-23 10:09:25,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d13d574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25, skipping insertion in model container [2018-11-23 10:09:25,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:09:24" (1/1) ... [2018-11-23 10:09:25,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:09:25,060 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:09:25,311 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:09:25,318 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:09:25,347 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:09:25,383 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:09:25,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25 WrapperNode [2018-11-23 10:09:25,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:09:25,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:09:25,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:09:25,386 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:09:25,397 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:09:25" (1/1) ... [2018-11-23 10:09:25,410 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:09:25" (1/1) ... [2018-11-23 10:09:25,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:09:25,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:09:25,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:09:25,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:09:25,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25" (1/1) ... [2018-11-23 10:09:25,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25" (1/1) ... [2018-11-23 10:09:25,435 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25" (1/1) ... [2018-11-23 10:09:25,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25" (1/1) ... [2018-11-23 10:09:25,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25" (1/1) ... [2018-11-23 10:09:25,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25" (1/1) ... [2018-11-23 10:09:25,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25" (1/1) ... [2018-11-23 10:09:25,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:09:25,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:09:25,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:09:25,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:09:25,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25" (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:09:25,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:09:25,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:09:25,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:09:25,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:09:25,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:09:25,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:09:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:09:25,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:09:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:09:25,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:09:25,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:09:26,160 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:09:26,160 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:09:26,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:09:26 BoogieIcfgContainer [2018-11-23 10:09:26,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:09:26,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:09:26,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:09:26,166 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:09:26,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:09:24" (1/3) ... [2018-11-23 10:09:26,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc8e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:09:26, skipping insertion in model container [2018-11-23 10:09:26,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:09:25" (2/3) ... [2018-11-23 10:09:26,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc8e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:09:26, skipping insertion in model container [2018-11-23 10:09:26,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:09:26" (3/3) ... [2018-11-23 10:09:26,170 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_maxInArray_true-unreach-call_ground.i [2018-11-23 10:09:26,180 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:09:26,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:09:26,208 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:09:26,242 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:09:26,243 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:09:26,243 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:09:26,243 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:09:26,244 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:09:26,244 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:09:26,244 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:09:26,244 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:09:26,244 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:09:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 10:09:26,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:09:26,272 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:26,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:26,276 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:26,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1513105276, now seen corresponding path program 1 times [2018-11-23 10:09:26,288 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:26,288 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:09:26,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:09:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:26,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:26,437 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 10:09:26,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {28#true} is VALID [2018-11-23 10:09:26,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 10:09:26,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #55#return; {28#true} is VALID [2018-11-23 10:09:26,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret4 := main(); {28#true} is VALID [2018-11-23 10:09:26,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {28#true} is VALID [2018-11-23 10:09:26,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 10:09:26,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} havoc ~x~0;~x~0 := 0bv32; {29#false} is VALID [2018-11-23 10:09:26,445 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {29#false} is VALID [2018-11-23 10:09:26,445 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-23 10:09:26,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 10:09:26,446 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2018-11-23 10:09:26,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 10:09:26,449 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:09:26,449 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:09:26,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:09:26,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:09:26,460 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:09:26,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:26,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:09:26,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:26,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:09:26,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:09:26,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:09:26,587 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 10:09:26,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:26,934 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 10:09:26,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:09:26,934 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 10:09:26,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:09:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 10:09:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:09:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 10:09:26,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 10:09:27,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:27,166 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:09:27,166 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:09:27,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:09:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:09:27,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:09:27,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:27,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:09:27,235 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:09:27,235 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:09:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:27,239 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:09:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:09:27,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:27,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:27,241 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:09:27,241 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:09:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:27,244 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:09:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:09:27,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:27,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:27,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:27,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:09:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 10:09:27,251 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 10:09:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:27,251 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 10:09:27,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:09:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:09:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 10:09:27,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:27,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:27,253 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:27,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:27,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1609256121, now seen corresponding path program 1 times [2018-11-23 10:09:27,254 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:27,255 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:09:27,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:09:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:27,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:27,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {188#true} call ULTIMATE.init(); {188#true} is VALID [2018-11-23 10:09:27,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {188#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {188#true} is VALID [2018-11-23 10:09:27,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {188#true} assume true; {188#true} is VALID [2018-11-23 10:09:27,478 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} #55#return; {188#true} is VALID [2018-11-23 10:09:27,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {188#true} call #t~ret4 := main(); {188#true} is VALID [2018-11-23 10:09:27,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {208#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:27,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {208#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {189#false} is VALID [2018-11-23 10:09:27,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#false} havoc ~x~0;~x~0 := 0bv32; {189#false} is VALID [2018-11-23 10:09:27,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {189#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {189#false} is VALID [2018-11-23 10:09:27,483 INFO L256 TraceCheckUtils]: 9: Hoare triple {189#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {189#false} is VALID [2018-11-23 10:09:27,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {189#false} ~cond := #in~cond; {189#false} is VALID [2018-11-23 10:09:27,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {189#false} assume 0bv32 == ~cond; {189#false} is VALID [2018-11-23 10:09:27,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {189#false} assume !false; {189#false} is VALID [2018-11-23 10:09:27,485 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:09:27,485 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:09:27,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:09:27,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:09:27,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:09:27,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:27,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:09:27,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:27,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:09:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:09:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:09:27,543 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 10:09:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:27,761 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 10:09:27,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:09:27,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 10:09:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:09:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 10:09:27,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:09:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 10:09:27,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 10:09:28,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:28,023 INFO L225 Difference]: With dead ends: 34 [2018-11-23 10:09:28,023 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 10:09:28,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:09:28,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 10:09:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 10:09:28,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:28,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-23 10:09:28,156 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-23 10:09:28,156 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-23 10:09:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:28,159 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 10:09:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 10:09:28,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:28,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:28,161 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-23 10:09:28,161 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-23 10:09:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:28,164 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 10:09:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 10:09:28,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:28,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:28,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:28,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:09:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 10:09:28,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 10:09:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:28,168 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 10:09:28,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:09:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 10:09:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:09:28,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:28,169 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:09:28,170 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:28,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:28,170 INFO L82 PathProgramCache]: Analyzing trace with hash -30491421, now seen corresponding path program 1 times [2018-11-23 10:09:28,171 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:28,171 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:09:28,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:09:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:28,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:28,329 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 10:09:28,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {351#true} is VALID [2018-11-23 10:09:28,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 10:09:28,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #55#return; {351#true} is VALID [2018-11-23 10:09:28,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret4 := main(); {351#true} is VALID [2018-11-23 10:09:28,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {371#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:28,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {371#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {371#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:28,365 INFO L273 TraceCheckUtils]: 7: Hoare triple {371#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {371#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:28,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {371#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {381#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:28,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {381#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {352#false} is VALID [2018-11-23 10:09:28,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} havoc ~x~0;~x~0 := 0bv32; {352#false} is VALID [2018-11-23 10:09:28,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {352#false} is VALID [2018-11-23 10:09:28,374 INFO L256 TraceCheckUtils]: 12: Hoare triple {352#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {352#false} is VALID [2018-11-23 10:09:28,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 10:09:28,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} assume 0bv32 == ~cond; {352#false} is VALID [2018-11-23 10:09:28,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 10:09:28,376 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:09:28,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:28,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 10:09:28,506 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} assume 0bv32 == ~cond; {352#false} is VALID [2018-11-23 10:09:28,506 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 10:09:28,507 INFO L256 TraceCheckUtils]: 12: Hoare triple {352#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {352#false} is VALID [2018-11-23 10:09:28,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {352#false} is VALID [2018-11-23 10:09:28,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} havoc ~x~0;~x~0 := 0bv32; {352#false} is VALID [2018-11-23 10:09:28,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {421#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {352#false} is VALID [2018-11-23 10:09:28,510 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {421#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:09:28,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:28,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:28,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:28,518 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret4 := main(); {351#true} is VALID [2018-11-23 10:09:28,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #55#return; {351#true} is VALID [2018-11-23 10:09:28,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 10:09:28,519 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {351#true} is VALID [2018-11-23 10:09:28,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 10:09:28,521 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:09:28,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:09:28,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:09:28,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:09:28,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:28,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:09:28,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:28,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:09:28,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:09:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:09:28,567 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-11-23 10:09:28,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:28,991 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 10:09:28,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:09:28,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:09:28,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:09:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 10:09:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:09:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 10:09:29,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2018-11-23 10:09:29,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:29,183 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:09:29,183 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 10:09:29,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:09:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 10:09:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 10:09:29,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:29,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 10:09:29,209 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 10:09:29,209 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 10:09:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:29,214 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 10:09:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 10:09:29,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:29,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:29,216 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 10:09:29,216 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 10:09:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:29,219 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 10:09:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 10:09:29,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:29,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:29,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:29,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 10:09:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 10:09:29,222 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2018-11-23 10:09:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:29,223 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 10:09:29,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:09:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 10:09:29,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:09:29,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:29,224 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:29,225 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:29,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:29,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1113893945, now seen corresponding path program 2 times [2018-11-23 10:09:29,226 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:29,226 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:09:29,248 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:09:29,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:09:29,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:09:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:29,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:29,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {612#true} call ULTIMATE.init(); {612#true} is VALID [2018-11-23 10:09:29,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {612#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {612#true} is VALID [2018-11-23 10:09:29,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-23 10:09:29,545 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {612#true} {612#true} #55#return; {612#true} is VALID [2018-11-23 10:09:29,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {612#true} call #t~ret4 := main(); {612#true} is VALID [2018-11-23 10:09:29,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {612#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {632#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:29,549 INFO L273 TraceCheckUtils]: 6: Hoare triple {632#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {632#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:29,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {632#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {632#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:29,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {632#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:29,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:29,551 INFO L273 TraceCheckUtils]: 10: Hoare triple {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:29,552 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:29,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:29,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:29,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:29,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:29,556 INFO L273 TraceCheckUtils]: 16: Hoare triple {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:29,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {672#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:09:29,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {672#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {613#false} is VALID [2018-11-23 10:09:29,559 INFO L273 TraceCheckUtils]: 19: Hoare triple {613#false} havoc ~x~0;~x~0 := 0bv32; {613#false} is VALID [2018-11-23 10:09:29,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {613#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {613#false} is VALID [2018-11-23 10:09:29,560 INFO L256 TraceCheckUtils]: 21: Hoare triple {613#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {613#false} is VALID [2018-11-23 10:09:29,560 INFO L273 TraceCheckUtils]: 22: Hoare triple {613#false} ~cond := #in~cond; {613#false} is VALID [2018-11-23 10:09:29,561 INFO L273 TraceCheckUtils]: 23: Hoare triple {613#false} assume 0bv32 == ~cond; {613#false} is VALID [2018-11-23 10:09:29,561 INFO L273 TraceCheckUtils]: 24: Hoare triple {613#false} assume !false; {613#false} is VALID [2018-11-23 10:09:29,564 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:09:29,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:29,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {613#false} assume !false; {613#false} is VALID [2018-11-23 10:09:29,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {613#false} assume 0bv32 == ~cond; {613#false} is VALID [2018-11-23 10:09:29,763 INFO L273 TraceCheckUtils]: 22: Hoare triple {613#false} ~cond := #in~cond; {613#false} is VALID [2018-11-23 10:09:29,763 INFO L256 TraceCheckUtils]: 21: Hoare triple {613#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {613#false} is VALID [2018-11-23 10:09:29,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {613#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {613#false} is VALID [2018-11-23 10:09:29,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {613#false} havoc ~x~0;~x~0 := 0bv32; {613#false} is VALID [2018-11-23 10:09:29,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {712#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {613#false} is VALID [2018-11-23 10:09:29,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {712#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:09:29,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,775 INFO L273 TraceCheckUtils]: 13: Hoare triple {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,785 INFO L273 TraceCheckUtils]: 11: Hoare triple {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {612#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:29,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {612#true} call #t~ret4 := main(); {612#true} is VALID [2018-11-23 10:09:29,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {612#true} {612#true} #55#return; {612#true} is VALID [2018-11-23 10:09:29,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-23 10:09:29,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {612#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {612#true} is VALID [2018-11-23 10:09:29,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {612#true} call ULTIMATE.init(); {612#true} is VALID [2018-11-23 10:09:29,799 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:09:29,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:09:29,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:09:29,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 10:09:29,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:29,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:09:29,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:29,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:09:29,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:09:29,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:09:29,903 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 12 states. [2018-11-23 10:09:31,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:31,077 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-23 10:09:31,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:09:31,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 10:09:31,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:31,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:09:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 10:09:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:09:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 10:09:31,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 76 transitions. [2018-11-23 10:09:31,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:31,280 INFO L225 Difference]: With dead ends: 59 [2018-11-23 10:09:31,280 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 10:09:31,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:09:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 10:09:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 10:09:31,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:31,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 10:09:31,332 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 10:09:31,333 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 10:09:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:31,336 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 10:09:31,336 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 10:09:31,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:31,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:31,337 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 10:09:31,337 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 10:09:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:31,341 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 10:09:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 10:09:31,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:31,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:31,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:31,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:09:31,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-23 10:09:31,345 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 25 [2018-11-23 10:09:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:31,346 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 10:09:31,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:09:31,346 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 10:09:31,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 10:09:31,348 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:31,348 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:31,348 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:31,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:31,349 INFO L82 PathProgramCache]: Analyzing trace with hash 881632121, now seen corresponding path program 3 times [2018-11-23 10:09:31,350 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:31,350 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:09:31,370 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:09:31,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 10:09:31,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:09:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:31,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:32,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2018-11-23 10:09:32,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {1023#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1023#true} is VALID [2018-11-23 10:09:32,137 INFO L273 TraceCheckUtils]: 2: Hoare triple {1023#true} assume true; {1023#true} is VALID [2018-11-23 10:09:32,137 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1023#true} {1023#true} #55#return; {1023#true} is VALID [2018-11-23 10:09:32,138 INFO L256 TraceCheckUtils]: 4: Hoare triple {1023#true} call #t~ret4 := main(); {1023#true} is VALID [2018-11-23 10:09:32,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {1023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {1043#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:32,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {1043#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1043#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:32,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {1043#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1043#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:32,140 INFO L273 TraceCheckUtils]: 8: Hoare triple {1043#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,161 INFO L273 TraceCheckUtils]: 14: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,161 INFO L273 TraceCheckUtils]: 15: Hoare triple {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,164 INFO L273 TraceCheckUtils]: 18: Hoare triple {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,172 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,175 INFO L273 TraceCheckUtils]: 28: Hoare triple {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,176 INFO L273 TraceCheckUtils]: 29: Hoare triple {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1123#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:09:32,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {1123#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1123#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:09:32,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {1123#(= (_ bv8 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1123#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:09:32,179 INFO L273 TraceCheckUtils]: 32: Hoare triple {1123#(= (_ bv8 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,180 INFO L273 TraceCheckUtils]: 33: Hoare triple {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,180 INFO L273 TraceCheckUtils]: 34: Hoare triple {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,181 INFO L273 TraceCheckUtils]: 35: Hoare triple {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1143#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:32,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {1143#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1024#false} is VALID [2018-11-23 10:09:32,183 INFO L273 TraceCheckUtils]: 37: Hoare triple {1024#false} havoc ~x~0;~x~0 := 0bv32; {1024#false} is VALID [2018-11-23 10:09:32,183 INFO L273 TraceCheckUtils]: 38: Hoare triple {1024#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1024#false} is VALID [2018-11-23 10:09:32,183 INFO L256 TraceCheckUtils]: 39: Hoare triple {1024#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {1024#false} is VALID [2018-11-23 10:09:32,184 INFO L273 TraceCheckUtils]: 40: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2018-11-23 10:09:32,184 INFO L273 TraceCheckUtils]: 41: Hoare triple {1024#false} assume 0bv32 == ~cond; {1024#false} is VALID [2018-11-23 10:09:32,184 INFO L273 TraceCheckUtils]: 42: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2018-11-23 10:09:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:32,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:32,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2018-11-23 10:09:32,717 INFO L273 TraceCheckUtils]: 41: Hoare triple {1024#false} assume 0bv32 == ~cond; {1024#false} is VALID [2018-11-23 10:09:32,718 INFO L273 TraceCheckUtils]: 40: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2018-11-23 10:09:32,718 INFO L256 TraceCheckUtils]: 39: Hoare triple {1024#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {1024#false} is VALID [2018-11-23 10:09:32,719 INFO L273 TraceCheckUtils]: 38: Hoare triple {1024#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1024#false} is VALID [2018-11-23 10:09:32,719 INFO L273 TraceCheckUtils]: 37: Hoare triple {1024#false} havoc ~x~0;~x~0 := 0bv32; {1024#false} is VALID [2018-11-23 10:09:32,719 INFO L273 TraceCheckUtils]: 36: Hoare triple {1183#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1024#false} is VALID [2018-11-23 10:09:32,720 INFO L273 TraceCheckUtils]: 35: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1183#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:09:32,720 INFO L273 TraceCheckUtils]: 34: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,728 INFO L273 TraceCheckUtils]: 30: Hoare triple {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,735 INFO L273 TraceCheckUtils]: 29: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,736 INFO L273 TraceCheckUtils]: 28: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,744 INFO L273 TraceCheckUtils]: 25: Hoare triple {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,744 INFO L273 TraceCheckUtils]: 24: Hoare triple {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,751 INFO L273 TraceCheckUtils]: 23: Hoare triple {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,751 INFO L273 TraceCheckUtils]: 22: Hoare triple {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,756 INFO L273 TraceCheckUtils]: 20: Hoare triple {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,786 INFO L273 TraceCheckUtils]: 11: Hoare triple {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,794 INFO L273 TraceCheckUtils]: 6: Hoare triple {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,795 INFO L273 TraceCheckUtils]: 5: Hoare triple {1023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:32,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {1023#true} call #t~ret4 := main(); {1023#true} is VALID [2018-11-23 10:09:32,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1023#true} {1023#true} #55#return; {1023#true} is VALID [2018-11-23 10:09:32,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {1023#true} assume true; {1023#true} is VALID [2018-11-23 10:09:32,796 INFO L273 TraceCheckUtils]: 1: Hoare triple {1023#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1023#true} is VALID [2018-11-23 10:09:32,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2018-11-23 10:09:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:09:32,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:09:32,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:09:32,805 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-11-23 10:09:32,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:32,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:09:33,003 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:09:33,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:09:33,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:09:33,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:09:33,005 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 24 states. [2018-11-23 10:09:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:37,265 INFO L93 Difference]: Finished difference Result 95 states and 130 transitions. [2018-11-23 10:09:37,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:09:37,265 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-11-23 10:09:37,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:09:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:09:37,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2018-11-23 10:09:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:09:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2018-11-23 10:09:37,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 130 transitions. [2018-11-23 10:09:37,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:37,685 INFO L225 Difference]: With dead ends: 95 [2018-11-23 10:09:37,686 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 10:09:37,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:09:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 10:09:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-23 10:09:37,755 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:09:37,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2018-11-23 10:09:37,755 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 10:09:37,756 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 10:09:37,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:37,760 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-11-23 10:09:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 10:09:37,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:37,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:37,762 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 10:09:37,762 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 10:09:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:09:37,767 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-11-23 10:09:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 10:09:37,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:09:37,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:09:37,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:09:37,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:09:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 10:09:37,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2018-11-23 10:09:37,773 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 43 [2018-11-23 10:09:37,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:09:37,773 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2018-11-23 10:09:37,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:09:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 10:09:37,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 10:09:37,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:09:37,776 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:09:37,777 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:09:37,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:09:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1535812089, now seen corresponding path program 4 times [2018-11-23 10:09:37,778 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:09:37,778 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:09:37,804 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:09:37,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:09:37,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:09:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:09:38,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:09:38,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {1734#true} call ULTIMATE.init(); {1734#true} is VALID [2018-11-23 10:09:38,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {1734#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1734#true} is VALID [2018-11-23 10:09:38,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {1734#true} assume true; {1734#true} is VALID [2018-11-23 10:09:38,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1734#true} {1734#true} #55#return; {1734#true} is VALID [2018-11-23 10:09:38,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {1734#true} call #t~ret4 := main(); {1734#true} is VALID [2018-11-23 10:09:38,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {1734#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {1754#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:38,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {1754#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1754#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:38,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {1754#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1754#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:09:38,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {1754#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,688 INFO L273 TraceCheckUtils]: 9: Hoare triple {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,688 INFO L273 TraceCheckUtils]: 10: Hoare triple {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1774#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:09:38,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {1774#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1774#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:09:38,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {1774#(= (_ bv2 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1774#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:09:38,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {1774#(= (_ bv2 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,708 INFO L273 TraceCheckUtils]: 15: Hoare triple {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1794#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:09:38,732 INFO L273 TraceCheckUtils]: 18: Hoare triple {1794#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1794#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:09:38,732 INFO L273 TraceCheckUtils]: 19: Hoare triple {1794#(= (_ bv4 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1794#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:09:38,733 INFO L273 TraceCheckUtils]: 20: Hoare triple {1794#(= (_ bv4 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,736 INFO L273 TraceCheckUtils]: 24: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,736 INFO L273 TraceCheckUtils]: 25: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,737 INFO L273 TraceCheckUtils]: 26: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,738 INFO L273 TraceCheckUtils]: 27: Hoare triple {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,739 INFO L273 TraceCheckUtils]: 28: Hoare triple {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,740 INFO L273 TraceCheckUtils]: 29: Hoare triple {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,744 INFO L273 TraceCheckUtils]: 31: Hoare triple {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1844#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:09:38,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {1844#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1844#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:09:38,746 INFO L273 TraceCheckUtils]: 34: Hoare triple {1844#(= (_ bv9 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1844#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:09:38,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {1844#(= (_ bv9 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,747 INFO L273 TraceCheckUtils]: 36: Hoare triple {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,757 INFO L273 TraceCheckUtils]: 38: Hoare triple {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,757 INFO L273 TraceCheckUtils]: 39: Hoare triple {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,758 INFO L273 TraceCheckUtils]: 40: Hoare triple {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,758 INFO L273 TraceCheckUtils]: 41: Hoare triple {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,759 INFO L273 TraceCheckUtils]: 42: Hoare triple {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,759 INFO L273 TraceCheckUtils]: 43: Hoare triple {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,759 INFO L273 TraceCheckUtils]: 44: Hoare triple {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1884#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 10:09:38,760 INFO L273 TraceCheckUtils]: 45: Hoare triple {1884#(= (_ bv13 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1884#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 10:09:38,760 INFO L273 TraceCheckUtils]: 46: Hoare triple {1884#(= (_ bv13 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1884#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 10:09:38,761 INFO L273 TraceCheckUtils]: 47: Hoare triple {1884#(= (_ bv13 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,762 INFO L273 TraceCheckUtils]: 48: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,762 INFO L273 TraceCheckUtils]: 49: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,763 INFO L273 TraceCheckUtils]: 50: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1904#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:09:38,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {1904#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1904#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:09:38,765 INFO L273 TraceCheckUtils]: 52: Hoare triple {1904#(= (_ bv15 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1904#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:09:38,765 INFO L273 TraceCheckUtils]: 53: Hoare triple {1904#(= (_ bv15 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,766 INFO L273 TraceCheckUtils]: 54: Hoare triple {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,769 INFO L273 TraceCheckUtils]: 55: Hoare triple {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,770 INFO L273 TraceCheckUtils]: 56: Hoare triple {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,770 INFO L273 TraceCheckUtils]: 57: Hoare triple {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,771 INFO L273 TraceCheckUtils]: 58: Hoare triple {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,780 INFO L273 TraceCheckUtils]: 60: Hoare triple {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,785 INFO L273 TraceCheckUtils]: 61: Hoare triple {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,787 INFO L273 TraceCheckUtils]: 62: Hoare triple {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1944#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:09:38,787 INFO L273 TraceCheckUtils]: 63: Hoare triple {1944#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1944#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:09:38,788 INFO L273 TraceCheckUtils]: 64: Hoare triple {1944#(= (_ bv19 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1944#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:09:38,788 INFO L273 TraceCheckUtils]: 65: Hoare triple {1944#(= (_ bv19 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,788 INFO L273 TraceCheckUtils]: 66: Hoare triple {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,789 INFO L273 TraceCheckUtils]: 67: Hoare triple {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,789 INFO L273 TraceCheckUtils]: 68: Hoare triple {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,790 INFO L273 TraceCheckUtils]: 69: Hoare triple {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,790 INFO L273 TraceCheckUtils]: 70: Hoare triple {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,791 INFO L273 TraceCheckUtils]: 71: Hoare triple {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1974#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:09:38,792 INFO L273 TraceCheckUtils]: 72: Hoare triple {1974#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1735#false} is VALID [2018-11-23 10:09:38,792 INFO L273 TraceCheckUtils]: 73: Hoare triple {1735#false} havoc ~x~0;~x~0 := 0bv32; {1735#false} is VALID [2018-11-23 10:09:38,792 INFO L273 TraceCheckUtils]: 74: Hoare triple {1735#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1735#false} is VALID [2018-11-23 10:09:38,793 INFO L256 TraceCheckUtils]: 75: Hoare triple {1735#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {1735#false} is VALID [2018-11-23 10:09:38,793 INFO L273 TraceCheckUtils]: 76: Hoare triple {1735#false} ~cond := #in~cond; {1735#false} is VALID [2018-11-23 10:09:38,793 INFO L273 TraceCheckUtils]: 77: Hoare triple {1735#false} assume 0bv32 == ~cond; {1735#false} is VALID [2018-11-23 10:09:38,794 INFO L273 TraceCheckUtils]: 78: Hoare triple {1735#false} assume !false; {1735#false} is VALID [2018-11-23 10:09:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:38,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:09:40,669 INFO L273 TraceCheckUtils]: 78: Hoare triple {1735#false} assume !false; {1735#false} is VALID [2018-11-23 10:09:40,669 INFO L273 TraceCheckUtils]: 77: Hoare triple {1735#false} assume 0bv32 == ~cond; {1735#false} is VALID [2018-11-23 10:09:40,670 INFO L273 TraceCheckUtils]: 76: Hoare triple {1735#false} ~cond := #in~cond; {1735#false} is VALID [2018-11-23 10:09:40,670 INFO L256 TraceCheckUtils]: 75: Hoare triple {1735#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {1735#false} is VALID [2018-11-23 10:09:40,670 INFO L273 TraceCheckUtils]: 74: Hoare triple {1735#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1735#false} is VALID [2018-11-23 10:09:40,670 INFO L273 TraceCheckUtils]: 73: Hoare triple {1735#false} havoc ~x~0;~x~0 := 0bv32; {1735#false} is VALID [2018-11-23 10:09:40,672 INFO L273 TraceCheckUtils]: 72: Hoare triple {2014#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1735#false} is VALID [2018-11-23 10:09:40,672 INFO L273 TraceCheckUtils]: 71: Hoare triple {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2014#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:09:40,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,673 INFO L273 TraceCheckUtils]: 69: Hoare triple {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,679 INFO L273 TraceCheckUtils]: 68: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,679 INFO L273 TraceCheckUtils]: 67: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,680 INFO L273 TraceCheckUtils]: 66: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,687 INFO L273 TraceCheckUtils]: 65: Hoare triple {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,688 INFO L273 TraceCheckUtils]: 64: Hoare triple {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,688 INFO L273 TraceCheckUtils]: 63: Hoare triple {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,694 INFO L273 TraceCheckUtils]: 62: Hoare triple {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,695 INFO L273 TraceCheckUtils]: 61: Hoare triple {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,695 INFO L273 TraceCheckUtils]: 60: Hoare triple {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,700 INFO L273 TraceCheckUtils]: 59: Hoare triple {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,722 INFO L273 TraceCheckUtils]: 58: Hoare triple {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,728 INFO L273 TraceCheckUtils]: 57: Hoare triple {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,734 INFO L273 TraceCheckUtils]: 56: Hoare triple {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,735 INFO L273 TraceCheckUtils]: 55: Hoare triple {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,763 INFO L273 TraceCheckUtils]: 53: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,764 INFO L273 TraceCheckUtils]: 52: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,764 INFO L273 TraceCheckUtils]: 51: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,781 INFO L273 TraceCheckUtils]: 47: Hoare triple {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,782 INFO L273 TraceCheckUtils]: 46: Hoare triple {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,791 INFO L273 TraceCheckUtils]: 44: Hoare triple {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,792 INFO L273 TraceCheckUtils]: 43: Hoare triple {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,792 INFO L273 TraceCheckUtils]: 42: Hoare triple {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,799 INFO L273 TraceCheckUtils]: 41: Hoare triple {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,799 INFO L273 TraceCheckUtils]: 40: Hoare triple {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,805 INFO L273 TraceCheckUtils]: 38: Hoare triple {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,805 INFO L273 TraceCheckUtils]: 37: Hoare triple {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,806 INFO L273 TraceCheckUtils]: 36: Hoare triple {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,811 INFO L273 TraceCheckUtils]: 35: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,811 INFO L273 TraceCheckUtils]: 34: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,818 INFO L273 TraceCheckUtils]: 31: Hoare triple {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,818 INFO L273 TraceCheckUtils]: 30: Hoare triple {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,826 INFO L273 TraceCheckUtils]: 28: Hoare triple {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,826 INFO L273 TraceCheckUtils]: 27: Hoare triple {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,851 INFO L273 TraceCheckUtils]: 17: Hoare triple {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,852 INFO L273 TraceCheckUtils]: 16: Hoare triple {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,852 INFO L273 TraceCheckUtils]: 15: Hoare triple {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,867 INFO L273 TraceCheckUtils]: 10: Hoare triple {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,873 INFO L273 TraceCheckUtils]: 8: Hoare triple {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,874 INFO L273 TraceCheckUtils]: 7: Hoare triple {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {1734#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:09:40,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {1734#true} call #t~ret4 := main(); {1734#true} is VALID [2018-11-23 10:09:40,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1734#true} {1734#true} #55#return; {1734#true} is VALID [2018-11-23 10:09:40,876 INFO L273 TraceCheckUtils]: 2: Hoare triple {1734#true} assume true; {1734#true} is VALID [2018-11-23 10:09:40,876 INFO L273 TraceCheckUtils]: 1: Hoare triple {1734#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1734#true} is VALID [2018-11-23 10:09:40,876 INFO L256 TraceCheckUtils]: 0: Hoare triple {1734#true} call ULTIMATE.init(); {1734#true} is VALID [2018-11-23 10:09:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:09:40,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:09:40,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:09:40,888 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2018-11-23 10:09:40,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:09:40,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:09:41,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:09:41,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:09:41,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:09:41,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:09:41,270 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand 48 states. [2018-11-23 10:09:50,403 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:09:50,917 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:09:51,462 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:09:52,145 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:09:52,762 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:09:53,376 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:09:54,573 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:09:56,499 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 7 [2018-11-23 10:10:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:01,053 INFO L93 Difference]: Finished difference Result 167 states and 238 transitions. [2018-11-23 10:10:01,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:10:01,053 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2018-11-23 10:10:01,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:10:01,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:10:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 238 transitions. [2018-11-23 10:10:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:10:01,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 238 transitions. [2018-11-23 10:10:01,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 238 transitions. [2018-11-23 10:10:01,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:01,584 INFO L225 Difference]: With dead ends: 167 [2018-11-23 10:10:01,584 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 10:10:01,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:10:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 10:10:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-11-23 10:10:01,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:10:01,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 156 states. [2018-11-23 10:10:01,649 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2018-11-23 10:10:01,649 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2018-11-23 10:10:01,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:01,655 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2018-11-23 10:10:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 10:10:01,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:01,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:01,656 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2018-11-23 10:10:01,656 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2018-11-23 10:10:01,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:10:01,662 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2018-11-23 10:10:01,662 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 10:10:01,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:10:01,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:10:01,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:10:01,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:10:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 10:10:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2018-11-23 10:10:01,669 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 79 [2018-11-23 10:10:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:10:01,670 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2018-11-23 10:10:01,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:10:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 10:10:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 10:10:01,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:10:01,674 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:10:01,675 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:10:01,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:10:01,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1494294791, now seen corresponding path program 5 times [2018-11-23 10:10:01,676 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:10:01,676 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:10:01,699 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 10:10:12,391 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2018-11-23 10:10:12,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:10:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:10:12,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:10:15,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {3045#true} call ULTIMATE.init(); {3045#true} is VALID [2018-11-23 10:10:15,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {3045#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3045#true} is VALID [2018-11-23 10:10:15,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {3045#true} assume true; {3045#true} is VALID [2018-11-23 10:10:15,049 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3045#true} {3045#true} #55#return; {3045#true} is VALID [2018-11-23 10:10:15,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {3045#true} call #t~ret4 := main(); {3045#true} is VALID [2018-11-23 10:10:15,050 INFO L273 TraceCheckUtils]: 5: Hoare triple {3045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {3065#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:10:15,051 INFO L273 TraceCheckUtils]: 6: Hoare triple {3065#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3065#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:10:15,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {3065#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3065#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:10:15,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {3065#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,057 INFO L273 TraceCheckUtils]: 10: Hoare triple {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,061 INFO L273 TraceCheckUtils]: 14: Hoare triple {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,086 INFO L273 TraceCheckUtils]: 28: Hoare triple {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3145#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:10:15,088 INFO L273 TraceCheckUtils]: 30: Hoare triple {3145#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3145#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:10:15,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {3145#(= (_ bv8 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3145#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:10:15,093 INFO L273 TraceCheckUtils]: 32: Hoare triple {3145#(= (_ bv8 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,094 INFO L273 TraceCheckUtils]: 33: Hoare triple {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,094 INFO L273 TraceCheckUtils]: 34: Hoare triple {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,097 INFO L273 TraceCheckUtils]: 36: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,099 INFO L273 TraceCheckUtils]: 38: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,101 INFO L273 TraceCheckUtils]: 40: Hoare triple {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,104 INFO L273 TraceCheckUtils]: 41: Hoare triple {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3185#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:10:15,104 INFO L273 TraceCheckUtils]: 42: Hoare triple {3185#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3185#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:10:15,107 INFO L273 TraceCheckUtils]: 43: Hoare triple {3185#(= (_ bv12 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3185#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:10:15,107 INFO L273 TraceCheckUtils]: 44: Hoare triple {3185#(= (_ bv12 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,109 INFO L273 TraceCheckUtils]: 45: Hoare triple {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,109 INFO L273 TraceCheckUtils]: 46: Hoare triple {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,112 INFO L273 TraceCheckUtils]: 47: Hoare triple {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,112 INFO L273 TraceCheckUtils]: 48: Hoare triple {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,115 INFO L273 TraceCheckUtils]: 49: Hoare triple {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,115 INFO L273 TraceCheckUtils]: 50: Hoare triple {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3215#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:10:15,118 INFO L273 TraceCheckUtils]: 51: Hoare triple {3215#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3215#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:10:15,118 INFO L273 TraceCheckUtils]: 52: Hoare triple {3215#(= (_ bv15 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3215#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 10:10:15,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {3215#(= (_ bv15 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,120 INFO L273 TraceCheckUtils]: 54: Hoare triple {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,122 INFO L273 TraceCheckUtils]: 56: Hoare triple {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3235#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 10:10:15,124 INFO L273 TraceCheckUtils]: 57: Hoare triple {3235#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3235#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 10:10:15,124 INFO L273 TraceCheckUtils]: 58: Hoare triple {3235#(= (_ bv17 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3235#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 10:10:15,127 INFO L273 TraceCheckUtils]: 59: Hoare triple {3235#(= (_ bv17 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,127 INFO L273 TraceCheckUtils]: 60: Hoare triple {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,130 INFO L273 TraceCheckUtils]: 61: Hoare triple {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,130 INFO L273 TraceCheckUtils]: 62: Hoare triple {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,133 INFO L273 TraceCheckUtils]: 63: Hoare triple {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,133 INFO L273 TraceCheckUtils]: 64: Hoare triple {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,135 INFO L273 TraceCheckUtils]: 65: Hoare triple {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3265#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:10:15,135 INFO L273 TraceCheckUtils]: 66: Hoare triple {3265#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3265#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:10:15,137 INFO L273 TraceCheckUtils]: 67: Hoare triple {3265#(= (_ bv20 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3265#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:10:15,140 INFO L273 TraceCheckUtils]: 68: Hoare triple {3265#(= (_ bv20 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,140 INFO L273 TraceCheckUtils]: 69: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,143 INFO L273 TraceCheckUtils]: 70: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,143 INFO L273 TraceCheckUtils]: 71: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,145 INFO L273 TraceCheckUtils]: 72: Hoare triple {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,145 INFO L273 TraceCheckUtils]: 73: Hoare triple {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,147 INFO L273 TraceCheckUtils]: 74: Hoare triple {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,147 INFO L273 TraceCheckUtils]: 75: Hoare triple {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,149 INFO L273 TraceCheckUtils]: 76: Hoare triple {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,149 INFO L273 TraceCheckUtils]: 77: Hoare triple {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,151 INFO L273 TraceCheckUtils]: 78: Hoare triple {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,151 INFO L273 TraceCheckUtils]: 79: Hoare triple {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,153 INFO L273 TraceCheckUtils]: 80: Hoare triple {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,153 INFO L273 TraceCheckUtils]: 81: Hoare triple {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,156 INFO L273 TraceCheckUtils]: 82: Hoare triple {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,156 INFO L273 TraceCheckUtils]: 83: Hoare triple {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,158 INFO L273 TraceCheckUtils]: 84: Hoare triple {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,158 INFO L273 TraceCheckUtils]: 85: Hoare triple {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,161 INFO L273 TraceCheckUtils]: 86: Hoare triple {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3335#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 10:10:15,161 INFO L273 TraceCheckUtils]: 87: Hoare triple {3335#(= (_ bv27 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3335#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 10:10:15,163 INFO L273 TraceCheckUtils]: 88: Hoare triple {3335#(= (_ bv27 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3335#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 10:10:15,163 INFO L273 TraceCheckUtils]: 89: Hoare triple {3335#(= (_ bv27 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,165 INFO L273 TraceCheckUtils]: 90: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,165 INFO L273 TraceCheckUtils]: 91: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,168 INFO L273 TraceCheckUtils]: 92: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3355#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:10:15,168 INFO L273 TraceCheckUtils]: 93: Hoare triple {3355#(= (_ bv29 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3355#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:10:15,171 INFO L273 TraceCheckUtils]: 94: Hoare triple {3355#(= (_ bv29 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3355#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:10:15,171 INFO L273 TraceCheckUtils]: 95: Hoare triple {3355#(= (_ bv29 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,174 INFO L273 TraceCheckUtils]: 96: Hoare triple {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,174 INFO L273 TraceCheckUtils]: 97: Hoare triple {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,177 INFO L273 TraceCheckUtils]: 98: Hoare triple {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3375#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 10:10:15,177 INFO L273 TraceCheckUtils]: 99: Hoare triple {3375#(= (_ bv31 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3375#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 10:10:15,179 INFO L273 TraceCheckUtils]: 100: Hoare triple {3375#(= (_ bv31 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3375#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 10:10:15,179 INFO L273 TraceCheckUtils]: 101: Hoare triple {3375#(= (_ bv31 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,182 INFO L273 TraceCheckUtils]: 102: Hoare triple {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,182 INFO L273 TraceCheckUtils]: 103: Hoare triple {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,185 INFO L273 TraceCheckUtils]: 104: Hoare triple {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3395#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 10:10:15,185 INFO L273 TraceCheckUtils]: 105: Hoare triple {3395#(= (_ bv33 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3395#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 10:10:15,188 INFO L273 TraceCheckUtils]: 106: Hoare triple {3395#(= (_ bv33 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3395#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 10:10:15,188 INFO L273 TraceCheckUtils]: 107: Hoare triple {3395#(= (_ bv33 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,191 INFO L273 TraceCheckUtils]: 108: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,191 INFO L273 TraceCheckUtils]: 109: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,193 INFO L273 TraceCheckUtils]: 110: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,193 INFO L273 TraceCheckUtils]: 111: Hoare triple {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,196 INFO L273 TraceCheckUtils]: 112: Hoare triple {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,196 INFO L273 TraceCheckUtils]: 113: Hoare triple {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,199 INFO L273 TraceCheckUtils]: 114: Hoare triple {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,199 INFO L273 TraceCheckUtils]: 115: Hoare triple {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,202 INFO L273 TraceCheckUtils]: 116: Hoare triple {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3435#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 10:10:15,202 INFO L273 TraceCheckUtils]: 117: Hoare triple {3435#(= (_ bv37 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3435#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 10:10:15,205 INFO L273 TraceCheckUtils]: 118: Hoare triple {3435#(= (_ bv37 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3435#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 10:10:15,205 INFO L273 TraceCheckUtils]: 119: Hoare triple {3435#(= (_ bv37 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,207 INFO L273 TraceCheckUtils]: 120: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,207 INFO L273 TraceCheckUtils]: 121: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,210 INFO L273 TraceCheckUtils]: 122: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,210 INFO L273 TraceCheckUtils]: 123: Hoare triple {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,212 INFO L273 TraceCheckUtils]: 124: Hoare triple {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,212 INFO L273 TraceCheckUtils]: 125: Hoare triple {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,214 INFO L273 TraceCheckUtils]: 126: Hoare triple {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,214 INFO L273 TraceCheckUtils]: 127: Hoare triple {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,216 INFO L273 TraceCheckUtils]: 128: Hoare triple {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3475#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 10:10:15,216 INFO L273 TraceCheckUtils]: 129: Hoare triple {3475#(= (_ bv41 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3475#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 10:10:15,219 INFO L273 TraceCheckUtils]: 130: Hoare triple {3475#(= (_ bv41 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3475#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 10:10:15,219 INFO L273 TraceCheckUtils]: 131: Hoare triple {3475#(= (_ bv41 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,219 INFO L273 TraceCheckUtils]: 132: Hoare triple {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,220 INFO L273 TraceCheckUtils]: 133: Hoare triple {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,220 INFO L273 TraceCheckUtils]: 134: Hoare triple {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3495#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 10:10:15,221 INFO L273 TraceCheckUtils]: 135: Hoare triple {3495#(= (_ bv43 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3495#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 10:10:15,225 INFO L273 TraceCheckUtils]: 136: Hoare triple {3495#(= (_ bv43 32) main_~i~0)} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3495#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 10:10:15,225 INFO L273 TraceCheckUtils]: 137: Hoare triple {3495#(= (_ bv43 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,227 INFO L273 TraceCheckUtils]: 138: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,227 INFO L273 TraceCheckUtils]: 139: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,227 INFO L273 TraceCheckUtils]: 140: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,228 INFO L273 TraceCheckUtils]: 141: Hoare triple {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,229 INFO L273 TraceCheckUtils]: 142: Hoare triple {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,229 INFO L273 TraceCheckUtils]: 143: Hoare triple {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3525#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 10:10:15,229 INFO L273 TraceCheckUtils]: 144: Hoare triple {3525#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3046#false} is VALID [2018-11-23 10:10:15,230 INFO L273 TraceCheckUtils]: 145: Hoare triple {3046#false} havoc ~x~0;~x~0 := 0bv32; {3046#false} is VALID [2018-11-23 10:10:15,230 INFO L273 TraceCheckUtils]: 146: Hoare triple {3046#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3046#false} is VALID [2018-11-23 10:10:15,230 INFO L256 TraceCheckUtils]: 147: Hoare triple {3046#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {3046#false} is VALID [2018-11-23 10:10:15,230 INFO L273 TraceCheckUtils]: 148: Hoare triple {3046#false} ~cond := #in~cond; {3046#false} is VALID [2018-11-23 10:10:15,230 INFO L273 TraceCheckUtils]: 149: Hoare triple {3046#false} assume 0bv32 == ~cond; {3046#false} is VALID [2018-11-23 10:10:15,231 INFO L273 TraceCheckUtils]: 150: Hoare triple {3046#false} assume !false; {3046#false} is VALID [2018-11-23 10:10:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:15,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:10:22,158 INFO L273 TraceCheckUtils]: 150: Hoare triple {3046#false} assume !false; {3046#false} is VALID [2018-11-23 10:10:22,158 INFO L273 TraceCheckUtils]: 149: Hoare triple {3046#false} assume 0bv32 == ~cond; {3046#false} is VALID [2018-11-23 10:10:22,158 INFO L273 TraceCheckUtils]: 148: Hoare triple {3046#false} ~cond := #in~cond; {3046#false} is VALID [2018-11-23 10:10:22,159 INFO L256 TraceCheckUtils]: 147: Hoare triple {3046#false} call __VERIFIER_assert((if ~bvsle32(#t~mem3, ~max~0) then 1bv32 else 0bv32)); {3046#false} is VALID [2018-11-23 10:10:22,159 INFO L273 TraceCheckUtils]: 146: Hoare triple {3046#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3046#false} is VALID [2018-11-23 10:10:22,159 INFO L273 TraceCheckUtils]: 145: Hoare triple {3046#false} havoc ~x~0;~x~0 := 0bv32; {3046#false} is VALID [2018-11-23 10:10:22,160 INFO L273 TraceCheckUtils]: 144: Hoare triple {3565#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3046#false} is VALID [2018-11-23 10:10:22,160 INFO L273 TraceCheckUtils]: 143: Hoare triple {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3565#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:10:22,161 INFO L273 TraceCheckUtils]: 142: Hoare triple {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,175 INFO L273 TraceCheckUtils]: 141: Hoare triple {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,181 INFO L273 TraceCheckUtils]: 140: Hoare triple {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,181 INFO L273 TraceCheckUtils]: 139: Hoare triple {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,181 INFO L273 TraceCheckUtils]: 138: Hoare triple {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,189 INFO L273 TraceCheckUtils]: 137: Hoare triple {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,190 INFO L273 TraceCheckUtils]: 136: Hoare triple {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,190 INFO L273 TraceCheckUtils]: 135: Hoare triple {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,195 INFO L273 TraceCheckUtils]: 134: Hoare triple {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,195 INFO L273 TraceCheckUtils]: 133: Hoare triple {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,196 INFO L273 TraceCheckUtils]: 132: Hoare triple {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,201 INFO L273 TraceCheckUtils]: 131: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,202 INFO L273 TraceCheckUtils]: 130: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,202 INFO L273 TraceCheckUtils]: 129: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,207 INFO L273 TraceCheckUtils]: 128: Hoare triple {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,208 INFO L273 TraceCheckUtils]: 127: Hoare triple {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,208 INFO L273 TraceCheckUtils]: 126: Hoare triple {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,215 INFO L273 TraceCheckUtils]: 125: Hoare triple {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,216 INFO L273 TraceCheckUtils]: 124: Hoare triple {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,216 INFO L273 TraceCheckUtils]: 123: Hoare triple {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,221 INFO L273 TraceCheckUtils]: 122: Hoare triple {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,222 INFO L273 TraceCheckUtils]: 121: Hoare triple {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,222 INFO L273 TraceCheckUtils]: 120: Hoare triple {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,229 INFO L273 TraceCheckUtils]: 119: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,239 INFO L273 TraceCheckUtils]: 118: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,240 INFO L273 TraceCheckUtils]: 117: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,246 INFO L273 TraceCheckUtils]: 116: Hoare triple {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,247 INFO L273 TraceCheckUtils]: 115: Hoare triple {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,247 INFO L273 TraceCheckUtils]: 114: Hoare triple {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,253 INFO L273 TraceCheckUtils]: 113: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,253 INFO L273 TraceCheckUtils]: 112: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,254 INFO L273 TraceCheckUtils]: 111: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,259 INFO L273 TraceCheckUtils]: 110: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,260 INFO L273 TraceCheckUtils]: 109: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,260 INFO L273 TraceCheckUtils]: 108: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,265 INFO L273 TraceCheckUtils]: 107: Hoare triple {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,265 INFO L273 TraceCheckUtils]: 106: Hoare triple {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,265 INFO L273 TraceCheckUtils]: 105: Hoare triple {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,271 INFO L273 TraceCheckUtils]: 104: Hoare triple {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,271 INFO L273 TraceCheckUtils]: 103: Hoare triple {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,272 INFO L273 TraceCheckUtils]: 102: Hoare triple {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,277 INFO L273 TraceCheckUtils]: 101: Hoare triple {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,278 INFO L273 TraceCheckUtils]: 100: Hoare triple {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,278 INFO L273 TraceCheckUtils]: 99: Hoare triple {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,286 INFO L273 TraceCheckUtils]: 98: Hoare triple {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,286 INFO L273 TraceCheckUtils]: 97: Hoare triple {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,287 INFO L273 TraceCheckUtils]: 96: Hoare triple {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,291 INFO L273 TraceCheckUtils]: 95: Hoare triple {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,292 INFO L273 TraceCheckUtils]: 94: Hoare triple {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,292 INFO L273 TraceCheckUtils]: 93: Hoare triple {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,299 INFO L273 TraceCheckUtils]: 92: Hoare triple {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,299 INFO L273 TraceCheckUtils]: 91: Hoare triple {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,300 INFO L273 TraceCheckUtils]: 90: Hoare triple {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,307 INFO L273 TraceCheckUtils]: 89: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,307 INFO L273 TraceCheckUtils]: 88: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,308 INFO L273 TraceCheckUtils]: 87: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,312 INFO L273 TraceCheckUtils]: 86: Hoare triple {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,312 INFO L273 TraceCheckUtils]: 85: Hoare triple {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,313 INFO L273 TraceCheckUtils]: 84: Hoare triple {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,319 INFO L273 TraceCheckUtils]: 83: Hoare triple {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,320 INFO L273 TraceCheckUtils]: 82: Hoare triple {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,320 INFO L273 TraceCheckUtils]: 81: Hoare triple {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,324 INFO L273 TraceCheckUtils]: 80: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,325 INFO L273 TraceCheckUtils]: 79: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,325 INFO L273 TraceCheckUtils]: 78: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,333 INFO L273 TraceCheckUtils]: 77: Hoare triple {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,333 INFO L273 TraceCheckUtils]: 76: Hoare triple {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,334 INFO L273 TraceCheckUtils]: 75: Hoare triple {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,340 INFO L273 TraceCheckUtils]: 74: Hoare triple {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,340 INFO L273 TraceCheckUtils]: 73: Hoare triple {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,340 INFO L273 TraceCheckUtils]: 72: Hoare triple {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,347 INFO L273 TraceCheckUtils]: 71: Hoare triple {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,347 INFO L273 TraceCheckUtils]: 70: Hoare triple {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,347 INFO L273 TraceCheckUtils]: 69: Hoare triple {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,353 INFO L273 TraceCheckUtils]: 68: Hoare triple {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,354 INFO L273 TraceCheckUtils]: 67: Hoare triple {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,354 INFO L273 TraceCheckUtils]: 66: Hoare triple {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,360 INFO L273 TraceCheckUtils]: 65: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,361 INFO L273 TraceCheckUtils]: 64: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,361 INFO L273 TraceCheckUtils]: 63: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,370 INFO L273 TraceCheckUtils]: 62: Hoare triple {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,370 INFO L273 TraceCheckUtils]: 61: Hoare triple {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,371 INFO L273 TraceCheckUtils]: 60: Hoare triple {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,378 INFO L273 TraceCheckUtils]: 59: Hoare triple {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,378 INFO L273 TraceCheckUtils]: 58: Hoare triple {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,379 INFO L273 TraceCheckUtils]: 57: Hoare triple {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,384 INFO L273 TraceCheckUtils]: 56: Hoare triple {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,385 INFO L273 TraceCheckUtils]: 55: Hoare triple {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,385 INFO L273 TraceCheckUtils]: 54: Hoare triple {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,392 INFO L273 TraceCheckUtils]: 53: Hoare triple {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,392 INFO L273 TraceCheckUtils]: 52: Hoare triple {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,393 INFO L273 TraceCheckUtils]: 51: Hoare triple {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,401 INFO L273 TraceCheckUtils]: 50: Hoare triple {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,402 INFO L273 TraceCheckUtils]: 49: Hoare triple {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,402 INFO L273 TraceCheckUtils]: 48: Hoare triple {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,408 INFO L273 TraceCheckUtils]: 47: Hoare triple {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,414 INFO L273 TraceCheckUtils]: 44: Hoare triple {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,414 INFO L273 TraceCheckUtils]: 43: Hoare triple {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,419 INFO L273 TraceCheckUtils]: 41: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,420 INFO L273 TraceCheckUtils]: 40: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,420 INFO L273 TraceCheckUtils]: 39: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,429 INFO L273 TraceCheckUtils]: 38: Hoare triple {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,430 INFO L273 TraceCheckUtils]: 37: Hoare triple {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,443 INFO L273 TraceCheckUtils]: 34: Hoare triple {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,443 INFO L273 TraceCheckUtils]: 33: Hoare triple {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,449 INFO L273 TraceCheckUtils]: 31: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,449 INFO L273 TraceCheckUtils]: 30: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,455 INFO L273 TraceCheckUtils]: 29: Hoare triple {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,455 INFO L273 TraceCheckUtils]: 28: Hoare triple {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,455 INFO L273 TraceCheckUtils]: 27: Hoare triple {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,471 INFO L273 TraceCheckUtils]: 23: Hoare triple {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,492 INFO L273 TraceCheckUtils]: 13: Hoare triple {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,500 INFO L273 TraceCheckUtils]: 11: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,501 INFO L273 TraceCheckUtils]: 10: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,501 INFO L273 TraceCheckUtils]: 9: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,509 INFO L273 TraceCheckUtils]: 8: Hoare triple {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, ~max~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~max~0 := #t~mem1;havoc #t~mem1; {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,510 INFO L273 TraceCheckUtils]: 5: Hoare triple {3045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~max~0 := 0bv32;~i~0 := 0bv32; {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 10:10:22,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {3045#true} call #t~ret4 := main(); {3045#true} is VALID [2018-11-23 10:10:22,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3045#true} {3045#true} #55#return; {3045#true} is VALID [2018-11-23 10:10:22,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {3045#true} assume true; {3045#true} is VALID [2018-11-23 10:10:22,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {3045#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3045#true} is VALID [2018-11-23 10:10:22,511 INFO L256 TraceCheckUtils]: 0: Hoare triple {3045#true} call ULTIMATE.init(); {3045#true} is VALID [2018-11-23 10:10:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:10:22,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:10:22,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2018-11-23 10:10:22,547 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 151 [2018-11-23 10:10:22,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:10:22,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2018-11-23 10:10:23,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:10:23,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-23 10:10:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-23 10:10:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2018-11-23 10:10:23,329 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand 96 states. [2018-11-23 10:10:55,961 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 7 [2018-11-23 10:10:58,049 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 7 [2018-11-23 10:11:00,358 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 7 [2018-11-23 10:11:02,700 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 7 [2018-11-23 10:11:05,130 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 7 [2018-11-23 10:11:07,658 WARN L180 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 7 [2018-11-23 10:11:10,296 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 7 [2018-11-23 10:11:13,059 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 7 [2018-11-23 10:11:15,717 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 7 [2018-11-23 10:11:18,653 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 7 [2018-11-23 10:11:21,559 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 7 [2018-11-23 10:11:24,302 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 7 [2018-11-23 10:11:27,147 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 7 [2018-11-23 10:11:30,010 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 7 [2018-11-23 10:11:32,865 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 7 [2018-11-23 10:11:35,722 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 7 [2018-11-23 10:11:38,630 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-23 10:11:41,516 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 7 [2018-11-23 10:11:44,489 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 7 [2018-11-23 10:11:47,419 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2018-11-23 10:11:50,178 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-23 10:11:52,893 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-23 10:11:55,613 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2018-11-23 10:11:58,206 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 10:12:00,796 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:12:03,121 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:12:05,486 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:12:07,901 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:12:10,151 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:12:12,344 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:12:14,462 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:12:16,475 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:12:18,531 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 7 [2018-11-23 10:12:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:12:33,213 INFO L93 Difference]: Finished difference Result 311 states and 454 transitions. [2018-11-23 10:12:33,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-23 10:12:33,213 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 151 [2018-11-23 10:12:33,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:12:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:12:33,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 454 transitions. [2018-11-23 10:12:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:12:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 454 transitions. [2018-11-23 10:12:33,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 454 transitions. [2018-11-23 10:12:34,411 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:12:34,420 INFO L225 Difference]: With dead ends: 311 [2018-11-23 10:12:34,420 INFO L226 Difference]: Without dead ends: 300 [2018-11-23 10:12:34,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 102.3s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2018-11-23 10:12:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-23 10:12:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2018-11-23 10:12:34,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:12:34,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand 300 states. [2018-11-23 10:12:34,585 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand 300 states. [2018-11-23 10:12:34,585 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 300 states. [2018-11-23 10:12:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:12:34,598 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2018-11-23 10:12:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2018-11-23 10:12:34,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:12:34,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:12:34,599 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand 300 states. [2018-11-23 10:12:34,599 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 300 states. [2018-11-23 10:12:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:12:34,611 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2018-11-23 10:12:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2018-11-23 10:12:34,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:12:34,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:12:34,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:12:34,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:12:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-23 10:12:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2018-11-23 10:12:34,624 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 151 [2018-11-23 10:12:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:12:34,625 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2018-11-23 10:12:34,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-23 10:12:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2018-11-23 10:12:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-23 10:12:34,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:12:34,631 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:12:34,631 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:12:34,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:12:34,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1624791289, now seen corresponding path program 6 times [2018-11-23 10:12:34,632 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:12:34,632 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:12:34,662 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE