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-industry-pattern/array_monotonic_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:17:26,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:17:26,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:17:26,117 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:17:26,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:17:26,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:17:26,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:17:26,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:17:26,123 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:17:26,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:17:26,125 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:17:26,126 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:17:26,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:17:26,127 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:17:26,129 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:17:26,129 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:17:26,130 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:17:26,132 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:17:26,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:17:26,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:17:26,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:17:26,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:17:26,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:17:26,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:17:26,141 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:17:26,142 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:17:26,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:17:26,144 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:17:26,145 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:17:26,146 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:17:26,147 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:17:26,148 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:17:26,148 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:17:26,148 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:17:26,149 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:17:26,150 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:17:26,150 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:17:26,165 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:17:26,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:17:26,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:17:26,167 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:17:26,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:17:26,168 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:17:26,168 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:17:26,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:17:26,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:17:26,168 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:17:26,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:17:26,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:17:26,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:17:26,169 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:17:26,169 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:17:26,169 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:17:26,170 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:17:26,170 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:17:26,170 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:17:26,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:17:26,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:17:26,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:17:26,171 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:17:26,171 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:17:26,171 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:17:26,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:17:26,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:17:26,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:17:26,172 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:17:26,172 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:17:26,172 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:17:26,173 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:17:26,173 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:17:26,228 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:17:26,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:17:26,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:17:26,252 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:17:26,253 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:17:26,253 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_monotonic_true-unreach-call_true-termination.i [2018-11-23 10:17:26,313 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8313280d/e56c1f1d36d741c5820c415800f91c1b/FLAG878207f0a [2018-11-23 10:17:26,781 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:17:26,782 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_monotonic_true-unreach-call_true-termination.i [2018-11-23 10:17:26,789 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8313280d/e56c1f1d36d741c5820c415800f91c1b/FLAG878207f0a [2018-11-23 10:17:27,134 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8313280d/e56c1f1d36d741c5820c415800f91c1b [2018-11-23 10:17:27,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:17:27,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:17:27,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:17:27,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:17:27,150 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:17:27,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:17:27" (1/1) ... [2018-11-23 10:17:27,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd895e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27, skipping insertion in model container [2018-11-23 10:17:27,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:17:27" (1/1) ... [2018-11-23 10:17:27,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:17:27,189 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:17:27,405 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:17:27,410 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:17:27,435 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:17:27,459 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:17:27,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27 WrapperNode [2018-11-23 10:17:27,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:17:27,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:17:27,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:17:27,461 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:17:27,470 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:17:27" (1/1) ... [2018-11-23 10:17:27,481 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:17:27" (1/1) ... [2018-11-23 10:17:27,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:17:27,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:17:27,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:17:27,489 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:17:27,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27" (1/1) ... [2018-11-23 10:17:27,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27" (1/1) ... [2018-11-23 10:17:27,500 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27" (1/1) ... [2018-11-23 10:17:27,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27" (1/1) ... [2018-11-23 10:17:27,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27" (1/1) ... [2018-11-23 10:17:27,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27" (1/1) ... [2018-11-23 10:17:27,520 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27" (1/1) ... [2018-11-23 10:17:27,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:17:27,522 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:17:27,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:17:27,523 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:17:27,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27" (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:17:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:17:27,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:17:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:17:27,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:17:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:17:27,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:17:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:17:27,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:17:27,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:17:27,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:17:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:17:27,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:17:28,132 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:17:28,132 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:17:28,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:17:28 BoogieIcfgContainer [2018-11-23 10:17:28,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:17:28,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:17:28,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:17:28,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:17:28,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:17:27" (1/3) ... [2018-11-23 10:17:28,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4ecbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:17:28, skipping insertion in model container [2018-11-23 10:17:28,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:27" (2/3) ... [2018-11-23 10:17:28,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4ecbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:17:28, skipping insertion in model container [2018-11-23 10:17:28,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:17:28" (3/3) ... [2018-11-23 10:17:28,141 INFO L112 eAbstractionObserver]: Analyzing ICFG array_monotonic_true-unreach-call_true-termination.i [2018-11-23 10:17:28,151 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:17:28,158 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:17:28,176 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:17:28,209 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:17:28,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:17:28,210 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:17:28,211 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:17:28,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:17:28,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:17:28,211 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:17:28,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:17:28,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:17:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 10:17:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:17:28,236 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:28,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:28,240 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:28,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash 547567586, now seen corresponding path program 1 times [2018-11-23 10:17:28,250 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:28,250 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:17:28,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:28,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:28,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 10:17:28,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-23 10:17:28,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 10:17:28,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #59#return; {29#true} is VALID [2018-11-23 10:17:28,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2018-11-23 10:17:28,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {29#true} is VALID [2018-11-23 10:17:28,445 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 10:17:28,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} ~i~0 := 0bv32; {30#false} is VALID [2018-11-23 10:17:28,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {30#false} is VALID [2018-11-23 10:17:28,446 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {30#false} is VALID [2018-11-23 10:17:28,446 INFO L256 TraceCheckUtils]: 10: Hoare triple {30#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {30#false} is VALID [2018-11-23 10:17:28,447 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 10:17:28,447 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume 0bv32 == ~cond; {30#false} is VALID [2018-11-23 10:17:28,448 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 10:17:28,453 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:17:28,454 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:17:28,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:17:28,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:17:28,469 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:17:28,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:28,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:17:28,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:28,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:17:28,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:17:28,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:17:28,609 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 10:17:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:28,881 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2018-11-23 10:17:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:17:28,881 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:17:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:17:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2018-11-23 10:17:28,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:17:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2018-11-23 10:17:28,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 53 transitions. [2018-11-23 10:17:29,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:29,096 INFO L225 Difference]: With dead ends: 43 [2018-11-23 10:17:29,096 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 10:17:29,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:17:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 10:17:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 10:17:29,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:29,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 10:17:29,209 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 10:17:29,209 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 10:17:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:29,213 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 10:17:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 10:17:29,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:29,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:29,214 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 10:17:29,214 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 10:17:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:29,218 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 10:17:29,218 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 10:17:29,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:29,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:29,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:29,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:17:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 10:17:29,224 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2018-11-23 10:17:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:29,224 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 10:17:29,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:17:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 10:17:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:17:29,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:29,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:29,226 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:29,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1443476915, now seen corresponding path program 1 times [2018-11-23 10:17:29,227 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:29,228 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:17:29,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:29,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:29,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-23 10:17:29,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {197#true} is VALID [2018-11-23 10:17:29,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2018-11-23 10:17:29,361 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #59#return; {197#true} is VALID [2018-11-23 10:17:29,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret4 := main(); {197#true} is VALID [2018-11-23 10:17:29,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:29,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {198#false} is VALID [2018-11-23 10:17:29,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {198#false} ~i~0 := 0bv32; {198#false} is VALID [2018-11-23 10:17:29,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {198#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {198#false} is VALID [2018-11-23 10:17:29,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {198#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {198#false} is VALID [2018-11-23 10:17:29,364 INFO L256 TraceCheckUtils]: 10: Hoare triple {198#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {198#false} is VALID [2018-11-23 10:17:29,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2018-11-23 10:17:29,365 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} assume 0bv32 == ~cond; {198#false} is VALID [2018-11-23 10:17:29,365 INFO L273 TraceCheckUtils]: 13: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-23 10:17:29,366 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:17:29,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:17:29,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:17:29,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:17:29,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:17:29,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:29,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:17:29,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:29,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:17:29,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:17:29,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:17:29,424 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2018-11-23 10:17:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:29,689 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 10:17:29,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:17:29,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:17:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:17:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 10:17:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:17:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-23 10:17:29,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-23 10:17:30,042 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:17:30,044 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:17:30,044 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:17:30,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:17:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:17:30,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-11-23 10:17:30,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:30,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 22 states. [2018-11-23 10:17:30,062 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 22 states. [2018-11-23 10:17:30,062 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 22 states. [2018-11-23 10:17:30,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:30,067 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 10:17:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 10:17:30,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:30,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:30,068 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 29 states. [2018-11-23 10:17:30,068 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 29 states. [2018-11-23 10:17:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:30,072 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 10:17:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 10:17:30,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:30,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:30,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:30,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:30,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:17:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 10:17:30,075 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-11-23 10:17:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:30,076 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 10:17:30,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:17:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 10:17:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:17:30,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:30,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:30,078 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:30,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:30,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1901506806, now seen corresponding path program 1 times [2018-11-23 10:17:30,079 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:30,079 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:17:30,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:30,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:30,302 INFO L256 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2018-11-23 10:17:30,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {385#true} is VALID [2018-11-23 10:17:30,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2018-11-23 10:17:30,303 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #59#return; {385#true} is VALID [2018-11-23 10:17:30,303 INFO L256 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret4 := main(); {385#true} is VALID [2018-11-23 10:17:30,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {405#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:30,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {405#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {405#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:30,339 INFO L273 TraceCheckUtils]: 7: Hoare triple {405#(= main_~i~0 (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {405#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:30,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {405#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {415#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:30,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {415#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {386#false} is VALID [2018-11-23 10:17:30,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#false} ~i~0 := 0bv32; {386#false} is VALID [2018-11-23 10:17:30,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {386#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {386#false} is VALID [2018-11-23 10:17:30,344 INFO L273 TraceCheckUtils]: 12: Hoare triple {386#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {386#false} is VALID [2018-11-23 10:17:30,345 INFO L256 TraceCheckUtils]: 13: Hoare triple {386#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {386#false} is VALID [2018-11-23 10:17:30,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2018-11-23 10:17:30,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {386#false} assume 0bv32 == ~cond; {386#false} is VALID [2018-11-23 10:17:30,346 INFO L273 TraceCheckUtils]: 16: Hoare triple {386#false} assume !false; {386#false} is VALID [2018-11-23 10:17:30,348 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:17:30,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:30,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {386#false} assume !false; {386#false} is VALID [2018-11-23 10:17:30,415 INFO L273 TraceCheckUtils]: 15: Hoare triple {386#false} assume 0bv32 == ~cond; {386#false} is VALID [2018-11-23 10:17:30,415 INFO L273 TraceCheckUtils]: 14: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2018-11-23 10:17:30,416 INFO L256 TraceCheckUtils]: 13: Hoare triple {386#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {386#false} is VALID [2018-11-23 10:17:30,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {386#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {386#false} is VALID [2018-11-23 10:17:30,416 INFO L273 TraceCheckUtils]: 11: Hoare triple {386#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {386#false} is VALID [2018-11-23 10:17:30,417 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#false} ~i~0 := 0bv32; {386#false} is VALID [2018-11-23 10:17:30,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {461#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {386#false} is VALID [2018-11-23 10:17:30,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {465#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {461#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:17:30,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {465#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {465#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:30,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {465#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {465#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:30,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {465#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:30,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret4 := main(); {385#true} is VALID [2018-11-23 10:17:30,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #59#return; {385#true} is VALID [2018-11-23 10:17:30,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2018-11-23 10:17:30,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {385#true} is VALID [2018-11-23 10:17:30,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2018-11-23 10:17:30,428 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:17:30,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:30,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:17:30,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 10:17:30,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:30,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:17:30,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:30,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:17:30,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:17:30,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:17:30,509 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2018-11-23 10:17:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:31,097 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2018-11-23 10:17:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:17:31,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 10:17:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:17:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2018-11-23 10:17:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:17:31,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2018-11-23 10:17:31,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2018-11-23 10:17:31,298 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:17:31,300 INFO L225 Difference]: With dead ends: 59 [2018-11-23 10:17:31,300 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 10:17:31,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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:17:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 10:17:31,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2018-11-23 10:17:31,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:31,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 31 states. [2018-11-23 10:17:31,326 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 31 states. [2018-11-23 10:17:31,326 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 31 states. [2018-11-23 10:17:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:31,331 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 10:17:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 10:17:31,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:31,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:31,332 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 47 states. [2018-11-23 10:17:31,332 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 47 states. [2018-11-23 10:17:31,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:31,336 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 10:17:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2018-11-23 10:17:31,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:31,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:31,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:31,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 10:17:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-23 10:17:31,340 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 17 [2018-11-23 10:17:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:31,341 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-23 10:17:31,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:17:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 10:17:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:17:31,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:31,342 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:31,345 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:31,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1186891763, now seen corresponding path program 2 times [2018-11-23 10:17:31,346 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:31,346 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:17:31,370 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:17:31,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:17:31,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:17:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:31,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:31,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2018-11-23 10:17:31,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {712#true} is VALID [2018-11-23 10:17:31,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-23 10:17:31,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2018-11-23 10:17:31,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret4 := main(); {712#true} is VALID [2018-11-23 10:17:31,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {732#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:31,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {732#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {732#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:31,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {732#(= main_~i~0 (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {732#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:31,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {732#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {742#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:31,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {742#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {742#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:31,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {742#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {742#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:31,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {742#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {752#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:31,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {752#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {752#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:31,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {752#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {752#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:31,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {752#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {762#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:31,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {762#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {762#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:31,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {762#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {762#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:31,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {762#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {772#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:17:31,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {772#(= (_ bv8 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {713#false} is VALID [2018-11-23 10:17:31,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {713#false} ~i~0 := 0bv32; {713#false} is VALID [2018-11-23 10:17:31,630 INFO L273 TraceCheckUtils]: 20: Hoare triple {713#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {713#false} is VALID [2018-11-23 10:17:31,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {713#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {713#false} is VALID [2018-11-23 10:17:31,631 INFO L256 TraceCheckUtils]: 22: Hoare triple {713#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {713#false} is VALID [2018-11-23 10:17:31,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {713#false} ~cond := #in~cond; {713#false} is VALID [2018-11-23 10:17:31,632 INFO L273 TraceCheckUtils]: 24: Hoare triple {713#false} assume 0bv32 == ~cond; {713#false} is VALID [2018-11-23 10:17:31,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {713#false} assume !false; {713#false} is VALID [2018-11-23 10:17:31,635 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:17:31,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:31,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {713#false} assume !false; {713#false} is VALID [2018-11-23 10:17:31,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {713#false} assume 0bv32 == ~cond; {713#false} is VALID [2018-11-23 10:17:31,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {713#false} ~cond := #in~cond; {713#false} is VALID [2018-11-23 10:17:31,812 INFO L256 TraceCheckUtils]: 22: Hoare triple {713#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {713#false} is VALID [2018-11-23 10:17:31,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {713#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {713#false} is VALID [2018-11-23 10:17:31,813 INFO L273 TraceCheckUtils]: 20: Hoare triple {713#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {713#false} is VALID [2018-11-23 10:17:31,813 INFO L273 TraceCheckUtils]: 19: Hoare triple {713#false} ~i~0 := 0bv32; {713#false} is VALID [2018-11-23 10:17:31,814 INFO L273 TraceCheckUtils]: 18: Hoare triple {818#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {713#false} is VALID [2018-11-23 10:17:31,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {822#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {818#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:17:31,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {822#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {822#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {822#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {822#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {832#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {822#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,822 INFO L273 TraceCheckUtils]: 13: Hoare triple {832#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {832#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {832#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {832#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,828 INFO L273 TraceCheckUtils]: 11: Hoare triple {842#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {832#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {842#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {842#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {842#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {842#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {852#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {842#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {852#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {852#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {852#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {852#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,841 INFO L273 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {852#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:31,841 INFO L256 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret4 := main(); {712#true} is VALID [2018-11-23 10:17:31,841 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2018-11-23 10:17:31,841 INFO L273 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2018-11-23 10:17:31,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {712#true} is VALID [2018-11-23 10:17:31,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2018-11-23 10:17:31,844 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:17:31,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:31,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:17:31,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 10:17:31,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:31,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:17:31,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:31,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:17:31,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:17:31,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:17:31,927 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 12 states. [2018-11-23 10:17:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:34,160 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2018-11-23 10:17:34,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:17:34,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 10:17:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:17:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2018-11-23 10:17:34,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:17:34,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2018-11-23 10:17:34,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 144 transitions. [2018-11-23 10:17:34,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:34,495 INFO L225 Difference]: With dead ends: 107 [2018-11-23 10:17:34,495 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 10:17:34,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:17:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 10:17:34,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 49. [2018-11-23 10:17:34,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:34,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 49 states. [2018-11-23 10:17:34,541 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 49 states. [2018-11-23 10:17:34,541 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 49 states. [2018-11-23 10:17:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:34,547 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2018-11-23 10:17:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2018-11-23 10:17:34,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:34,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:34,549 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 95 states. [2018-11-23 10:17:34,549 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 95 states. [2018-11-23 10:17:34,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:34,556 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2018-11-23 10:17:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2018-11-23 10:17:34,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:34,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:34,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:34,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 10:17:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-23 10:17:34,561 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 26 [2018-11-23 10:17:34,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:34,561 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2018-11-23 10:17:34,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:17:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 10:17:34,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 10:17:34,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:34,563 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:34,563 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:34,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:34,564 INFO L82 PathProgramCache]: Analyzing trace with hash 14864557, now seen corresponding path program 3 times [2018-11-23 10:17:34,564 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:34,564 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:17:34,584 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:17:35,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 10:17:35,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:17:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:35,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:35,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {1291#true} call ULTIMATE.init(); {1291#true} is VALID [2018-11-23 10:17:35,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {1291#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1291#true} is VALID [2018-11-23 10:17:35,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {1291#true} assume true; {1291#true} is VALID [2018-11-23 10:17:35,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1291#true} {1291#true} #59#return; {1291#true} is VALID [2018-11-23 10:17:35,780 INFO L256 TraceCheckUtils]: 4: Hoare triple {1291#true} call #t~ret4 := main(); {1291#true} is VALID [2018-11-23 10:17:35,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {1291#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1311#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:35,781 INFO L273 TraceCheckUtils]: 6: Hoare triple {1311#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1311#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:35,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#(= main_~i~0 (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1311#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:35,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {1311#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1321#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {1321#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1321#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {1321#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1321#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {1321#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1331#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:17:35,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {1331#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1331#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:17:35,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {1331#(= (_ bv4 32) main_~i~0)} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1331#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:17:35,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(= (_ bv4 32) main_~i~0)} ~i~0 := ~bvadd32(2bv32, ~i~0); {1341#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {1341#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1341#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {1341#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1341#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {1341#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1351#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {1351#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1351#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {1351#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1351#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {1351#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1361#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {1361#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1361#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {1361#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1361#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {1361#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1371#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:17:35,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {1371#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1371#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:17:35,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {1371#(= (_ bv12 32) main_~i~0)} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1371#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:17:35,814 INFO L273 TraceCheckUtils]: 26: Hoare triple {1371#(= (_ bv12 32) main_~i~0)} ~i~0 := ~bvadd32(2bv32, ~i~0); {1381#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {1381#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1381#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {1381#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1381#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {1381#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1391#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,854 INFO L273 TraceCheckUtils]: 30: Hoare triple {1391#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1391#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,854 INFO L273 TraceCheckUtils]: 31: Hoare triple {1391#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1391#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,855 INFO L273 TraceCheckUtils]: 32: Hoare triple {1391#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1401#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,855 INFO L273 TraceCheckUtils]: 33: Hoare triple {1401#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1401#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,856 INFO L273 TraceCheckUtils]: 34: Hoare triple {1401#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1401#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,856 INFO L273 TraceCheckUtils]: 35: Hoare triple {1401#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1411#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:35,857 INFO L273 TraceCheckUtils]: 36: Hoare triple {1411#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1292#false} is VALID [2018-11-23 10:17:35,857 INFO L273 TraceCheckUtils]: 37: Hoare triple {1292#false} ~i~0 := 0bv32; {1292#false} is VALID [2018-11-23 10:17:35,858 INFO L273 TraceCheckUtils]: 38: Hoare triple {1292#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1292#false} is VALID [2018-11-23 10:17:35,858 INFO L273 TraceCheckUtils]: 39: Hoare triple {1292#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1292#false} is VALID [2018-11-23 10:17:35,858 INFO L256 TraceCheckUtils]: 40: Hoare triple {1292#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {1292#false} is VALID [2018-11-23 10:17:35,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {1292#false} ~cond := #in~cond; {1292#false} is VALID [2018-11-23 10:17:35,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {1292#false} assume 0bv32 == ~cond; {1292#false} is VALID [2018-11-23 10:17:35,859 INFO L273 TraceCheckUtils]: 43: Hoare triple {1292#false} assume !false; {1292#false} is VALID [2018-11-23 10:17:35,864 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:17:35,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:36,332 INFO L273 TraceCheckUtils]: 43: Hoare triple {1292#false} assume !false; {1292#false} is VALID [2018-11-23 10:17:36,332 INFO L273 TraceCheckUtils]: 42: Hoare triple {1292#false} assume 0bv32 == ~cond; {1292#false} is VALID [2018-11-23 10:17:36,333 INFO L273 TraceCheckUtils]: 41: Hoare triple {1292#false} ~cond := #in~cond; {1292#false} is VALID [2018-11-23 10:17:36,333 INFO L256 TraceCheckUtils]: 40: Hoare triple {1292#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {1292#false} is VALID [2018-11-23 10:17:36,333 INFO L273 TraceCheckUtils]: 39: Hoare triple {1292#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1292#false} is VALID [2018-11-23 10:17:36,334 INFO L273 TraceCheckUtils]: 38: Hoare triple {1292#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1292#false} is VALID [2018-11-23 10:17:36,334 INFO L273 TraceCheckUtils]: 37: Hoare triple {1292#false} ~i~0 := 0bv32; {1292#false} is VALID [2018-11-23 10:17:36,335 INFO L273 TraceCheckUtils]: 36: Hoare triple {1457#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1292#false} is VALID [2018-11-23 10:17:36,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {1461#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1457#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:17:36,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {1461#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1461#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {1461#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1461#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,345 INFO L273 TraceCheckUtils]: 32: Hoare triple {1471#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1461#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,345 INFO L273 TraceCheckUtils]: 31: Hoare triple {1471#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1471#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {1471#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1471#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,352 INFO L273 TraceCheckUtils]: 29: Hoare triple {1481#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1471#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,353 INFO L273 TraceCheckUtils]: 28: Hoare triple {1481#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1481#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,353 INFO L273 TraceCheckUtils]: 27: Hoare triple {1481#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1481#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,359 INFO L273 TraceCheckUtils]: 26: Hoare triple {1491#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1481#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,360 INFO L273 TraceCheckUtils]: 25: Hoare triple {1491#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1491#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,361 INFO L273 TraceCheckUtils]: 24: Hoare triple {1491#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1491#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {1501#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1491#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {1501#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1501#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,365 INFO L273 TraceCheckUtils]: 21: Hoare triple {1501#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1501#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,371 INFO L273 TraceCheckUtils]: 20: Hoare triple {1511#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1501#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {1511#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1511#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {1511#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1511#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {1521#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1511#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,377 INFO L273 TraceCheckUtils]: 16: Hoare triple {1521#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1521#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {1521#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1521#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {1531#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1521#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {1531#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1531#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {1531#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1531#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {1541#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1531#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {1541#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1541#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {1541#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1541#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,395 INFO L273 TraceCheckUtils]: 8: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {1541#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1551#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1551#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,396 INFO L273 TraceCheckUtils]: 5: Hoare triple {1291#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1551#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {1291#true} call #t~ret4 := main(); {1291#true} is VALID [2018-11-23 10:17:36,397 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1291#true} {1291#true} #59#return; {1291#true} is VALID [2018-11-23 10:17:36,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {1291#true} assume true; {1291#true} is VALID [2018-11-23 10:17:36,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {1291#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1291#true} is VALID [2018-11-23 10:17:36,397 INFO L256 TraceCheckUtils]: 0: Hoare triple {1291#true} call ULTIMATE.init(); {1291#true} is VALID [2018-11-23 10:17:36,402 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:17:36,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:36,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:17:36,413 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-11-23 10:17:36,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:36,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:17:36,654 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:17:36,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:17:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:17:36,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:17:36,655 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 24 states. [2018-11-23 10:17:45,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:45,500 INFO L93 Difference]: Finished difference Result 203 states and 282 transitions. [2018-11-23 10:17:45,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:17:45,500 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-11-23 10:17:45,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:17:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 282 transitions. [2018-11-23 10:17:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:17:45,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 282 transitions. [2018-11-23 10:17:45,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 282 transitions. [2018-11-23 10:17:46,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 282 edges. 282 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:46,085 INFO L225 Difference]: With dead ends: 203 [2018-11-23 10:17:46,085 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 10:17:46,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:17:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 10:17:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 85. [2018-11-23 10:17:46,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:46,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 85 states. [2018-11-23 10:17:46,196 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 85 states. [2018-11-23 10:17:46,196 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 85 states. [2018-11-23 10:17:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:46,208 INFO L93 Difference]: Finished difference Result 191 states and 257 transitions. [2018-11-23 10:17:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 257 transitions. [2018-11-23 10:17:46,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:46,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:46,211 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 191 states. [2018-11-23 10:17:46,211 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 191 states. [2018-11-23 10:17:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:46,222 INFO L93 Difference]: Finished difference Result 191 states and 257 transitions. [2018-11-23 10:17:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 257 transitions. [2018-11-23 10:17:46,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:46,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:46,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:46,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 10:17:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2018-11-23 10:17:46,227 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 44 [2018-11-23 10:17:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:46,228 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2018-11-23 10:17:46,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:17:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-11-23 10:17:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 10:17:46,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:46,230 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:46,231 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:46,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:46,231 INFO L82 PathProgramCache]: Analyzing trace with hash -485176851, now seen corresponding path program 4 times [2018-11-23 10:17:46,232 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:46,232 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:17:46,255 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:17:46,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:17:46,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:17:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:46,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:47,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {2374#true} call ULTIMATE.init(); {2374#true} is VALID [2018-11-23 10:17:47,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {2374#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2374#true} is VALID [2018-11-23 10:17:47,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {2374#true} assume true; {2374#true} is VALID [2018-11-23 10:17:47,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2374#true} {2374#true} #59#return; {2374#true} is VALID [2018-11-23 10:17:47,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {2374#true} call #t~ret4 := main(); {2374#true} is VALID [2018-11-23 10:17:47,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {2374#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2394#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:47,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {2394#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2394#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:47,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {2394#(= main_~i~0 (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2394#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:47,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {2394#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2404#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {2404#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2404#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {2404#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2404#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {2404#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2414#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {2414#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2414#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,866 INFO L273 TraceCheckUtils]: 13: Hoare triple {2414#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2414#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {2414#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2424#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:17:47,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {2424#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2424#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:17:47,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {2424#(= (_ bv6 32) main_~i~0)} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2424#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:17:47,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {2424#(= (_ bv6 32) main_~i~0)} ~i~0 := ~bvadd32(2bv32, ~i~0); {2434#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {2434#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2434#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,871 INFO L273 TraceCheckUtils]: 19: Hoare triple {2434#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2434#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {2434#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2444#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {2444#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2444#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {2444#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2444#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {2444#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2454#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:17:47,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {2454#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2454#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:17:47,878 INFO L273 TraceCheckUtils]: 25: Hoare triple {2454#(= (_ bv12 32) main_~i~0)} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2454#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:17:47,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {2454#(= (_ bv12 32) main_~i~0)} ~i~0 := ~bvadd32(2bv32, ~i~0); {2464#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {2464#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2464#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,882 INFO L273 TraceCheckUtils]: 28: Hoare triple {2464#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2464#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {2464#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2474#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,883 INFO L273 TraceCheckUtils]: 30: Hoare triple {2474#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2474#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {2474#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2474#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {2474#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2484#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:17:47,889 INFO L273 TraceCheckUtils]: 33: Hoare triple {2484#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2484#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:17:47,891 INFO L273 TraceCheckUtils]: 34: Hoare triple {2484#(= (_ bv18 32) main_~i~0)} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2484#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:17:47,891 INFO L273 TraceCheckUtils]: 35: Hoare triple {2484#(= (_ bv18 32) main_~i~0)} ~i~0 := ~bvadd32(2bv32, ~i~0); {2494#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,891 INFO L273 TraceCheckUtils]: 36: Hoare triple {2494#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2494#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {2494#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2494#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,892 INFO L273 TraceCheckUtils]: 38: Hoare triple {2494#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2504#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,893 INFO L273 TraceCheckUtils]: 39: Hoare triple {2504#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2504#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,893 INFO L273 TraceCheckUtils]: 40: Hoare triple {2504#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2504#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,894 INFO L273 TraceCheckUtils]: 41: Hoare triple {2504#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2514#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,894 INFO L273 TraceCheckUtils]: 42: Hoare triple {2514#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2514#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,895 INFO L273 TraceCheckUtils]: 43: Hoare triple {2514#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2514#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,896 INFO L273 TraceCheckUtils]: 44: Hoare triple {2514#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2524#(= (_ bv26 32) main_~i~0)} is VALID [2018-11-23 10:17:47,896 INFO L273 TraceCheckUtils]: 45: Hoare triple {2524#(= (_ bv26 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2524#(= (_ bv26 32) main_~i~0)} is VALID [2018-11-23 10:17:47,897 INFO L273 TraceCheckUtils]: 46: Hoare triple {2524#(= (_ bv26 32) main_~i~0)} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2524#(= (_ bv26 32) main_~i~0)} is VALID [2018-11-23 10:17:47,899 INFO L273 TraceCheckUtils]: 47: Hoare triple {2524#(= (_ bv26 32) main_~i~0)} ~i~0 := ~bvadd32(2bv32, ~i~0); {2534#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,900 INFO L273 TraceCheckUtils]: 48: Hoare triple {2534#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2534#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,901 INFO L273 TraceCheckUtils]: 49: Hoare triple {2534#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2534#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,901 INFO L273 TraceCheckUtils]: 50: Hoare triple {2534#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2544#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,902 INFO L273 TraceCheckUtils]: 51: Hoare triple {2544#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2544#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,904 INFO L273 TraceCheckUtils]: 52: Hoare triple {2544#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2544#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,907 INFO L273 TraceCheckUtils]: 53: Hoare triple {2544#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2554#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,909 INFO L273 TraceCheckUtils]: 54: Hoare triple {2554#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2554#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,909 INFO L273 TraceCheckUtils]: 55: Hoare triple {2554#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2554#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,910 INFO L273 TraceCheckUtils]: 56: Hoare triple {2554#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2564#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,911 INFO L273 TraceCheckUtils]: 57: Hoare triple {2564#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2564#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,911 INFO L273 TraceCheckUtils]: 58: Hoare triple {2564#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2564#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,912 INFO L273 TraceCheckUtils]: 59: Hoare triple {2564#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2574#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,913 INFO L273 TraceCheckUtils]: 60: Hoare triple {2574#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2574#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,913 INFO L273 TraceCheckUtils]: 61: Hoare triple {2574#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2574#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,914 INFO L273 TraceCheckUtils]: 62: Hoare triple {2574#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2584#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,915 INFO L273 TraceCheckUtils]: 63: Hoare triple {2584#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2584#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,915 INFO L273 TraceCheckUtils]: 64: Hoare triple {2584#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2584#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,916 INFO L273 TraceCheckUtils]: 65: Hoare triple {2584#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2594#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,917 INFO L273 TraceCheckUtils]: 66: Hoare triple {2594#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2594#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,917 INFO L273 TraceCheckUtils]: 67: Hoare triple {2594#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2594#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,918 INFO L273 TraceCheckUtils]: 68: Hoare triple {2594#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2604#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,919 INFO L273 TraceCheckUtils]: 69: Hoare triple {2604#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2604#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,919 INFO L273 TraceCheckUtils]: 70: Hoare triple {2604#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2604#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,920 INFO L273 TraceCheckUtils]: 71: Hoare triple {2604#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2614#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,921 INFO L273 TraceCheckUtils]: 72: Hoare triple {2614#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2375#false} is VALID [2018-11-23 10:17:47,921 INFO L273 TraceCheckUtils]: 73: Hoare triple {2375#false} ~i~0 := 0bv32; {2375#false} is VALID [2018-11-23 10:17:47,921 INFO L273 TraceCheckUtils]: 74: Hoare triple {2375#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2375#false} is VALID [2018-11-23 10:17:47,921 INFO L273 TraceCheckUtils]: 75: Hoare triple {2375#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2375#false} is VALID [2018-11-23 10:17:47,922 INFO L256 TraceCheckUtils]: 76: Hoare triple {2375#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {2375#false} is VALID [2018-11-23 10:17:47,922 INFO L273 TraceCheckUtils]: 77: Hoare triple {2375#false} ~cond := #in~cond; {2375#false} is VALID [2018-11-23 10:17:47,922 INFO L273 TraceCheckUtils]: 78: Hoare triple {2375#false} assume 0bv32 == ~cond; {2375#false} is VALID [2018-11-23 10:17:47,922 INFO L273 TraceCheckUtils]: 79: Hoare triple {2375#false} assume !false; {2375#false} is VALID [2018-11-23 10:17:47,930 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:17:47,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:49,677 INFO L273 TraceCheckUtils]: 79: Hoare triple {2375#false} assume !false; {2375#false} is VALID [2018-11-23 10:17:49,677 INFO L273 TraceCheckUtils]: 78: Hoare triple {2375#false} assume 0bv32 == ~cond; {2375#false} is VALID [2018-11-23 10:17:49,678 INFO L273 TraceCheckUtils]: 77: Hoare triple {2375#false} ~cond := #in~cond; {2375#false} is VALID [2018-11-23 10:17:49,678 INFO L256 TraceCheckUtils]: 76: Hoare triple {2375#false} call __VERIFIER_assert((if 20bv32 == #t~mem3 then 1bv32 else 0bv32)); {2375#false} is VALID [2018-11-23 10:17:49,678 INFO L273 TraceCheckUtils]: 75: Hoare triple {2375#false} assume 10bv32 == #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2375#false} is VALID [2018-11-23 10:17:49,678 INFO L273 TraceCheckUtils]: 74: Hoare triple {2375#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2375#false} is VALID [2018-11-23 10:17:49,678 INFO L273 TraceCheckUtils]: 73: Hoare triple {2375#false} ~i~0 := 0bv32; {2375#false} is VALID [2018-11-23 10:17:49,696 INFO L273 TraceCheckUtils]: 72: Hoare triple {2660#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2375#false} is VALID [2018-11-23 10:17:49,697 INFO L273 TraceCheckUtils]: 71: Hoare triple {2664#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2660#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:17:49,698 INFO L273 TraceCheckUtils]: 70: Hoare triple {2664#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2664#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,698 INFO L273 TraceCheckUtils]: 69: Hoare triple {2664#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2664#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,703 INFO L273 TraceCheckUtils]: 68: Hoare triple {2674#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2664#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,704 INFO L273 TraceCheckUtils]: 67: Hoare triple {2674#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2674#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,704 INFO L273 TraceCheckUtils]: 66: Hoare triple {2674#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2674#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,709 INFO L273 TraceCheckUtils]: 65: Hoare triple {2684#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2674#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,710 INFO L273 TraceCheckUtils]: 64: Hoare triple {2684#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2684#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,710 INFO L273 TraceCheckUtils]: 63: Hoare triple {2684#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2684#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,716 INFO L273 TraceCheckUtils]: 62: Hoare triple {2694#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2684#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,716 INFO L273 TraceCheckUtils]: 61: Hoare triple {2694#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2694#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,717 INFO L273 TraceCheckUtils]: 60: Hoare triple {2694#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2694#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,721 INFO L273 TraceCheckUtils]: 59: Hoare triple {2704#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2694#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,722 INFO L273 TraceCheckUtils]: 58: Hoare triple {2704#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2704#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,722 INFO L273 TraceCheckUtils]: 57: Hoare triple {2704#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2704#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,726 INFO L273 TraceCheckUtils]: 56: Hoare triple {2714#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2704#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,727 INFO L273 TraceCheckUtils]: 55: Hoare triple {2714#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2714#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,727 INFO L273 TraceCheckUtils]: 54: Hoare triple {2714#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2714#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,732 INFO L273 TraceCheckUtils]: 53: Hoare triple {2724#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2714#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,732 INFO L273 TraceCheckUtils]: 52: Hoare triple {2724#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2724#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,733 INFO L273 TraceCheckUtils]: 51: Hoare triple {2724#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2724#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,738 INFO L273 TraceCheckUtils]: 50: Hoare triple {2734#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2724#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,738 INFO L273 TraceCheckUtils]: 49: Hoare triple {2734#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2734#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,738 INFO L273 TraceCheckUtils]: 48: Hoare triple {2734#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2734#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {2744#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2734#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,744 INFO L273 TraceCheckUtils]: 46: Hoare triple {2744#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2744#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,744 INFO L273 TraceCheckUtils]: 45: Hoare triple {2744#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2744#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,748 INFO L273 TraceCheckUtils]: 44: Hoare triple {2754#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2744#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,748 INFO L273 TraceCheckUtils]: 43: Hoare triple {2754#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2754#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,749 INFO L273 TraceCheckUtils]: 42: Hoare triple {2754#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2754#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,753 INFO L273 TraceCheckUtils]: 41: Hoare triple {2764#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2754#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {2764#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2764#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,754 INFO L273 TraceCheckUtils]: 39: Hoare triple {2764#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2764#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,759 INFO L273 TraceCheckUtils]: 38: Hoare triple {2774#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2764#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,759 INFO L273 TraceCheckUtils]: 37: Hoare triple {2774#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2774#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,760 INFO L273 TraceCheckUtils]: 36: Hoare triple {2774#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2774#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,765 INFO L273 TraceCheckUtils]: 35: Hoare triple {2784#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2774#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,765 INFO L273 TraceCheckUtils]: 34: Hoare triple {2784#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2784#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,766 INFO L273 TraceCheckUtils]: 33: Hoare triple {2784#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2784#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,770 INFO L273 TraceCheckUtils]: 32: Hoare triple {2794#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2784#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {2794#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2794#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,771 INFO L273 TraceCheckUtils]: 30: Hoare triple {2794#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2794#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,775 INFO L273 TraceCheckUtils]: 29: Hoare triple {2804#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2794#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,776 INFO L273 TraceCheckUtils]: 28: Hoare triple {2804#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2804#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {2804#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2804#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,781 INFO L273 TraceCheckUtils]: 26: Hoare triple {2814#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2804#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,781 INFO L273 TraceCheckUtils]: 25: Hoare triple {2814#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2814#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {2814#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2814#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {2824#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2814#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,788 INFO L273 TraceCheckUtils]: 22: Hoare triple {2824#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2824#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {2824#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2824#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {2834#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2824#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,794 INFO L273 TraceCheckUtils]: 19: Hoare triple {2834#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2834#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {2834#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2834#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {2844#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2834#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {2844#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2844#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {2844#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2844#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {2854#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2844#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {2854#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2854#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {2854#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2854#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,817 INFO L273 TraceCheckUtils]: 11: Hoare triple {2864#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2854#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {2864#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2864#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {2864#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2864#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {2874#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(2bv32, ~i~0); {2864#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {2874#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume 10bv32 == #t~mem1;havoc #t~mem1;call write~intINTTYPE4(20bv32, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2874#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {2874#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(#t~nondet0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2874#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {2374#true} havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2874#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:49,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {2374#true} call #t~ret4 := main(); {2374#true} is VALID [2018-11-23 10:17:49,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2374#true} {2374#true} #59#return; {2374#true} is VALID [2018-11-23 10:17:49,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {2374#true} assume true; {2374#true} is VALID [2018-11-23 10:17:49,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {2374#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2374#true} is VALID [2018-11-23 10:17:49,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {2374#true} call ULTIMATE.init(); {2374#true} is VALID [2018-11-23 10:17:49,836 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:17:49,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:49,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:17:49,839 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 80 [2018-11-23 10:17:49,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:49,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:17:50,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:50,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:17:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:17:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:17:50,189 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand 48 states. [2018-11-23 10:17:58,117 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:17:58,610 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:17:59,110 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:17:59,634 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:18:00,159 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:18:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:28,057 INFO L93 Difference]: Finished difference Result 395 states and 558 transitions. [2018-11-23 10:18:28,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:18:28,057 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 80 [2018-11-23 10:18:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:18:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:18:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 558 transitions. [2018-11-23 10:18:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:18:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 558 transitions. [2018-11-23 10:18:28,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 558 transitions. [2018-11-23 10:18:29,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 558 edges. 558 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:18:29,079 INFO L225 Difference]: With dead ends: 395 [2018-11-23 10:18:29,080 INFO L226 Difference]: Without dead ends: 383 [2018-11-23 10:18:29,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:18:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-11-23 10:18:29,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 157. [2018-11-23 10:18:29,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:18:29,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand 157 states. [2018-11-23 10:18:29,663 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand 157 states. [2018-11-23 10:18:29,663 INFO L87 Difference]: Start difference. First operand 383 states. Second operand 157 states. [2018-11-23 10:18:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:29,683 INFO L93 Difference]: Finished difference Result 383 states and 521 transitions. [2018-11-23 10:18:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 521 transitions. [2018-11-23 10:18:29,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:29,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:29,685 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 383 states. [2018-11-23 10:18:29,685 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 383 states. [2018-11-23 10:18:29,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:29,706 INFO L93 Difference]: Finished difference Result 383 states and 521 transitions. [2018-11-23 10:18:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 521 transitions. [2018-11-23 10:18:29,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:29,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:29,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:18:29,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:18:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-23 10:18:29,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2018-11-23 10:18:29,714 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 205 transitions. Word has length 80 [2018-11-23 10:18:29,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:18:29,714 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-23 10:18:29,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:18:29,714 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 205 transitions. [2018-11-23 10:18:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 10:18:29,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:18:29,716 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:18:29,717 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:18:29,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:18:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash -682763155, now seen corresponding path program 5 times [2018-11-23 10:18:29,718 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:18:29,718 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:18:29,740 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1