java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copyInitSum_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:06:01,173 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:06:01,175 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:06:01,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:06:01,188 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:06:01,189 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:06:01,190 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:06:01,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:06:01,193 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:06:01,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:06:01,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:06:01,196 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:06:01,197 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:06:01,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:06:01,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:06:01,199 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:06:01,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:06:01,202 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:06:01,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:06:01,206 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:06:01,207 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:06:01,208 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:06:01,211 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:06:01,211 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:06:01,211 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:06:01,212 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:06:01,213 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:06:01,214 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:06:01,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:06:01,216 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:06:01,216 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:06:01,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:06:01,217 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:06:01,217 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:06:01,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:06:01,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:06:01,219 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:06:01,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:06:01,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:06:01,245 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:06:01,245 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:06:01,246 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:06:01,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:06:01,246 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:06:01,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:06:01,248 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:06:01,248 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:06:01,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:06:01,248 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:06:01,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:06:01,249 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:06:01,249 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:06:01,249 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:06:01,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:06:01,249 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:06:01,249 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:06:01,250 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:06:01,250 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:06:01,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:06:01,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:06:01,250 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:06:01,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:06:01,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:06:01,252 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:06:01,253 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:06:01,253 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:06:01,253 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:06:01,253 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:06:01,253 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:06:01,253 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:06:01,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:06:01,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:06:01,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:06:01,342 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:06:01,342 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:06:01,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum_true-unreach-call_ground.i [2018-11-23 10:06:01,408 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eca787c3/53e95a5a0d51478fae41c6a09d728907/FLAG646d6d6c7 [2018-11-23 10:06:01,845 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:06:01,846 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum_true-unreach-call_ground.i [2018-11-23 10:06:01,852 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eca787c3/53e95a5a0d51478fae41c6a09d728907/FLAG646d6d6c7 [2018-11-23 10:06:02,223 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9eca787c3/53e95a5a0d51478fae41c6a09d728907 [2018-11-23 10:06:02,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:06:02,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:06:02,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:06:02,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:06:02,239 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:06:02,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:02" (1/1) ... [2018-11-23 10:06:02,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebe11df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02, skipping insertion in model container [2018-11-23 10:06:02,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:02" (1/1) ... [2018-11-23 10:06:02,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:06:02,279 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:06:02,554 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:06:02,562 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:06:02,591 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:06:02,625 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:06:02,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02 WrapperNode [2018-11-23 10:06:02,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:06:02,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:06:02,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:06:02,627 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:06:02,638 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:06:02" (1/1) ... [2018-11-23 10:06:02,651 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:06:02" (1/1) ... [2018-11-23 10:06:02,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:06:02,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:06:02,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:06:02,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:06:02,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02" (1/1) ... [2018-11-23 10:06:02,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02" (1/1) ... [2018-11-23 10:06:02,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02" (1/1) ... [2018-11-23 10:06:02,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02" (1/1) ... [2018-11-23 10:06:02,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02" (1/1) ... [2018-11-23 10:06:02,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02" (1/1) ... [2018-11-23 10:06:02,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02" (1/1) ... [2018-11-23 10:06:02,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:06:02,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:06:02,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:06:02,720 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:06:02,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02" (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:06:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:06:02,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:06:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:06:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:06:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:06:02,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:06:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:06:02,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:06:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:06:02,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:06:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:06:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:06:03,451 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:06:03,452 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 10:06:03,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:03 BoogieIcfgContainer [2018-11-23 10:06:03,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:06:03,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:06:03,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:06:03,456 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:06:03,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:02" (1/3) ... [2018-11-23 10:06:03,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51635119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:03, skipping insertion in model container [2018-11-23 10:06:03,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:02" (2/3) ... [2018-11-23 10:06:03,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51635119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:03, skipping insertion in model container [2018-11-23 10:06:03,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:03" (3/3) ... [2018-11-23 10:06:03,459 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum_true-unreach-call_ground.i [2018-11-23 10:06:03,469 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:06:03,477 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:06:03,496 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:06:03,529 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:06:03,530 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:06:03,530 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:06:03,531 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:06:03,531 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:06:03,531 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:06:03,531 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:06:03,531 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:06:03,532 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:06:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 10:06:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:06:03,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:03,558 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:06:03,561 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:03,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:03,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1001985310, now seen corresponding path program 1 times [2018-11-23 10:06:03,571 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:03,572 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:06:03,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:03,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:03,985 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 10:06:03,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32#true} is VALID [2018-11-23 10:06:03,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 10:06:03,992 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #76#return; {32#true} is VALID [2018-11-23 10:06:03,992 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret7 := main(); {32#true} is VALID [2018-11-23 10:06:03,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {32#true} is VALID [2018-11-23 10:06:04,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 10:06:04,007 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-23 10:06:04,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !~bvslt32(~i~0, 100000bv32); {33#false} is VALID [2018-11-23 10:06:04,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-23 10:06:04,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !~bvslt32(~i~0, 100000bv32); {33#false} is VALID [2018-11-23 10:06:04,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} havoc ~x~0;~x~0 := 0bv32; {33#false} is VALID [2018-11-23 10:06:04,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {33#false} is VALID [2018-11-23 10:06:04,009 INFO L256 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-23 10:06:04,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 10:06:04,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0bv32 == ~cond; {33#false} is VALID [2018-11-23 10:06:04,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 10:06:04,014 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:06:04,014 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:06:04,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:06:04,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:06:04,026 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 10:06:04,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:04,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:06:04,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:04,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:06:04,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:06:04,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:06:04,150 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 10:06:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:04,266 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2018-11-23 10:06:04,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:06:04,267 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 10:06:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:06:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 10:06:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:06:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 10:06:04,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-23 10:06:04,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:04,594 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:06:04,595 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 10:06:04,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:06:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 10:06:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 10:06:04,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:04,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 10:06:04,642 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 10:06:04,642 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 10:06:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:04,648 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 10:06:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 10:06:04,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:04,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:04,649 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 10:06:04,649 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 10:06:04,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:04,654 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 10:06:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 10:06:04,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:04,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:04,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:04,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:06:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 10:06:04,660 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2018-11-23 10:06:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:04,661 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 10:06:04,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:06:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 10:06:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:06:04,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:04,663 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:06:04,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:04,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash -400143846, now seen corresponding path program 1 times [2018-11-23 10:06:04,664 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:04,664 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:06:04,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:04,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:04,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {232#true} is VALID [2018-11-23 10:06:04,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {232#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {232#true} is VALID [2018-11-23 10:06:04,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2018-11-23 10:06:04,835 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #76#return; {232#true} is VALID [2018-11-23 10:06:04,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret7 := main(); {232#true} is VALID [2018-11-23 10:06:04,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {232#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {252#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:04,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {252#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {233#false} is VALID [2018-11-23 10:06:04,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#false} ~i~0 := 0bv32; {233#false} is VALID [2018-11-23 10:06:04,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#false} assume !~bvslt32(~i~0, 100000bv32); {233#false} is VALID [2018-11-23 10:06:04,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {233#false} ~i~0 := 0bv32; {233#false} is VALID [2018-11-23 10:06:04,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {233#false} assume !~bvslt32(~i~0, 100000bv32); {233#false} is VALID [2018-11-23 10:06:04,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {233#false} havoc ~x~0;~x~0 := 0bv32; {233#false} is VALID [2018-11-23 10:06:04,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {233#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {233#false} is VALID [2018-11-23 10:06:04,842 INFO L256 TraceCheckUtils]: 13: Hoare triple {233#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {233#false} is VALID [2018-11-23 10:06:04,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {233#false} ~cond := #in~cond; {233#false} is VALID [2018-11-23 10:06:04,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {233#false} assume 0bv32 == ~cond; {233#false} is VALID [2018-11-23 10:06:04,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {233#false} assume !false; {233#false} is VALID [2018-11-23 10:06:04,845 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:06:04,845 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:06:04,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:06:04,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:06:04,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:06:04,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:04,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:06:04,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:04,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:06:04,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:06:04,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:06:04,908 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-11-23 10:06:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:05,428 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 10:06:05,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:06:05,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:06:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:05,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:06:05,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:06:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:06:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:06:05,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 10:06:05,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:05,621 INFO L225 Difference]: With dead ends: 46 [2018-11-23 10:06:05,621 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:06:05,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:06:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:06:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 10:06:05,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:05,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 10:06:05,642 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 10:06:05,642 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 10:06:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:05,645 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 10:06:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 10:06:05,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:05,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:05,647 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 10:06:05,647 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 10:06:05,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:05,650 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 10:06:05,650 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 10:06:05,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:05,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:05,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:05,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:06:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 10:06:05,654 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2018-11-23 10:06:05,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:05,655 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 10:06:05,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:06:05,655 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:06:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:06:05,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:05,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:05,657 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:05,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:05,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1150570790, now seen corresponding path program 1 times [2018-11-23 10:06:05,658 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:05,658 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:06:05,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:05,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:05,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {447#true} is VALID [2018-11-23 10:06:05,913 INFO L273 TraceCheckUtils]: 1: Hoare triple {447#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {447#true} is VALID [2018-11-23 10:06:05,913 INFO L273 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2018-11-23 10:06:05,914 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #76#return; {447#true} is VALID [2018-11-23 10:06:05,914 INFO L256 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret7 := main(); {447#true} is VALID [2018-11-23 10:06:05,917 INFO L273 TraceCheckUtils]: 5: Hoare triple {447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {467#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:05,918 INFO L273 TraceCheckUtils]: 6: Hoare triple {467#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {471#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:05,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {471#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 10:06:05,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {448#false} ~i~0 := 0bv32; {448#false} is VALID [2018-11-23 10:06:05,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {448#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {448#false} is VALID [2018-11-23 10:06:05,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {448#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {448#false} is VALID [2018-11-23 10:06:05,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {448#false} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 10:06:05,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {448#false} ~i~0 := 0bv32; {448#false} is VALID [2018-11-23 10:06:05,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {448#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {448#false} is VALID [2018-11-23 10:06:05,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {448#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {448#false} is VALID [2018-11-23 10:06:05,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {448#false} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 10:06:05,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {448#false} havoc ~x~0;~x~0 := 0bv32; {448#false} is VALID [2018-11-23 10:06:05,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {448#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {448#false} is VALID [2018-11-23 10:06:05,938 INFO L256 TraceCheckUtils]: 18: Hoare triple {448#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {448#false} is VALID [2018-11-23 10:06:05,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {448#false} ~cond := #in~cond; {448#false} is VALID [2018-11-23 10:06:05,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {448#false} assume 0bv32 == ~cond; {448#false} is VALID [2018-11-23 10:06:05,939 INFO L273 TraceCheckUtils]: 21: Hoare triple {448#false} assume !false; {448#false} is VALID [2018-11-23 10:06:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:06:05,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:06,042 INFO L273 TraceCheckUtils]: 21: Hoare triple {448#false} assume !false; {448#false} is VALID [2018-11-23 10:06:06,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {448#false} assume 0bv32 == ~cond; {448#false} is VALID [2018-11-23 10:06:06,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {448#false} ~cond := #in~cond; {448#false} is VALID [2018-11-23 10:06:06,043 INFO L256 TraceCheckUtils]: 18: Hoare triple {448#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {448#false} is VALID [2018-11-23 10:06:06,043 INFO L273 TraceCheckUtils]: 17: Hoare triple {448#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {448#false} is VALID [2018-11-23 10:06:06,044 INFO L273 TraceCheckUtils]: 16: Hoare triple {448#false} havoc ~x~0;~x~0 := 0bv32; {448#false} is VALID [2018-11-23 10:06:06,044 INFO L273 TraceCheckUtils]: 15: Hoare triple {448#false} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 10:06:06,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {448#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {448#false} is VALID [2018-11-23 10:06:06,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {448#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {448#false} is VALID [2018-11-23 10:06:06,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {448#false} ~i~0 := 0bv32; {448#false} is VALID [2018-11-23 10:06:06,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {448#false} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 10:06:06,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {448#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {448#false} is VALID [2018-11-23 10:06:06,046 INFO L273 TraceCheckUtils]: 9: Hoare triple {448#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {448#false} is VALID [2018-11-23 10:06:06,046 INFO L273 TraceCheckUtils]: 8: Hoare triple {448#false} ~i~0 := 0bv32; {448#false} is VALID [2018-11-23 10:06:06,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {559#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 10:06:06,053 INFO L273 TraceCheckUtils]: 6: Hoare triple {563#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {559#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:06,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {563#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:06,055 INFO L256 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret7 := main(); {447#true} is VALID [2018-11-23 10:06:06,055 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #76#return; {447#true} is VALID [2018-11-23 10:06:06,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2018-11-23 10:06:06,056 INFO L273 TraceCheckUtils]: 1: Hoare triple {447#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {447#true} is VALID [2018-11-23 10:06:06,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {447#true} is VALID [2018-11-23 10:06:06,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:06:06,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:06,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:06:06,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 10:06:06,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:06,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:06:06,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:06,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:06:06,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:06:06,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:06:06,123 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-11-23 10:06:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:07,075 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-23 10:06:07,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:06:07,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 10:06:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:06:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 10:06:07,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:06:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 10:06:07,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2018-11-23 10:06:07,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:07,222 INFO L225 Difference]: With dead ends: 61 [2018-11-23 10:06:07,223 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 10:06:07,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:06:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 10:06:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 10:06:07,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:07,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 10:06:07,292 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 10:06:07,292 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 10:06:07,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:07,296 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 10:06:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 10:06:07,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:07,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:07,298 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 10:06:07,298 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 10:06:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:07,301 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 10:06:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 10:06:07,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:07,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:07,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:07,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 10:06:07,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-23 10:06:07,306 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 22 [2018-11-23 10:06:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:07,306 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-23 10:06:07,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:06:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 10:06:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 10:06:07,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:07,308 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:07,308 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:07,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:07,309 INFO L82 PathProgramCache]: Analyzing trace with hash -125121014, now seen corresponding path program 2 times [2018-11-23 10:06:07,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:07,310 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:06:07,329 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:06:07,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:06:07,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:07,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:07,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {824#true} call ULTIMATE.init(); {824#true} is VALID [2018-11-23 10:06:07,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {824#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {824#true} is VALID [2018-11-23 10:06:07,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {824#true} assume true; {824#true} is VALID [2018-11-23 10:06:07,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {824#true} {824#true} #76#return; {824#true} is VALID [2018-11-23 10:06:07,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {824#true} call #t~ret7 := main(); {824#true} is VALID [2018-11-23 10:06:07,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {824#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {844#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:07,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {844#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {848#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:07,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {848#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {852#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:06:07,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {852#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {856#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:07,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {856#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {860#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:07,576 INFO L273 TraceCheckUtils]: 10: Hoare triple {860#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 10:06:07,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#false} ~i~0 := 0bv32; {825#false} is VALID [2018-11-23 10:06:07,577 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {825#false} is VALID [2018-11-23 10:06:07,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {825#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {825#false} is VALID [2018-11-23 10:06:07,577 INFO L273 TraceCheckUtils]: 14: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {825#false} is VALID [2018-11-23 10:06:07,578 INFO L273 TraceCheckUtils]: 15: Hoare triple {825#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {825#false} is VALID [2018-11-23 10:06:07,578 INFO L273 TraceCheckUtils]: 16: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {825#false} is VALID [2018-11-23 10:06:07,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {825#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {825#false} is VALID [2018-11-23 10:06:07,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {825#false} is VALID [2018-11-23 10:06:07,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {825#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {825#false} is VALID [2018-11-23 10:06:07,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {825#false} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 10:06:07,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {825#false} ~i~0 := 0bv32; {825#false} is VALID [2018-11-23 10:06:07,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {825#false} is VALID [2018-11-23 10:06:07,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {825#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {825#false} is VALID [2018-11-23 10:06:07,581 INFO L273 TraceCheckUtils]: 24: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {825#false} is VALID [2018-11-23 10:06:07,581 INFO L273 TraceCheckUtils]: 25: Hoare triple {825#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {825#false} is VALID [2018-11-23 10:06:07,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {825#false} is VALID [2018-11-23 10:06:07,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {825#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {825#false} is VALID [2018-11-23 10:06:07,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {825#false} is VALID [2018-11-23 10:06:07,582 INFO L273 TraceCheckUtils]: 29: Hoare triple {825#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {825#false} is VALID [2018-11-23 10:06:07,582 INFO L273 TraceCheckUtils]: 30: Hoare triple {825#false} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 10:06:07,583 INFO L273 TraceCheckUtils]: 31: Hoare triple {825#false} havoc ~x~0;~x~0 := 0bv32; {825#false} is VALID [2018-11-23 10:06:07,583 INFO L273 TraceCheckUtils]: 32: Hoare triple {825#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {825#false} is VALID [2018-11-23 10:06:07,583 INFO L256 TraceCheckUtils]: 33: Hoare triple {825#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {825#false} is VALID [2018-11-23 10:06:07,584 INFO L273 TraceCheckUtils]: 34: Hoare triple {825#false} ~cond := #in~cond; {825#false} is VALID [2018-11-23 10:06:07,584 INFO L273 TraceCheckUtils]: 35: Hoare triple {825#false} assume 0bv32 == ~cond; {825#false} is VALID [2018-11-23 10:06:07,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {825#false} assume !false; {825#false} is VALID [2018-11-23 10:06:07,587 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 10:06:07,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:07,831 INFO L273 TraceCheckUtils]: 36: Hoare triple {825#false} assume !false; {825#false} is VALID [2018-11-23 10:06:07,832 INFO L273 TraceCheckUtils]: 35: Hoare triple {825#false} assume 0bv32 == ~cond; {825#false} is VALID [2018-11-23 10:06:07,832 INFO L273 TraceCheckUtils]: 34: Hoare triple {825#false} ~cond := #in~cond; {825#false} is VALID [2018-11-23 10:06:07,832 INFO L256 TraceCheckUtils]: 33: Hoare triple {825#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {825#false} is VALID [2018-11-23 10:06:07,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {825#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {825#false} is VALID [2018-11-23 10:06:07,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {825#false} havoc ~x~0;~x~0 := 0bv32; {825#false} is VALID [2018-11-23 10:06:07,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {825#false} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 10:06:07,834 INFO L273 TraceCheckUtils]: 29: Hoare triple {825#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {825#false} is VALID [2018-11-23 10:06:07,835 INFO L273 TraceCheckUtils]: 28: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {825#false} is VALID [2018-11-23 10:06:07,835 INFO L273 TraceCheckUtils]: 27: Hoare triple {825#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {825#false} is VALID [2018-11-23 10:06:07,836 INFO L273 TraceCheckUtils]: 26: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {825#false} is VALID [2018-11-23 10:06:07,836 INFO L273 TraceCheckUtils]: 25: Hoare triple {825#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {825#false} is VALID [2018-11-23 10:06:07,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {825#false} is VALID [2018-11-23 10:06:07,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {825#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {825#false} is VALID [2018-11-23 10:06:07,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {825#false} is VALID [2018-11-23 10:06:07,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {825#false} ~i~0 := 0bv32; {825#false} is VALID [2018-11-23 10:06:07,838 INFO L273 TraceCheckUtils]: 20: Hoare triple {825#false} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 10:06:07,838 INFO L273 TraceCheckUtils]: 19: Hoare triple {825#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {825#false} is VALID [2018-11-23 10:06:07,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {825#false} is VALID [2018-11-23 10:06:07,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {825#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {825#false} is VALID [2018-11-23 10:06:07,839 INFO L273 TraceCheckUtils]: 16: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {825#false} is VALID [2018-11-23 10:06:07,839 INFO L273 TraceCheckUtils]: 15: Hoare triple {825#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {825#false} is VALID [2018-11-23 10:06:07,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {825#false} is VALID [2018-11-23 10:06:07,840 INFO L273 TraceCheckUtils]: 13: Hoare triple {825#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {825#false} is VALID [2018-11-23 10:06:07,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {825#false} is VALID [2018-11-23 10:06:07,840 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#false} ~i~0 := 0bv32; {825#false} is VALID [2018-11-23 10:06:07,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {1020#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 10:06:07,854 INFO L273 TraceCheckUtils]: 9: Hoare triple {1024#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1020#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:07,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {1028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1024#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:07,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {1032#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:07,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {1036#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1032#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:07,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {824#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {1036#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:07,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {824#true} call #t~ret7 := main(); {824#true} is VALID [2018-11-23 10:06:07,877 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {824#true} {824#true} #76#return; {824#true} is VALID [2018-11-23 10:06:07,877 INFO L273 TraceCheckUtils]: 2: Hoare triple {824#true} assume true; {824#true} is VALID [2018-11-23 10:06:07,877 INFO L273 TraceCheckUtils]: 1: Hoare triple {824#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {824#true} is VALID [2018-11-23 10:06:07,877 INFO L256 TraceCheckUtils]: 0: Hoare triple {824#true} call ULTIMATE.init(); {824#true} is VALID [2018-11-23 10:06:07,880 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 10:06:07,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:07,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:06:07,882 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 10:06:07,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:07,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:06:07,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:07,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:06:07,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:06:07,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:06:07,964 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 12 states. [2018-11-23 10:06:09,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:09,967 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2018-11-23 10:06:09,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:06:09,967 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 10:06:09,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:06:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 10:06:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:06:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 10:06:09,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2018-11-23 10:06:10,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:10,235 INFO L225 Difference]: With dead ends: 103 [2018-11-23 10:06:10,235 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 10:06:10,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:06:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 10:06:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 10:06:10,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:10,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 10:06:10,298 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 10:06:10,298 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 10:06:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:10,303 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-23 10:06:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-23 10:06:10,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:10,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:10,304 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 10:06:10,304 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 10:06:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:10,308 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-23 10:06:10,308 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-23 10:06:10,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:10,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:10,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:10,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 10:06:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-11-23 10:06:10,314 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 37 [2018-11-23 10:06:10,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:10,314 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-11-23 10:06:10,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:06:10,315 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-23 10:06:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 10:06:10,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:10,317 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:10,318 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:10,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1207107598, now seen corresponding path program 3 times [2018-11-23 10:06:10,319 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:10,319 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:06:10,348 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:06:10,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:06:10,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:10,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:11,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {1477#true} call ULTIMATE.init(); {1477#true} is VALID [2018-11-23 10:06:11,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {1477#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1477#true} is VALID [2018-11-23 10:06:11,208 INFO L273 TraceCheckUtils]: 2: Hoare triple {1477#true} assume true; {1477#true} is VALID [2018-11-23 10:06:11,208 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1477#true} {1477#true} #76#return; {1477#true} is VALID [2018-11-23 10:06:11,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {1477#true} call #t~ret7 := main(); {1477#true} is VALID [2018-11-23 10:06:11,209 INFO L273 TraceCheckUtils]: 5: Hoare triple {1477#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {1497#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:11,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {1497#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1501#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,210 INFO L273 TraceCheckUtils]: 7: Hoare triple {1501#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1505#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {1505#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1509#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,211 INFO L273 TraceCheckUtils]: 9: Hoare triple {1509#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1513#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {1513#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1517#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {1517#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1521#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {1521#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1525#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {1525#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1529#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:06:11,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {1529#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1533#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {1533#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1537#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {1537#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 10:06:11,219 INFO L273 TraceCheckUtils]: 17: Hoare triple {1478#false} ~i~0 := 0bv32; {1478#false} is VALID [2018-11-23 10:06:11,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,221 INFO L273 TraceCheckUtils]: 24: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,222 INFO L273 TraceCheckUtils]: 28: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,222 INFO L273 TraceCheckUtils]: 29: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,223 INFO L273 TraceCheckUtils]: 31: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,223 INFO L273 TraceCheckUtils]: 32: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,223 INFO L273 TraceCheckUtils]: 33: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,223 INFO L273 TraceCheckUtils]: 34: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,224 INFO L273 TraceCheckUtils]: 36: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,224 INFO L273 TraceCheckUtils]: 37: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,224 INFO L273 TraceCheckUtils]: 38: Hoare triple {1478#false} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 10:06:11,224 INFO L273 TraceCheckUtils]: 39: Hoare triple {1478#false} ~i~0 := 0bv32; {1478#false} is VALID [2018-11-23 10:06:11,225 INFO L273 TraceCheckUtils]: 40: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,225 INFO L273 TraceCheckUtils]: 41: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,225 INFO L273 TraceCheckUtils]: 42: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,225 INFO L273 TraceCheckUtils]: 43: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,226 INFO L273 TraceCheckUtils]: 44: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,226 INFO L273 TraceCheckUtils]: 45: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,226 INFO L273 TraceCheckUtils]: 46: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,227 INFO L273 TraceCheckUtils]: 48: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,227 INFO L273 TraceCheckUtils]: 50: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,227 INFO L273 TraceCheckUtils]: 51: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,228 INFO L273 TraceCheckUtils]: 52: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,228 INFO L273 TraceCheckUtils]: 53: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,228 INFO L273 TraceCheckUtils]: 54: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,228 INFO L273 TraceCheckUtils]: 55: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,229 INFO L273 TraceCheckUtils]: 56: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,229 INFO L273 TraceCheckUtils]: 57: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,229 INFO L273 TraceCheckUtils]: 58: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,229 INFO L273 TraceCheckUtils]: 59: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,230 INFO L273 TraceCheckUtils]: 60: Hoare triple {1478#false} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 10:06:11,230 INFO L273 TraceCheckUtils]: 61: Hoare triple {1478#false} havoc ~x~0;~x~0 := 0bv32; {1478#false} is VALID [2018-11-23 10:06:11,230 INFO L273 TraceCheckUtils]: 62: Hoare triple {1478#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1478#false} is VALID [2018-11-23 10:06:11,230 INFO L256 TraceCheckUtils]: 63: Hoare triple {1478#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {1478#false} is VALID [2018-11-23 10:06:11,230 INFO L273 TraceCheckUtils]: 64: Hoare triple {1478#false} ~cond := #in~cond; {1478#false} is VALID [2018-11-23 10:06:11,231 INFO L273 TraceCheckUtils]: 65: Hoare triple {1478#false} assume 0bv32 == ~cond; {1478#false} is VALID [2018-11-23 10:06:11,231 INFO L273 TraceCheckUtils]: 66: Hoare triple {1478#false} assume !false; {1478#false} is VALID [2018-11-23 10:06:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 10:06:11,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:11,827 INFO L273 TraceCheckUtils]: 66: Hoare triple {1478#false} assume !false; {1478#false} is VALID [2018-11-23 10:06:11,828 INFO L273 TraceCheckUtils]: 65: Hoare triple {1478#false} assume 0bv32 == ~cond; {1478#false} is VALID [2018-11-23 10:06:11,828 INFO L273 TraceCheckUtils]: 64: Hoare triple {1478#false} ~cond := #in~cond; {1478#false} is VALID [2018-11-23 10:06:11,829 INFO L256 TraceCheckUtils]: 63: Hoare triple {1478#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {1478#false} is VALID [2018-11-23 10:06:11,829 INFO L273 TraceCheckUtils]: 62: Hoare triple {1478#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1478#false} is VALID [2018-11-23 10:06:11,830 INFO L273 TraceCheckUtils]: 61: Hoare triple {1478#false} havoc ~x~0;~x~0 := 0bv32; {1478#false} is VALID [2018-11-23 10:06:11,830 INFO L273 TraceCheckUtils]: 60: Hoare triple {1478#false} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 10:06:11,830 INFO L273 TraceCheckUtils]: 59: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,830 INFO L273 TraceCheckUtils]: 58: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,831 INFO L273 TraceCheckUtils]: 57: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,831 INFO L273 TraceCheckUtils]: 56: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,831 INFO L273 TraceCheckUtils]: 55: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,832 INFO L273 TraceCheckUtils]: 54: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,832 INFO L273 TraceCheckUtils]: 53: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,832 INFO L273 TraceCheckUtils]: 52: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,832 INFO L273 TraceCheckUtils]: 51: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,832 INFO L273 TraceCheckUtils]: 50: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,833 INFO L273 TraceCheckUtils]: 49: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,833 INFO L273 TraceCheckUtils]: 48: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,833 INFO L273 TraceCheckUtils]: 47: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,833 INFO L273 TraceCheckUtils]: 46: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,833 INFO L273 TraceCheckUtils]: 45: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,834 INFO L273 TraceCheckUtils]: 44: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,834 INFO L273 TraceCheckUtils]: 43: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,834 INFO L273 TraceCheckUtils]: 42: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,834 INFO L273 TraceCheckUtils]: 41: Hoare triple {1478#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1478#false} is VALID [2018-11-23 10:06:11,834 INFO L273 TraceCheckUtils]: 40: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1478#false} is VALID [2018-11-23 10:06:11,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {1478#false} ~i~0 := 0bv32; {1478#false} is VALID [2018-11-23 10:06:11,835 INFO L273 TraceCheckUtils]: 38: Hoare triple {1478#false} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 10:06:11,835 INFO L273 TraceCheckUtils]: 37: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,835 INFO L273 TraceCheckUtils]: 36: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,836 INFO L273 TraceCheckUtils]: 33: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,837 INFO L273 TraceCheckUtils]: 31: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,837 INFO L273 TraceCheckUtils]: 30: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,837 INFO L273 TraceCheckUtils]: 29: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {1478#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1478#false} is VALID [2018-11-23 10:06:11,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {1478#false} is VALID [2018-11-23 10:06:11,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {1478#false} ~i~0 := 0bv32; {1478#false} is VALID [2018-11-23 10:06:11,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {1841#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 10:06:11,876 INFO L273 TraceCheckUtils]: 15: Hoare triple {1845#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1841#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:11,891 INFO L273 TraceCheckUtils]: 14: Hoare triple {1849#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1845#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {1853#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1849#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {1857#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1853#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,906 INFO L273 TraceCheckUtils]: 11: Hoare triple {1861#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1857#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,911 INFO L273 TraceCheckUtils]: 10: Hoare triple {1865#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1861#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {1869#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1865#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {1873#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1869#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {1877#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1873#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {1881#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1877#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {1477#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {1881#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {1477#true} call #t~ret7 := main(); {1477#true} is VALID [2018-11-23 10:06:11,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1477#true} {1477#true} #76#return; {1477#true} is VALID [2018-11-23 10:06:11,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {1477#true} assume true; {1477#true} is VALID [2018-11-23 10:06:11,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {1477#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1477#true} is VALID [2018-11-23 10:06:11,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {1477#true} call ULTIMATE.init(); {1477#true} is VALID [2018-11-23 10:06:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 10:06:11,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:11,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:06:11,962 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-23 10:06:11,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:11,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:06:12,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:12,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:06:12,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:06:12,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:06:12,069 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 24 states. [2018-11-23 10:06:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:20,093 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2018-11-23 10:06:20,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:06:20,094 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-23 10:06:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:06:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 190 transitions. [2018-11-23 10:06:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:06:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 190 transitions. [2018-11-23 10:06:20,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 190 transitions. [2018-11-23 10:06:20,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:20,617 INFO L225 Difference]: With dead ends: 187 [2018-11-23 10:06:20,617 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 10:06:20,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:06:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 10:06:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-23 10:06:20,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:20,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 132 states. [2018-11-23 10:06:20,712 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 132 states. [2018-11-23 10:06:20,712 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 132 states. [2018-11-23 10:06:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:20,717 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-23 10:06:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-23 10:06:20,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:20,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:20,719 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 132 states. [2018-11-23 10:06:20,719 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 132 states. [2018-11-23 10:06:20,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:20,724 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-23 10:06:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-23 10:06:20,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:20,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:20,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:20,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 10:06:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-11-23 10:06:20,730 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 67 [2018-11-23 10:06:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:20,730 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-11-23 10:06:20,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:06:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-23 10:06:20,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 10:06:20,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:20,735 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:20,735 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:20,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:20,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1188305858, now seen corresponding path program 4 times [2018-11-23 10:06:20,736 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:20,736 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:06:20,764 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:06:20,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:06:20,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:21,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:21,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {2682#true} call ULTIMATE.init(); {2682#true} is VALID [2018-11-23 10:06:21,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {2682#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2682#true} is VALID [2018-11-23 10:06:21,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 10:06:21,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2682#true} #76#return; {2682#true} is VALID [2018-11-23 10:06:21,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {2682#true} call #t~ret7 := main(); {2682#true} is VALID [2018-11-23 10:06:21,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {2682#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {2702#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:21,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {2702#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2706#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {2706#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2710#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:06:21,753 INFO L273 TraceCheckUtils]: 8: Hoare triple {2710#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2714#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {2714#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2718#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:06:21,755 INFO L273 TraceCheckUtils]: 10: Hoare triple {2718#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2722#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,756 INFO L273 TraceCheckUtils]: 11: Hoare triple {2722#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2726#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:06:21,756 INFO L273 TraceCheckUtils]: 12: Hoare triple {2726#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2730#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {2730#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2734#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {2734#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2738#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:06:21,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {2738#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2742#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {2742#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2746#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {2746#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2750#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:06:21,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {2750#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2754#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {2754#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2758#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {2758#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2762#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {2762#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2766#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:06:21,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {2766#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2770#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {2770#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2774#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,768 INFO L273 TraceCheckUtils]: 24: Hoare triple {2774#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2778#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,769 INFO L273 TraceCheckUtils]: 25: Hoare triple {2778#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2782#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {2782#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2786#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {2786#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2790#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {2790#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 10:06:21,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {2683#false} ~i~0 := 0bv32; {2683#false} is VALID [2018-11-23 10:06:21,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,773 INFO L273 TraceCheckUtils]: 31: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,774 INFO L273 TraceCheckUtils]: 32: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,774 INFO L273 TraceCheckUtils]: 33: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,774 INFO L273 TraceCheckUtils]: 34: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,774 INFO L273 TraceCheckUtils]: 36: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,774 INFO L273 TraceCheckUtils]: 37: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,775 INFO L273 TraceCheckUtils]: 40: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,775 INFO L273 TraceCheckUtils]: 41: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,775 INFO L273 TraceCheckUtils]: 42: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,775 INFO L273 TraceCheckUtils]: 43: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,775 INFO L273 TraceCheckUtils]: 44: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,776 INFO L273 TraceCheckUtils]: 45: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,776 INFO L273 TraceCheckUtils]: 46: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,776 INFO L273 TraceCheckUtils]: 47: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,776 INFO L273 TraceCheckUtils]: 48: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,776 INFO L273 TraceCheckUtils]: 49: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,776 INFO L273 TraceCheckUtils]: 50: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,776 INFO L273 TraceCheckUtils]: 51: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,777 INFO L273 TraceCheckUtils]: 52: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,777 INFO L273 TraceCheckUtils]: 53: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,777 INFO L273 TraceCheckUtils]: 54: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,777 INFO L273 TraceCheckUtils]: 55: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,777 INFO L273 TraceCheckUtils]: 56: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,777 INFO L273 TraceCheckUtils]: 57: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,777 INFO L273 TraceCheckUtils]: 58: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,778 INFO L273 TraceCheckUtils]: 59: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,778 INFO L273 TraceCheckUtils]: 60: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,778 INFO L273 TraceCheckUtils]: 61: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,778 INFO L273 TraceCheckUtils]: 62: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,778 INFO L273 TraceCheckUtils]: 63: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,778 INFO L273 TraceCheckUtils]: 64: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,778 INFO L273 TraceCheckUtils]: 65: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,779 INFO L273 TraceCheckUtils]: 66: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,779 INFO L273 TraceCheckUtils]: 67: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,779 INFO L273 TraceCheckUtils]: 68: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,779 INFO L273 TraceCheckUtils]: 69: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,779 INFO L273 TraceCheckUtils]: 70: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,780 INFO L273 TraceCheckUtils]: 71: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,780 INFO L273 TraceCheckUtils]: 72: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:21,780 INFO L273 TraceCheckUtils]: 73: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:21,780 INFO L273 TraceCheckUtils]: 74: Hoare triple {2683#false} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 10:06:21,780 INFO L273 TraceCheckUtils]: 75: Hoare triple {2683#false} ~i~0 := 0bv32; {2683#false} is VALID [2018-11-23 10:06:21,781 INFO L273 TraceCheckUtils]: 76: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,781 INFO L273 TraceCheckUtils]: 77: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,781 INFO L273 TraceCheckUtils]: 78: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,781 INFO L273 TraceCheckUtils]: 79: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,781 INFO L273 TraceCheckUtils]: 80: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,782 INFO L273 TraceCheckUtils]: 81: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,782 INFO L273 TraceCheckUtils]: 82: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,782 INFO L273 TraceCheckUtils]: 83: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,782 INFO L273 TraceCheckUtils]: 84: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,783 INFO L273 TraceCheckUtils]: 85: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,783 INFO L273 TraceCheckUtils]: 86: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,783 INFO L273 TraceCheckUtils]: 87: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,783 INFO L273 TraceCheckUtils]: 88: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,783 INFO L273 TraceCheckUtils]: 89: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,783 INFO L273 TraceCheckUtils]: 90: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,784 INFO L273 TraceCheckUtils]: 91: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,784 INFO L273 TraceCheckUtils]: 92: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,784 INFO L273 TraceCheckUtils]: 93: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,784 INFO L273 TraceCheckUtils]: 94: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,785 INFO L273 TraceCheckUtils]: 95: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,785 INFO L273 TraceCheckUtils]: 96: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,785 INFO L273 TraceCheckUtils]: 97: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,785 INFO L273 TraceCheckUtils]: 98: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,785 INFO L273 TraceCheckUtils]: 99: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,786 INFO L273 TraceCheckUtils]: 100: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,786 INFO L273 TraceCheckUtils]: 101: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,786 INFO L273 TraceCheckUtils]: 102: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,786 INFO L273 TraceCheckUtils]: 103: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,786 INFO L273 TraceCheckUtils]: 104: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,787 INFO L273 TraceCheckUtils]: 105: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,787 INFO L273 TraceCheckUtils]: 106: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,787 INFO L273 TraceCheckUtils]: 107: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,787 INFO L273 TraceCheckUtils]: 108: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,787 INFO L273 TraceCheckUtils]: 109: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,788 INFO L273 TraceCheckUtils]: 110: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,788 INFO L273 TraceCheckUtils]: 111: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,788 INFO L273 TraceCheckUtils]: 112: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,788 INFO L273 TraceCheckUtils]: 113: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,789 INFO L273 TraceCheckUtils]: 114: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,789 INFO L273 TraceCheckUtils]: 115: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,789 INFO L273 TraceCheckUtils]: 116: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,789 INFO L273 TraceCheckUtils]: 117: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,789 INFO L273 TraceCheckUtils]: 118: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:21,790 INFO L273 TraceCheckUtils]: 119: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:21,790 INFO L273 TraceCheckUtils]: 120: Hoare triple {2683#false} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 10:06:21,790 INFO L273 TraceCheckUtils]: 121: Hoare triple {2683#false} havoc ~x~0;~x~0 := 0bv32; {2683#false} is VALID [2018-11-23 10:06:21,790 INFO L273 TraceCheckUtils]: 122: Hoare triple {2683#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2683#false} is VALID [2018-11-23 10:06:21,790 INFO L256 TraceCheckUtils]: 123: Hoare triple {2683#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {2683#false} is VALID [2018-11-23 10:06:21,791 INFO L273 TraceCheckUtils]: 124: Hoare triple {2683#false} ~cond := #in~cond; {2683#false} is VALID [2018-11-23 10:06:21,791 INFO L273 TraceCheckUtils]: 125: Hoare triple {2683#false} assume 0bv32 == ~cond; {2683#false} is VALID [2018-11-23 10:06:21,791 INFO L273 TraceCheckUtils]: 126: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2018-11-23 10:06:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-11-23 10:06:21,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:23,760 INFO L273 TraceCheckUtils]: 126: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2018-11-23 10:06:23,760 INFO L273 TraceCheckUtils]: 125: Hoare triple {2683#false} assume 0bv32 == ~cond; {2683#false} is VALID [2018-11-23 10:06:23,761 INFO L273 TraceCheckUtils]: 124: Hoare triple {2683#false} ~cond := #in~cond; {2683#false} is VALID [2018-11-23 10:06:23,761 INFO L256 TraceCheckUtils]: 123: Hoare triple {2683#false} call __VERIFIER_assert((if #t~mem6 == ~bvadd32(42bv32, ~incr~0) then 1bv32 else 0bv32)); {2683#false} is VALID [2018-11-23 10:06:23,761 INFO L273 TraceCheckUtils]: 122: Hoare triple {2683#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2683#false} is VALID [2018-11-23 10:06:23,761 INFO L273 TraceCheckUtils]: 121: Hoare triple {2683#false} havoc ~x~0;~x~0 := 0bv32; {2683#false} is VALID [2018-11-23 10:06:23,761 INFO L273 TraceCheckUtils]: 120: Hoare triple {2683#false} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 10:06:23,762 INFO L273 TraceCheckUtils]: 119: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,762 INFO L273 TraceCheckUtils]: 118: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,762 INFO L273 TraceCheckUtils]: 117: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,762 INFO L273 TraceCheckUtils]: 116: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,762 INFO L273 TraceCheckUtils]: 115: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,762 INFO L273 TraceCheckUtils]: 114: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,763 INFO L273 TraceCheckUtils]: 113: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,763 INFO L273 TraceCheckUtils]: 112: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,763 INFO L273 TraceCheckUtils]: 111: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,763 INFO L273 TraceCheckUtils]: 110: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,763 INFO L273 TraceCheckUtils]: 109: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,763 INFO L273 TraceCheckUtils]: 108: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,764 INFO L273 TraceCheckUtils]: 107: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,764 INFO L273 TraceCheckUtils]: 106: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,764 INFO L273 TraceCheckUtils]: 105: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,764 INFO L273 TraceCheckUtils]: 104: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,764 INFO L273 TraceCheckUtils]: 103: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,764 INFO L273 TraceCheckUtils]: 102: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,765 INFO L273 TraceCheckUtils]: 101: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,765 INFO L273 TraceCheckUtils]: 100: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,765 INFO L273 TraceCheckUtils]: 99: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,765 INFO L273 TraceCheckUtils]: 98: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,765 INFO L273 TraceCheckUtils]: 97: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,766 INFO L273 TraceCheckUtils]: 96: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,766 INFO L273 TraceCheckUtils]: 95: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,766 INFO L273 TraceCheckUtils]: 93: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,766 INFO L273 TraceCheckUtils]: 92: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,766 INFO L273 TraceCheckUtils]: 91: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,767 INFO L273 TraceCheckUtils]: 90: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,767 INFO L273 TraceCheckUtils]: 89: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,767 INFO L273 TraceCheckUtils]: 88: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,767 INFO L273 TraceCheckUtils]: 87: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,767 INFO L273 TraceCheckUtils]: 86: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,768 INFO L273 TraceCheckUtils]: 85: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,768 INFO L273 TraceCheckUtils]: 84: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,768 INFO L273 TraceCheckUtils]: 83: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,768 INFO L273 TraceCheckUtils]: 82: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,768 INFO L273 TraceCheckUtils]: 81: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,768 INFO L273 TraceCheckUtils]: 80: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,769 INFO L273 TraceCheckUtils]: 79: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,769 INFO L273 TraceCheckUtils]: 78: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,769 INFO L273 TraceCheckUtils]: 77: Hoare triple {2683#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2683#false} is VALID [2018-11-23 10:06:23,769 INFO L273 TraceCheckUtils]: 76: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem4, ~incr~0), ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2683#false} is VALID [2018-11-23 10:06:23,769 INFO L273 TraceCheckUtils]: 75: Hoare triple {2683#false} ~i~0 := 0bv32; {2683#false} is VALID [2018-11-23 10:06:23,769 INFO L273 TraceCheckUtils]: 74: Hoare triple {2683#false} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 10:06:23,770 INFO L273 TraceCheckUtils]: 73: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,770 INFO L273 TraceCheckUtils]: 72: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,770 INFO L273 TraceCheckUtils]: 71: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,770 INFO L273 TraceCheckUtils]: 70: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,770 INFO L273 TraceCheckUtils]: 69: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,770 INFO L273 TraceCheckUtils]: 68: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,771 INFO L273 TraceCheckUtils]: 67: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,771 INFO L273 TraceCheckUtils]: 66: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,771 INFO L273 TraceCheckUtils]: 65: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,771 INFO L273 TraceCheckUtils]: 64: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,771 INFO L273 TraceCheckUtils]: 63: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,771 INFO L273 TraceCheckUtils]: 62: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,772 INFO L273 TraceCheckUtils]: 61: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,772 INFO L273 TraceCheckUtils]: 60: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,772 INFO L273 TraceCheckUtils]: 59: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,772 INFO L273 TraceCheckUtils]: 58: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,772 INFO L273 TraceCheckUtils]: 57: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,772 INFO L273 TraceCheckUtils]: 56: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,773 INFO L273 TraceCheckUtils]: 55: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,773 INFO L273 TraceCheckUtils]: 52: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,774 INFO L273 TraceCheckUtils]: 49: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,774 INFO L273 TraceCheckUtils]: 45: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,775 INFO L273 TraceCheckUtils]: 43: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,775 INFO L273 TraceCheckUtils]: 42: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,775 INFO L273 TraceCheckUtils]: 41: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,775 INFO L273 TraceCheckUtils]: 40: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,776 INFO L273 TraceCheckUtils]: 37: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,776 INFO L273 TraceCheckUtils]: 36: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,776 INFO L273 TraceCheckUtils]: 35: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,776 INFO L273 TraceCheckUtils]: 33: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,776 INFO L273 TraceCheckUtils]: 32: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,777 INFO L273 TraceCheckUtils]: 31: Hoare triple {2683#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2683#false} is VALID [2018-11-23 10:06:23,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2; {2683#false} is VALID [2018-11-23 10:06:23,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {2683#false} ~i~0 := 0bv32; {2683#false} is VALID [2018-11-23 10:06:23,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {3382#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 10:06:23,791 INFO L273 TraceCheckUtils]: 27: Hoare triple {3386#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3382#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:23,798 INFO L273 TraceCheckUtils]: 26: Hoare triple {3390#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3386#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,804 INFO L273 TraceCheckUtils]: 25: Hoare triple {3394#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3390#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,809 INFO L273 TraceCheckUtils]: 24: Hoare triple {3398#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3394#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {3402#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3398#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,822 INFO L273 TraceCheckUtils]: 22: Hoare triple {3406#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3402#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {3410#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3406#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {3414#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3410#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {3418#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3414#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,845 INFO L273 TraceCheckUtils]: 18: Hoare triple {3422#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3418#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {3426#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3422#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,853 INFO L273 TraceCheckUtils]: 16: Hoare triple {3430#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3426#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {3434#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3430#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,862 INFO L273 TraceCheckUtils]: 14: Hoare triple {3438#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3434#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {3442#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3438#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {3446#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3442#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {3450#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3446#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {3454#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3450#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,888 INFO L273 TraceCheckUtils]: 9: Hoare triple {3458#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3454#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {3462#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3458#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {3466#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3462#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {3470#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3466#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {2682#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~incr~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32; {3470#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {2682#true} call #t~ret7 := main(); {2682#true} is VALID [2018-11-23 10:06:23,904 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2682#true} #76#return; {2682#true} is VALID [2018-11-23 10:06:23,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 10:06:23,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {2682#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2682#true} is VALID [2018-11-23 10:06:23,905 INFO L256 TraceCheckUtils]: 0: Hoare triple {2682#true} call ULTIMATE.init(); {2682#true} is VALID [2018-11-23 10:06:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-11-23 10:06:23,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:23,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:06:23,935 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-11-23 10:06:23,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:23,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:06:24,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:24,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:06:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:06:24,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:06:24,069 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 48 states. [2018-11-23 10:06:27,805 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:06:28,278 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:06:28,770 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:06:29,313 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:06:29,886 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:06:30,436 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:06:30,984 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:06:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:57,407 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2018-11-23 10:06:57,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:06:57,407 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-11-23 10:06:57,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:06:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 346 transitions. [2018-11-23 10:06:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:06:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 346 transitions. [2018-11-23 10:06:57,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 346 transitions. [2018-11-23 10:06:58,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:58,368 INFO L225 Difference]: With dead ends: 355 [2018-11-23 10:06:58,368 INFO L226 Difference]: Without dead ends: 252 [2018-11-23 10:06:58,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:06:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-23 10:06:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-11-23 10:06:58,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:58,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 252 states. [2018-11-23 10:06:58,790 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2018-11-23 10:06:58,790 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2018-11-23 10:06:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:58,799 INFO L93 Difference]: Finished difference Result 252 states and 255 transitions. [2018-11-23 10:06:58,799 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 255 transitions. [2018-11-23 10:06:58,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:58,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:58,801 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2018-11-23 10:06:58,801 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2018-11-23 10:06:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:58,810 INFO L93 Difference]: Finished difference Result 252 states and 255 transitions. [2018-11-23 10:06:58,810 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 255 transitions. [2018-11-23 10:06:58,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:58,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:58,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:58,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-23 10:06:58,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 255 transitions. [2018-11-23 10:06:58,820 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 255 transitions. Word has length 127 [2018-11-23 10:06:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:58,820 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 255 transitions. [2018-11-23 10:06:58,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:06:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 255 transitions. [2018-11-23 10:06:58,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-23 10:06:58,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:58,825 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:58,825 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:58,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1603456158, now seen corresponding path program 5 times [2018-11-23 10:06:58,827 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:58,827 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:06:58,857 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1