java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:17:30,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:17:30,210 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:17:30,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:17:30,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:17:30,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:17:30,235 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:17:30,237 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:17:30,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:17:30,242 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:17:30,243 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:17:30,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:17:30,246 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:17:30,247 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:17:30,248 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:17:30,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:17:30,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:17:30,265 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:17:30,267 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:17:30,272 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:17:30,273 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:17:30,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:17:30,279 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:17:30,279 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:17:30,280 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:17:30,280 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:17:30,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:17:30,286 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:17:30,286 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:17:30,287 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:17:30,289 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:17:30,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:17:30,290 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:17:30,290 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:17:30,293 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:17:30,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:17:30,294 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:17:30,327 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:17:30,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:17:30,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:17:30,328 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:17:30,329 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:17:30,329 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:17:30,329 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:17:30,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:17:30,330 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:17:30,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:17:30,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:17:30,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:17:30,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:17:30,331 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:17:30,331 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:17:30,331 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:17:30,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:17:30,332 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:17:30,332 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:17:30,332 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:17:30,332 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:17:30,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:17:30,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:17:30,333 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:17:30,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:17:30,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:17:30,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:17:30,334 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:17:30,334 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:17:30,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:17:30,334 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:17:30,335 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:17:30,335 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:17:30,379 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:17:30,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:17:30,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:17:30,400 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:17:30,401 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:17:30,402 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i [2018-11-23 10:17:30,471 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bde03dc8b/48b26d0c3e12486ab78009c0e99fc66c/FLAG068d1e932 [2018-11-23 10:17:30,883 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:17:30,884 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_mul_init_true-unreach-call_true-termination.i [2018-11-23 10:17:30,890 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bde03dc8b/48b26d0c3e12486ab78009c0e99fc66c/FLAG068d1e932 [2018-11-23 10:17:31,248 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bde03dc8b/48b26d0c3e12486ab78009c0e99fc66c [2018-11-23 10:17:31,260 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:17:31,261 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:17:31,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:17:31,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:17:31,267 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:17:31,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a75136c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31, skipping insertion in model container [2018-11-23 10:17:31,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,282 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:17:31,302 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:17:31,590 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:17:31,599 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:17:31,637 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:17:31,669 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:17:31,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31 WrapperNode [2018-11-23 10:17:31,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:17:31,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:17:31,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:17:31,673 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:17:31,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,698 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,707 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:17:31,708 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:17:31,708 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:17:31,708 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:17:31,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,724 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,724 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... [2018-11-23 10:17:31,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:17:31,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:17:31,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:17:31,751 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:17:31,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:17:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:17:31,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:17:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:17:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:17:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:17:31,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:17:31,885 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:17:31,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:17:31,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:17:31,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:17:31,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:17:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:17:32,512 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:17:32,513 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:17:32,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:17:32 BoogieIcfgContainer [2018-11-23 10:17:32,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:17:32,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:17:32,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:17:32,518 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:17:32,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:17:31" (1/3) ... [2018-11-23 10:17:32,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3856de16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:17:32, skipping insertion in model container [2018-11-23 10:17:32,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:31" (2/3) ... [2018-11-23 10:17:32,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3856de16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:17:32, skipping insertion in model container [2018-11-23 10:17:32,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:17:32" (3/3) ... [2018-11-23 10:17:32,522 INFO L112 eAbstractionObserver]: Analyzing ICFG array_mul_init_true-unreach-call_true-termination.i [2018-11-23 10:17:32,531 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:17:32,539 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:17:32,557 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:17:32,589 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:17:32,590 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:17:32,590 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:17:32,590 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:17:32,591 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:17:32,591 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:17:32,591 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:17:32,591 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:17:32,591 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:17:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 10:17:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:17:32,615 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:32,616 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:32,618 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:32,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1583089931, now seen corresponding path program 1 times [2018-11-23 10:17:32,628 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:32,628 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:17:32,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:32,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:32,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 10:17:32,878 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:17:32,879 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 10:17:32,880 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #74#return; {32#true} is VALID [2018-11-23 10:17:32,880 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret11 := main(); {32#true} is VALID [2018-11-23 10:17:32,880 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);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {32#true} is VALID [2018-11-23 10:17:32,894 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 10:17:32,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-23 10:17:32,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !true; {33#false} is VALID [2018-11-23 10:17:32,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-23 10:17:32,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {33#false} is VALID [2018-11-23 10:17:32,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume #t~short10; {33#false} is VALID [2018-11-23 10:17:32,896 INFO L256 TraceCheckUtils]: 12: Hoare triple {33#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-23 10:17:32,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 10:17:32,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume 0bv32 == ~cond; {33#false} is VALID [2018-11-23 10:17:32,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 10:17:32,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:17:32,901 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:17:32,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:17:32,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:17:32,916 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 10:17:32,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:32,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:17:33,095 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:33,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:17:33,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:17:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:17:33,106 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 10:17:33,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:33,275 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-23 10:17:33,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:17:33,275 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 10:17:33,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:17:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 10:17:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:17:33,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 10:17:33,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2018-11-23 10:17:33,561 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:33,573 INFO L225 Difference]: With dead ends: 50 [2018-11-23 10:17:33,573 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 10:17:33,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:17:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 10:17:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 10:17:33,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:33,621 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 10:17:33,622 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 10:17:33,622 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 10:17:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:33,627 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 10:17:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 10:17:33,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:33,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:33,629 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 10:17:33,629 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 10:17:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:33,634 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 10:17:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 10:17:33,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:33,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:33,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:33,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:17:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 10:17:33,640 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2018-11-23 10:17:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:33,641 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 10:17:33,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:17:33,641 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 10:17:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:17:33,642 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:33,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:33,643 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:33,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:33,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1899913894, now seen corresponding path program 1 times [2018-11-23 10:17:33,647 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:33,647 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:17:33,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:33,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:33,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-23 10:17:33,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {225#true} is VALID [2018-11-23 10:17:33,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-23 10:17:33,938 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #74#return; {225#true} is VALID [2018-11-23 10:17:33,938 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret11 := main(); {225#true} is VALID [2018-11-23 10:17:33,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {225#true} is VALID [2018-11-23 10:17:33,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#true} assume !~bvslt32(~i~0, 100000bv32); {225#true} is VALID [2018-11-23 10:17:33,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {225#true} ~i~0 := 0bv32; {225#true} is VALID [2018-11-23 10:17:33,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#true} assume !~bvslt32(~i~0, 100000bv32); {225#true} is VALID [2018-11-23 10:17:33,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {225#true} ~i~0 := 0bv32; {225#true} is VALID [2018-11-23 10:17:33,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {225#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {225#true} is VALID [2018-11-23 10:17:33,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {225#true} assume #t~short10; {263#|main_#t~short10|} is VALID [2018-11-23 10:17:33,967 INFO L256 TraceCheckUtils]: 12: Hoare triple {263#|main_#t~short10|} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {267#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:33,982 INFO L273 TraceCheckUtils]: 13: Hoare triple {267#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {271#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:33,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {271#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {226#false} is VALID [2018-11-23 10:17:33,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-23 10:17:33,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:17:33,989 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:17:33,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:17:33,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 10:17:33,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 10:17:33,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:33,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 10:17:34,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:34,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 10:17:34,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 10:17:34,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 10:17:34,125 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 5 states. [2018-11-23 10:17:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:34,910 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-23 10:17:34,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 10:17:34,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 10:17:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 10:17:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 10:17:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 10:17:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2018-11-23 10:17:34,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2018-11-23 10:17:34,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:34,992 INFO L225 Difference]: With dead ends: 32 [2018-11-23 10:17:34,992 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 10:17:34,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:17:34,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 10:17:35,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 10:17:35,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:35,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 10:17:35,012 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 10:17:35,012 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 10:17:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:35,016 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 10:17:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 10:17:35,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:35,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:35,017 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 10:17:35,018 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 10:17:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:35,021 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 10:17:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 10:17:35,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:35,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:35,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:35,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 10:17:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 10:17:35,025 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2018-11-23 10:17:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:35,026 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 10:17:35,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 10:17:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 10:17:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:17:35,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:35,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:35,027 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:35,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1901760936, now seen corresponding path program 1 times [2018-11-23 10:17:35,028 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:35,028 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:17:35,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:35,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:35,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {422#true} call ULTIMATE.init(); {422#true} is VALID [2018-11-23 10:17:35,166 INFO L273 TraceCheckUtils]: 1: Hoare triple {422#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {422#true} is VALID [2018-11-23 10:17:35,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {422#true} assume true; {422#true} is VALID [2018-11-23 10:17:35,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {422#true} {422#true} #74#return; {422#true} is VALID [2018-11-23 10:17:35,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {422#true} call #t~ret11 := main(); {422#true} is VALID [2018-11-23 10:17:35,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {422#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {442#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:35,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {442#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {423#false} is VALID [2018-11-23 10:17:35,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {423#false} ~i~0 := 0bv32; {423#false} is VALID [2018-11-23 10:17:35,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {423#false} assume !~bvslt32(~i~0, 100000bv32); {423#false} is VALID [2018-11-23 10:17:35,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {423#false} ~i~0 := 0bv32; {423#false} is VALID [2018-11-23 10:17:35,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {423#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {423#false} is VALID [2018-11-23 10:17:35,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {423#false} assume !#t~short10;call #t~mem9 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem9 == ~bvmul32(#t~mem7, #t~mem8); {423#false} is VALID [2018-11-23 10:17:35,176 INFO L256 TraceCheckUtils]: 12: Hoare triple {423#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {423#false} is VALID [2018-11-23 10:17:35,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {423#false} ~cond := #in~cond; {423#false} is VALID [2018-11-23 10:17:35,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {423#false} assume 0bv32 == ~cond; {423#false} is VALID [2018-11-23 10:17:35,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {423#false} assume !false; {423#false} is VALID [2018-11-23 10:17:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:17:35,178 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:17:35,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:17:35,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:17:35,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:17:35,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:35,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:17:35,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:35,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:17:35,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:17:35,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:17:35,286 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-23 10:17:35,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:35,621 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-23 10:17:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:17:35,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:17:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:17:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 10:17:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:17:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 10:17:35,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 10:17:35,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:35,880 INFO L225 Difference]: With dead ends: 61 [2018-11-23 10:17:35,881 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 10:17:35,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:17:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 10:17:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-11-23 10:17:35,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:35,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2018-11-23 10:17:35,981 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2018-11-23 10:17:35,982 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2018-11-23 10:17:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:35,987 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 10:17:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 10:17:35,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:35,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:35,988 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2018-11-23 10:17:35,989 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2018-11-23 10:17:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:35,993 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 10:17:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 10:17:35,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:35,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:35,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:35,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 10:17:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 10:17:35,997 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-11-23 10:17:35,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:35,997 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 10:17:35,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:17:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 10:17:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:17:35,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:35,998 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] [2018-11-23 10:17:35,999 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:35,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:35,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1534454659, now seen corresponding path program 1 times [2018-11-23 10:17:36,000 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:36,000 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:17:36,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:36,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:36,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 10:17:36,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {679#true} is VALID [2018-11-23 10:17:36,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 10:17:36,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #74#return; {679#true} is VALID [2018-11-23 10:17:36,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret11 := main(); {679#true} is VALID [2018-11-23 10:17:36,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {699#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:36,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {699#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {699#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:36,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {699#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {706#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:36,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {706#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {680#false} is VALID [2018-11-23 10:17:36,165 INFO L273 TraceCheckUtils]: 9: Hoare triple {680#false} ~i~0 := 0bv32; {680#false} is VALID [2018-11-23 10:17:36,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {680#false} assume !!~bvslt32(~i~0, 100000bv32); {680#false} is VALID [2018-11-23 10:17:36,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {680#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {680#false} is VALID [2018-11-23 10:17:36,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {680#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {680#false} is VALID [2018-11-23 10:17:36,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {680#false} assume !~bvslt32(~i~0, 100000bv32); {680#false} is VALID [2018-11-23 10:17:36,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {680#false} ~i~0 := 0bv32; {680#false} is VALID [2018-11-23 10:17:36,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {680#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {680#false} is VALID [2018-11-23 10:17:36,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} assume !#t~short10;call #t~mem9 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem9 == ~bvmul32(#t~mem7, #t~mem8); {680#false} is VALID [2018-11-23 10:17:36,168 INFO L256 TraceCheckUtils]: 17: Hoare triple {680#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {680#false} is VALID [2018-11-23 10:17:36,168 INFO L273 TraceCheckUtils]: 18: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 10:17:36,169 INFO L273 TraceCheckUtils]: 19: Hoare triple {680#false} assume 0bv32 == ~cond; {680#false} is VALID [2018-11-23 10:17:36,169 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 10:17:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:17:36,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:36,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {680#false} assume !false; {680#false} is VALID [2018-11-23 10:17:36,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {680#false} assume 0bv32 == ~cond; {680#false} is VALID [2018-11-23 10:17:36,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {680#false} ~cond := #in~cond; {680#false} is VALID [2018-11-23 10:17:36,252 INFO L256 TraceCheckUtils]: 17: Hoare triple {680#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {680#false} is VALID [2018-11-23 10:17:36,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {680#false} assume !#t~short10;call #t~mem9 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem9 == ~bvmul32(#t~mem7, #t~mem8); {680#false} is VALID [2018-11-23 10:17:36,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {680#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {680#false} is VALID [2018-11-23 10:17:36,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {680#false} ~i~0 := 0bv32; {680#false} is VALID [2018-11-23 10:17:36,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {680#false} assume !~bvslt32(~i~0, 100000bv32); {680#false} is VALID [2018-11-23 10:17:36,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {680#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {680#false} is VALID [2018-11-23 10:17:36,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {680#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {680#false} is VALID [2018-11-23 10:17:36,253 INFO L273 TraceCheckUtils]: 10: Hoare triple {680#false} assume !!~bvslt32(~i~0, 100000bv32); {680#false} is VALID [2018-11-23 10:17:36,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {680#false} ~i~0 := 0bv32; {680#false} is VALID [2018-11-23 10:17:36,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {782#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {680#false} is VALID [2018-11-23 10:17:36,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {786#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {782#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:17:36,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {786#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {786#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {679#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {786#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:36,266 INFO L256 TraceCheckUtils]: 4: Hoare triple {679#true} call #t~ret11 := main(); {679#true} is VALID [2018-11-23 10:17:36,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {679#true} {679#true} #74#return; {679#true} is VALID [2018-11-23 10:17:36,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {679#true} assume true; {679#true} is VALID [2018-11-23 10:17:36,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {679#true} is VALID [2018-11-23 10:17:36,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {679#true} call ULTIMATE.init(); {679#true} is VALID [2018-11-23 10:17:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:17:36,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:36,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:17:36,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 10:17:36,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:36,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:17:36,327 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:17:36,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:17:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:17:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:17:36,328 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-23 10:17:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:37,081 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2018-11-23 10:17:37,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:17:37,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-23 10:17:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:17:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2018-11-23 10:17:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:17:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2018-11-23 10:17:37,090 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2018-11-23 10:17:37,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:37,327 INFO L225 Difference]: With dead ends: 87 [2018-11-23 10:17:37,328 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 10:17:37,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:17:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 10:17:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2018-11-23 10:17:37,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:37,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 46 states. [2018-11-23 10:17:37,438 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 46 states. [2018-11-23 10:17:37,439 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 46 states. [2018-11-23 10:17:37,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:37,445 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2018-11-23 10:17:37,445 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2018-11-23 10:17:37,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:37,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:37,446 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 65 states. [2018-11-23 10:17:37,447 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 65 states. [2018-11-23 10:17:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:37,452 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2018-11-23 10:17:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2018-11-23 10:17:37,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:37,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:37,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:37,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 10:17:37,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-23 10:17:37,457 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 21 [2018-11-23 10:17:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:37,458 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-23 10:17:37,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:17:37,458 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-23 10:17:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 10:17:37,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:37,460 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] [2018-11-23 10:17:37,460 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:37,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1392382608, now seen corresponding path program 2 times [2018-11-23 10:17:37,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:37,461 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:17:37,492 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:17:37,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:17:37,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:17:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:37,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:37,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {1130#true} call ULTIMATE.init(); {1130#true} is VALID [2018-11-23 10:17:37,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {1130#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1130#true} is VALID [2018-11-23 10:17:37,806 INFO L273 TraceCheckUtils]: 2: Hoare triple {1130#true} assume true; {1130#true} is VALID [2018-11-23 10:17:37,807 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1130#true} {1130#true} #74#return; {1130#true} is VALID [2018-11-23 10:17:37,807 INFO L256 TraceCheckUtils]: 4: Hoare triple {1130#true} call #t~ret11 := main(); {1130#true} is VALID [2018-11-23 10:17:37,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {1130#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {1150#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:37,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {1150#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1150#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:37,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {1150#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1157#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:37,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {1157#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1157#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:37,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {1157#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1164#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:17:37,811 INFO L273 TraceCheckUtils]: 10: Hoare triple {1164#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1164#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:17:37,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {1164#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1171#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:37,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {1171#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1171#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:37,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {1171#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1178#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:17:37,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {1178#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:37,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {1131#false} ~i~0 := 0bv32; {1131#false} is VALID [2018-11-23 10:17:37,815 INFO L273 TraceCheckUtils]: 16: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:37,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {1131#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {1131#false} is VALID [2018-11-23 10:17:37,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {1131#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1131#false} is VALID [2018-11-23 10:17:37,816 INFO L273 TraceCheckUtils]: 19: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:37,817 INFO L273 TraceCheckUtils]: 20: Hoare triple {1131#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {1131#false} is VALID [2018-11-23 10:17:37,817 INFO L273 TraceCheckUtils]: 21: Hoare triple {1131#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1131#false} is VALID [2018-11-23 10:17:37,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:37,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {1131#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {1131#false} is VALID [2018-11-23 10:17:37,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {1131#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1131#false} is VALID [2018-11-23 10:17:37,819 INFO L273 TraceCheckUtils]: 25: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:37,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {1131#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {1131#false} is VALID [2018-11-23 10:17:37,819 INFO L273 TraceCheckUtils]: 27: Hoare triple {1131#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1131#false} is VALID [2018-11-23 10:17:37,819 INFO L273 TraceCheckUtils]: 28: Hoare triple {1131#false} assume !~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:37,820 INFO L273 TraceCheckUtils]: 29: Hoare triple {1131#false} ~i~0 := 0bv32; {1131#false} is VALID [2018-11-23 10:17:37,820 INFO L273 TraceCheckUtils]: 30: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {1131#false} is VALID [2018-11-23 10:17:37,820 INFO L273 TraceCheckUtils]: 31: Hoare triple {1131#false} assume !#t~short10;call #t~mem9 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem9 == ~bvmul32(#t~mem7, #t~mem8); {1131#false} is VALID [2018-11-23 10:17:37,821 INFO L256 TraceCheckUtils]: 32: Hoare triple {1131#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {1131#false} is VALID [2018-11-23 10:17:37,821 INFO L273 TraceCheckUtils]: 33: Hoare triple {1131#false} ~cond := #in~cond; {1131#false} is VALID [2018-11-23 10:17:37,821 INFO L273 TraceCheckUtils]: 34: Hoare triple {1131#false} assume 0bv32 == ~cond; {1131#false} is VALID [2018-11-23 10:17:37,822 INFO L273 TraceCheckUtils]: 35: Hoare triple {1131#false} assume !false; {1131#false} is VALID [2018-11-23 10:17:37,824 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 10:17:37,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:38,104 INFO L273 TraceCheckUtils]: 35: Hoare triple {1131#false} assume !false; {1131#false} is VALID [2018-11-23 10:17:38,105 INFO L273 TraceCheckUtils]: 34: Hoare triple {1131#false} assume 0bv32 == ~cond; {1131#false} is VALID [2018-11-23 10:17:38,105 INFO L273 TraceCheckUtils]: 33: Hoare triple {1131#false} ~cond := #in~cond; {1131#false} is VALID [2018-11-23 10:17:38,106 INFO L256 TraceCheckUtils]: 32: Hoare triple {1131#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {1131#false} is VALID [2018-11-23 10:17:38,106 INFO L273 TraceCheckUtils]: 31: Hoare triple {1131#false} assume !#t~short10;call #t~mem9 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem9 == ~bvmul32(#t~mem7, #t~mem8); {1131#false} is VALID [2018-11-23 10:17:38,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {1131#false} is VALID [2018-11-23 10:17:38,107 INFO L273 TraceCheckUtils]: 29: Hoare triple {1131#false} ~i~0 := 0bv32; {1131#false} is VALID [2018-11-23 10:17:38,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {1131#false} assume !~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:38,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {1131#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1131#false} is VALID [2018-11-23 10:17:38,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {1131#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {1131#false} is VALID [2018-11-23 10:17:38,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:38,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {1131#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1131#false} is VALID [2018-11-23 10:17:38,109 INFO L273 TraceCheckUtils]: 23: Hoare triple {1131#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {1131#false} is VALID [2018-11-23 10:17:38,109 INFO L273 TraceCheckUtils]: 22: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:38,109 INFO L273 TraceCheckUtils]: 21: Hoare triple {1131#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1131#false} is VALID [2018-11-23 10:17:38,110 INFO L273 TraceCheckUtils]: 20: Hoare triple {1131#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {1131#false} is VALID [2018-11-23 10:17:38,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:38,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {1131#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1131#false} is VALID [2018-11-23 10:17:38,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {1131#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {1131#false} is VALID [2018-11-23 10:17:38,111 INFO L273 TraceCheckUtils]: 16: Hoare triple {1131#false} assume !!~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:38,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {1131#false} ~i~0 := 0bv32; {1131#false} is VALID [2018-11-23 10:17:38,114 INFO L273 TraceCheckUtils]: 14: Hoare triple {1308#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1131#false} is VALID [2018-11-23 10:17:38,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {1312#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1308#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:17:38,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {1312#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1312#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:38,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {1319#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1312#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:38,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {1319#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1319#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:38,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {1326#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1319#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:38,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {1326#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1326#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:38,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {1333#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1326#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:38,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {1333#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1333#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:38,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {1130#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {1333#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:38,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {1130#true} call #t~ret11 := main(); {1130#true} is VALID [2018-11-23 10:17:38,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1130#true} {1130#true} #74#return; {1130#true} is VALID [2018-11-23 10:17:38,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {1130#true} assume true; {1130#true} is VALID [2018-11-23 10:17:38,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {1130#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1130#true} is VALID [2018-11-23 10:17:38,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {1130#true} call ULTIMATE.init(); {1130#true} is VALID [2018-11-23 10:17:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:17:38,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:38,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:17:38,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-23 10:17:38,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:38,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:17:38,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:38,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:17:38,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:17:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:17:38,236 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 12 states. [2018-11-23 10:17:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:42,284 INFO L93 Difference]: Finished difference Result 162 states and 220 transitions. [2018-11-23 10:17:42,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:17:42,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2018-11-23 10:17:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:17:42,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2018-11-23 10:17:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:17:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2018-11-23 10:17:42,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 179 transitions. [2018-11-23 10:17:42,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:42,864 INFO L225 Difference]: With dead ends: 162 [2018-11-23 10:17:42,864 INFO L226 Difference]: Without dead ends: 131 [2018-11-23 10:17:42,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:17:42,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-23 10:17:42,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 76. [2018-11-23 10:17:42,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:42,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 76 states. [2018-11-23 10:17:42,964 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 76 states. [2018-11-23 10:17:42,965 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 76 states. [2018-11-23 10:17:42,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:42,974 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2018-11-23 10:17:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2018-11-23 10:17:42,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:42,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:42,977 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 131 states. [2018-11-23 10:17:42,977 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 131 states. [2018-11-23 10:17:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:42,986 INFO L93 Difference]: Finished difference Result 131 states and 171 transitions. [2018-11-23 10:17:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 171 transitions. [2018-11-23 10:17:42,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:42,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:42,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:42,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 10:17:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-11-23 10:17:42,992 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 36 [2018-11-23 10:17:42,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:42,992 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-11-23 10:17:42,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:17:42,992 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2018-11-23 10:17:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 10:17:42,994 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:42,995 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] [2018-11-23 10:17:42,995 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:42,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:42,995 INFO L82 PathProgramCache]: Analyzing trace with hash 254629660, now seen corresponding path program 3 times [2018-11-23 10:17:42,996 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:42,996 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:17:43,042 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:17:46,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 10:17:46,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:17:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:46,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:47,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {1965#true} call ULTIMATE.init(); {1965#true} is VALID [2018-11-23 10:17:47,056 INFO L273 TraceCheckUtils]: 1: Hoare triple {1965#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1965#true} is VALID [2018-11-23 10:17:47,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {1965#true} assume true; {1965#true} is VALID [2018-11-23 10:17:47,057 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1965#true} {1965#true} #74#return; {1965#true} is VALID [2018-11-23 10:17:47,057 INFO L256 TraceCheckUtils]: 4: Hoare triple {1965#true} call #t~ret11 := main(); {1965#true} is VALID [2018-11-23 10:17:47,057 INFO L273 TraceCheckUtils]: 5: Hoare triple {1965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {1965#true} is VALID [2018-11-23 10:17:47,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,058 INFO L273 TraceCheckUtils]: 12: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,060 INFO L273 TraceCheckUtils]: 20: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,060 INFO L273 TraceCheckUtils]: 21: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,060 INFO L273 TraceCheckUtils]: 22: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,060 INFO L273 TraceCheckUtils]: 24: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {1965#true} assume !~bvslt32(~i~0, 100000bv32); {1965#true} is VALID [2018-11-23 10:17:47,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {1965#true} ~i~0 := 0bv32; {2051#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:47,062 INFO L273 TraceCheckUtils]: 28: Hoare triple {2051#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32); {2051#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:47,062 INFO L273 TraceCheckUtils]: 29: Hoare triple {2051#(= main_~i~0 (_ bv0 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2051#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:17:47,063 INFO L273 TraceCheckUtils]: 30: Hoare triple {2051#(= main_~i~0 (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2061#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,063 INFO L273 TraceCheckUtils]: 31: Hoare triple {2061#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32); {2061#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,063 INFO L273 TraceCheckUtils]: 32: Hoare triple {2061#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2061#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,064 INFO L273 TraceCheckUtils]: 33: Hoare triple {2061#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2071#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:17:47,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {2071#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32); {2071#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:17:47,065 INFO L273 TraceCheckUtils]: 35: Hoare triple {2071#(= (_ bv2 32) main_~i~0)} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2071#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:17:47,065 INFO L273 TraceCheckUtils]: 36: Hoare triple {2071#(= (_ bv2 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2081#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,066 INFO L273 TraceCheckUtils]: 37: Hoare triple {2081#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32); {2081#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,066 INFO L273 TraceCheckUtils]: 38: Hoare triple {2081#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2081#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,067 INFO L273 TraceCheckUtils]: 39: Hoare triple {2081#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2091#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:17:47,068 INFO L273 TraceCheckUtils]: 40: Hoare triple {2091#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32); {2091#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:17:47,068 INFO L273 TraceCheckUtils]: 41: Hoare triple {2091#(= (_ bv4 32) main_~i~0)} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2091#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:17:47,076 INFO L273 TraceCheckUtils]: 42: Hoare triple {2091#(= (_ bv4 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2101#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,077 INFO L273 TraceCheckUtils]: 43: Hoare triple {2101#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32); {2101#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,077 INFO L273 TraceCheckUtils]: 44: Hoare triple {2101#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2101#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,078 INFO L273 TraceCheckUtils]: 45: Hoare triple {2101#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2111#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:17:47,078 INFO L273 TraceCheckUtils]: 46: Hoare triple {2111#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32); {2111#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:17:47,079 INFO L273 TraceCheckUtils]: 47: Hoare triple {2111#(= (_ bv6 32) main_~i~0)} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2111#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:17:47,097 INFO L273 TraceCheckUtils]: 48: Hoare triple {2111#(= (_ bv6 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2121#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,106 INFO L273 TraceCheckUtils]: 49: Hoare triple {2121#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32); {2121#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,119 INFO L273 TraceCheckUtils]: 50: Hoare triple {2121#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2121#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,120 INFO L273 TraceCheckUtils]: 51: Hoare triple {2121#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2131#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:17:47,120 INFO L273 TraceCheckUtils]: 52: Hoare triple {2131#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32); {2131#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:17:47,121 INFO L273 TraceCheckUtils]: 53: Hoare triple {2131#(= (_ bv8 32) main_~i~0)} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2131#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:17:47,121 INFO L273 TraceCheckUtils]: 54: Hoare triple {2131#(= (_ bv8 32) main_~i~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2141#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,122 INFO L273 TraceCheckUtils]: 55: Hoare triple {2141#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32); {2141#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,123 INFO L273 TraceCheckUtils]: 56: Hoare triple {2141#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2141#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,123 INFO L273 TraceCheckUtils]: 57: Hoare triple {2141#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2151#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:17:47,124 INFO L273 TraceCheckUtils]: 58: Hoare triple {2151#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1966#false} is VALID [2018-11-23 10:17:47,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {1966#false} ~i~0 := 0bv32; {1966#false} is VALID [2018-11-23 10:17:47,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {1966#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {1966#false} is VALID [2018-11-23 10:17:47,125 INFO L273 TraceCheckUtils]: 61: Hoare triple {1966#false} assume !#t~short10;call #t~mem9 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem9 == ~bvmul32(#t~mem7, #t~mem8); {1966#false} is VALID [2018-11-23 10:17:47,125 INFO L256 TraceCheckUtils]: 62: Hoare triple {1966#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {1966#false} is VALID [2018-11-23 10:17:47,125 INFO L273 TraceCheckUtils]: 63: Hoare triple {1966#false} ~cond := #in~cond; {1966#false} is VALID [2018-11-23 10:17:47,125 INFO L273 TraceCheckUtils]: 64: Hoare triple {1966#false} assume 0bv32 == ~cond; {1966#false} is VALID [2018-11-23 10:17:47,126 INFO L273 TraceCheckUtils]: 65: Hoare triple {1966#false} assume !false; {1966#false} is VALID [2018-11-23 10:17:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 10:17:47,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:47,878 INFO L273 TraceCheckUtils]: 65: Hoare triple {1966#false} assume !false; {1966#false} is VALID [2018-11-23 10:17:47,879 INFO L273 TraceCheckUtils]: 64: Hoare triple {1966#false} assume 0bv32 == ~cond; {1966#false} is VALID [2018-11-23 10:17:47,879 INFO L273 TraceCheckUtils]: 63: Hoare triple {1966#false} ~cond := #in~cond; {1966#false} is VALID [2018-11-23 10:17:47,879 INFO L256 TraceCheckUtils]: 62: Hoare triple {1966#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {1966#false} is VALID [2018-11-23 10:17:47,880 INFO L273 TraceCheckUtils]: 61: Hoare triple {1966#false} assume !#t~short10;call #t~mem9 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem9 == ~bvmul32(#t~mem7, #t~mem8); {1966#false} is VALID [2018-11-23 10:17:47,880 INFO L273 TraceCheckUtils]: 60: Hoare triple {1966#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {1966#false} is VALID [2018-11-23 10:17:47,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {1966#false} ~i~0 := 0bv32; {1966#false} is VALID [2018-11-23 10:17:47,880 INFO L273 TraceCheckUtils]: 58: Hoare triple {2197#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1966#false} is VALID [2018-11-23 10:17:47,881 INFO L273 TraceCheckUtils]: 57: Hoare triple {2201#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2197#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:17:47,881 INFO L273 TraceCheckUtils]: 56: Hoare triple {2201#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2201#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,882 INFO L273 TraceCheckUtils]: 55: Hoare triple {2201#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2201#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,888 INFO L273 TraceCheckUtils]: 54: Hoare triple {2211#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2201#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,889 INFO L273 TraceCheckUtils]: 53: Hoare triple {2211#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2211#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,889 INFO L273 TraceCheckUtils]: 52: Hoare triple {2211#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2211#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,895 INFO L273 TraceCheckUtils]: 51: Hoare triple {2221#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2211#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,895 INFO L273 TraceCheckUtils]: 50: Hoare triple {2221#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2221#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,896 INFO L273 TraceCheckUtils]: 49: Hoare triple {2221#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2221#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,902 INFO L273 TraceCheckUtils]: 48: Hoare triple {2231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2221#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,902 INFO L273 TraceCheckUtils]: 47: Hoare triple {2231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,902 INFO L273 TraceCheckUtils]: 46: Hoare triple {2231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,907 INFO L273 TraceCheckUtils]: 45: Hoare triple {2241#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,908 INFO L273 TraceCheckUtils]: 44: Hoare triple {2241#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2241#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,909 INFO L273 TraceCheckUtils]: 43: Hoare triple {2241#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2241#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,913 INFO L273 TraceCheckUtils]: 42: Hoare triple {2251#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2241#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,914 INFO L273 TraceCheckUtils]: 41: Hoare triple {2251#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2251#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,915 INFO L273 TraceCheckUtils]: 40: Hoare triple {2251#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2251#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,921 INFO L273 TraceCheckUtils]: 39: Hoare triple {2261#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2251#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,925 INFO L273 TraceCheckUtils]: 38: Hoare triple {2261#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2261#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {2261#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2261#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,932 INFO L273 TraceCheckUtils]: 36: Hoare triple {2271#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2261#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,932 INFO L273 TraceCheckUtils]: 35: Hoare triple {2271#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2271#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,933 INFO L273 TraceCheckUtils]: 34: Hoare triple {2271#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2271#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,939 INFO L273 TraceCheckUtils]: 33: Hoare triple {2281#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2271#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,939 INFO L273 TraceCheckUtils]: 32: Hoare triple {2281#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2281#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,940 INFO L273 TraceCheckUtils]: 31: Hoare triple {2281#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2281#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,946 INFO L273 TraceCheckUtils]: 30: Hoare triple {2291#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {2281#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {2291#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {2291#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,947 INFO L273 TraceCheckUtils]: 28: Hoare triple {2291#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32); {2291#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,948 INFO L273 TraceCheckUtils]: 27: Hoare triple {1965#true} ~i~0 := 0bv32; {2291#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:17:47,948 INFO L273 TraceCheckUtils]: 26: Hoare triple {1965#true} assume !~bvslt32(~i~0, 100000bv32); {1965#true} is VALID [2018-11-23 10:17:47,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,948 INFO L273 TraceCheckUtils]: 24: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,950 INFO L273 TraceCheckUtils]: 23: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,950 INFO L273 TraceCheckUtils]: 22: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,951 INFO L273 TraceCheckUtils]: 20: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,951 INFO L273 TraceCheckUtils]: 19: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,952 INFO L273 TraceCheckUtils]: 15: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,952 INFO L273 TraceCheckUtils]: 14: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,952 INFO L273 TraceCheckUtils]: 13: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,953 INFO L273 TraceCheckUtils]: 12: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {1965#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1965#true} is VALID [2018-11-23 10:17:47,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {1965#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1965#true} is VALID [2018-11-23 10:17:47,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {1965#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {1965#true} is VALID [2018-11-23 10:17:47,954 INFO L256 TraceCheckUtils]: 4: Hoare triple {1965#true} call #t~ret11 := main(); {1965#true} is VALID [2018-11-23 10:17:47,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1965#true} {1965#true} #74#return; {1965#true} is VALID [2018-11-23 10:17:47,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {1965#true} assume true; {1965#true} is VALID [2018-11-23 10:17:47,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {1965#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1965#true} is VALID [2018-11-23 10:17:47,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {1965#true} call ULTIMATE.init(); {1965#true} is VALID [2018-11-23 10:17:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 10:17:47,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:47,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:17:47,974 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-11-23 10:17:47,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:47,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:17:48,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:48,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:17:48,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:17:48,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:17:48,141 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand 24 states. [2018-11-23 10:18:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:05,561 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2018-11-23 10:18:05,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:18:05,561 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-11-23 10:18:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:18:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:18:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 347 transitions. [2018-11-23 10:18:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:18:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 347 transitions. [2018-11-23 10:18:05,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 347 transitions. [2018-11-23 10:18:06,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:18:06,667 INFO L225 Difference]: With dead ends: 312 [2018-11-23 10:18:06,667 INFO L226 Difference]: Without dead ends: 263 [2018-11-23 10:18:06,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:18:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-23 10:18:06,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 136. [2018-11-23 10:18:06,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:18:06,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand 136 states. [2018-11-23 10:18:06,885 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand 136 states. [2018-11-23 10:18:06,885 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 136 states. [2018-11-23 10:18:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:06,901 INFO L93 Difference]: Finished difference Result 263 states and 351 transitions. [2018-11-23 10:18:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 351 transitions. [2018-11-23 10:18:06,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:06,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:06,903 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 263 states. [2018-11-23 10:18:06,903 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 263 states. [2018-11-23 10:18:06,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:06,918 INFO L93 Difference]: Finished difference Result 263 states and 351 transitions. [2018-11-23 10:18:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 351 transitions. [2018-11-23 10:18:06,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:06,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:06,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:18:06,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:18:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 10:18:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2018-11-23 10:18:06,926 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 66 [2018-11-23 10:18:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:18:06,926 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2018-11-23 10:18:06,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:18:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2018-11-23 10:18:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 10:18:06,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:18:06,930 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] [2018-11-23 10:18:06,931 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:18:06,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:18:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1351964044, now seen corresponding path program 4 times [2018-11-23 10:18:06,932 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:18:06,932 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:18:06,964 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:18:07,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:18:07,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:18:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:18:07,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:18:07,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {3578#true} call ULTIMATE.init(); {3578#true} is VALID [2018-11-23 10:18:07,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {3578#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3578#true} is VALID [2018-11-23 10:18:07,846 INFO L273 TraceCheckUtils]: 2: Hoare triple {3578#true} assume true; {3578#true} is VALID [2018-11-23 10:18:07,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3578#true} {3578#true} #74#return; {3578#true} is VALID [2018-11-23 10:18:07,847 INFO L256 TraceCheckUtils]: 4: Hoare triple {3578#true} call #t~ret11 := main(); {3578#true} is VALID [2018-11-23 10:18:07,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {3578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {3598#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:18:07,848 INFO L273 TraceCheckUtils]: 6: Hoare triple {3598#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3598#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:18:07,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {3598#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3605#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {3605#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3605#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {3605#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3612#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:18:07,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {3612#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3612#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:18:07,850 INFO L273 TraceCheckUtils]: 11: Hoare triple {3612#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3619#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,851 INFO L273 TraceCheckUtils]: 12: Hoare triple {3619#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3619#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,852 INFO L273 TraceCheckUtils]: 13: Hoare triple {3619#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3626#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:18:07,852 INFO L273 TraceCheckUtils]: 14: Hoare triple {3626#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3626#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:18:07,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {3626#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3633#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {3633#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3633#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {3633#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3640#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:18:07,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {3640#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3640#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:18:07,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {3640#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3647#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,857 INFO L273 TraceCheckUtils]: 20: Hoare triple {3647#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3647#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,858 INFO L273 TraceCheckUtils]: 21: Hoare triple {3647#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3654#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:18:07,858 INFO L273 TraceCheckUtils]: 22: Hoare triple {3654#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3654#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:18:07,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {3654#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3661#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,859 INFO L273 TraceCheckUtils]: 24: Hoare triple {3661#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3661#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,860 INFO L273 TraceCheckUtils]: 25: Hoare triple {3661#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3668#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:18:07,861 INFO L273 TraceCheckUtils]: 26: Hoare triple {3668#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3668#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:18:07,861 INFO L273 TraceCheckUtils]: 27: Hoare triple {3668#(= (_ bv10 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3675#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {3675#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3675#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {3675#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3682#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:18:07,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {3682#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3682#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:18:07,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {3682#(= (_ bv12 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3689#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,865 INFO L273 TraceCheckUtils]: 32: Hoare triple {3689#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3689#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,865 INFO L273 TraceCheckUtils]: 33: Hoare triple {3689#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3696#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:18:07,866 INFO L273 TraceCheckUtils]: 34: Hoare triple {3696#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3696#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:18:07,867 INFO L273 TraceCheckUtils]: 35: Hoare triple {3696#(= (_ bv14 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3703#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,867 INFO L273 TraceCheckUtils]: 36: Hoare triple {3703#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3703#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,868 INFO L273 TraceCheckUtils]: 37: Hoare triple {3703#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3710#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:18:07,869 INFO L273 TraceCheckUtils]: 38: Hoare triple {3710#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3710#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:18:07,870 INFO L273 TraceCheckUtils]: 39: Hoare triple {3710#(= (_ bv16 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3717#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,870 INFO L273 TraceCheckUtils]: 40: Hoare triple {3717#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3717#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,871 INFO L273 TraceCheckUtils]: 41: Hoare triple {3717#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3724#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:18:07,872 INFO L273 TraceCheckUtils]: 42: Hoare triple {3724#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3724#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:18:07,872 INFO L273 TraceCheckUtils]: 43: Hoare triple {3724#(= (_ bv18 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3731#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,873 INFO L273 TraceCheckUtils]: 44: Hoare triple {3731#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3731#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,874 INFO L273 TraceCheckUtils]: 45: Hoare triple {3731#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3738#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:18:07,875 INFO L273 TraceCheckUtils]: 46: Hoare triple {3738#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3738#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:18:07,876 INFO L273 TraceCheckUtils]: 47: Hoare triple {3738#(= (_ bv20 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,876 INFO L273 TraceCheckUtils]: 48: Hoare triple {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,877 INFO L273 TraceCheckUtils]: 49: Hoare triple {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3752#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:07,878 INFO L273 TraceCheckUtils]: 50: Hoare triple {3752#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,878 INFO L273 TraceCheckUtils]: 51: Hoare triple {3579#false} ~i~0 := 0bv32; {3579#false} is VALID [2018-11-23 10:18:07,878 INFO L273 TraceCheckUtils]: 52: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,878 INFO L273 TraceCheckUtils]: 53: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,879 INFO L273 TraceCheckUtils]: 54: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,879 INFO L273 TraceCheckUtils]: 55: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,879 INFO L273 TraceCheckUtils]: 56: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,880 INFO L273 TraceCheckUtils]: 57: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,880 INFO L273 TraceCheckUtils]: 58: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,881 INFO L273 TraceCheckUtils]: 60: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,881 INFO L273 TraceCheckUtils]: 61: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,881 INFO L273 TraceCheckUtils]: 62: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,882 INFO L273 TraceCheckUtils]: 63: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,882 INFO L273 TraceCheckUtils]: 64: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,882 INFO L273 TraceCheckUtils]: 65: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,883 INFO L273 TraceCheckUtils]: 66: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,883 INFO L273 TraceCheckUtils]: 67: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,883 INFO L273 TraceCheckUtils]: 68: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,883 INFO L273 TraceCheckUtils]: 69: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,884 INFO L273 TraceCheckUtils]: 70: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,884 INFO L273 TraceCheckUtils]: 71: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,884 INFO L273 TraceCheckUtils]: 72: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,884 INFO L273 TraceCheckUtils]: 73: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,884 INFO L273 TraceCheckUtils]: 74: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,885 INFO L273 TraceCheckUtils]: 75: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,885 INFO L273 TraceCheckUtils]: 76: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,885 INFO L273 TraceCheckUtils]: 77: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,885 INFO L273 TraceCheckUtils]: 78: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,885 INFO L273 TraceCheckUtils]: 79: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,886 INFO L273 TraceCheckUtils]: 80: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,886 INFO L273 TraceCheckUtils]: 81: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,886 INFO L273 TraceCheckUtils]: 82: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,886 INFO L273 TraceCheckUtils]: 83: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,886 INFO L273 TraceCheckUtils]: 84: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,887 INFO L273 TraceCheckUtils]: 85: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,887 INFO L273 TraceCheckUtils]: 86: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,887 INFO L273 TraceCheckUtils]: 87: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,887 INFO L273 TraceCheckUtils]: 88: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,887 INFO L273 TraceCheckUtils]: 89: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,888 INFO L273 TraceCheckUtils]: 90: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,888 INFO L273 TraceCheckUtils]: 91: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,888 INFO L273 TraceCheckUtils]: 92: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,888 INFO L273 TraceCheckUtils]: 93: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,888 INFO L273 TraceCheckUtils]: 94: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,889 INFO L273 TraceCheckUtils]: 95: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,889 INFO L273 TraceCheckUtils]: 96: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,889 INFO L273 TraceCheckUtils]: 97: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,889 INFO L273 TraceCheckUtils]: 98: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,889 INFO L273 TraceCheckUtils]: 99: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,890 INFO L273 TraceCheckUtils]: 100: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,890 INFO L273 TraceCheckUtils]: 101: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,890 INFO L273 TraceCheckUtils]: 102: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,890 INFO L273 TraceCheckUtils]: 103: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,890 INFO L273 TraceCheckUtils]: 104: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,891 INFO L273 TraceCheckUtils]: 105: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,891 INFO L273 TraceCheckUtils]: 106: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,891 INFO L273 TraceCheckUtils]: 107: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,891 INFO L273 TraceCheckUtils]: 108: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,891 INFO L273 TraceCheckUtils]: 109: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,892 INFO L273 TraceCheckUtils]: 110: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,892 INFO L273 TraceCheckUtils]: 111: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,892 INFO L273 TraceCheckUtils]: 112: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,892 INFO L273 TraceCheckUtils]: 113: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,892 INFO L273 TraceCheckUtils]: 114: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,892 INFO L273 TraceCheckUtils]: 115: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,892 INFO L273 TraceCheckUtils]: 116: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:07,893 INFO L273 TraceCheckUtils]: 117: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:07,893 INFO L273 TraceCheckUtils]: 118: Hoare triple {3579#false} assume !~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:07,893 INFO L273 TraceCheckUtils]: 119: Hoare triple {3579#false} ~i~0 := 0bv32; {3579#false} is VALID [2018-11-23 10:18:07,893 INFO L273 TraceCheckUtils]: 120: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {3579#false} is VALID [2018-11-23 10:18:07,893 INFO L273 TraceCheckUtils]: 121: Hoare triple {3579#false} assume !#t~short10;call #t~mem9 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem9 == ~bvmul32(#t~mem7, #t~mem8); {3579#false} is VALID [2018-11-23 10:18:07,893 INFO L256 TraceCheckUtils]: 122: Hoare triple {3579#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {3579#false} is VALID [2018-11-23 10:18:07,894 INFO L273 TraceCheckUtils]: 123: Hoare triple {3579#false} ~cond := #in~cond; {3579#false} is VALID [2018-11-23 10:18:07,894 INFO L273 TraceCheckUtils]: 124: Hoare triple {3579#false} assume 0bv32 == ~cond; {3579#false} is VALID [2018-11-23 10:18:07,894 INFO L273 TraceCheckUtils]: 125: Hoare triple {3579#false} assume !false; {3579#false} is VALID [2018-11-23 10:18:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-11-23 10:18:07,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:18:10,230 INFO L273 TraceCheckUtils]: 125: Hoare triple {3579#false} assume !false; {3579#false} is VALID [2018-11-23 10:18:10,230 INFO L273 TraceCheckUtils]: 124: Hoare triple {3579#false} assume 0bv32 == ~cond; {3579#false} is VALID [2018-11-23 10:18:10,230 INFO L273 TraceCheckUtils]: 123: Hoare triple {3579#false} ~cond := #in~cond; {3579#false} is VALID [2018-11-23 10:18:10,231 INFO L256 TraceCheckUtils]: 122: Hoare triple {3579#false} call __VERIFIER_assert((if #t~short10 then 1bv32 else 0bv32)); {3579#false} is VALID [2018-11-23 10:18:10,231 INFO L273 TraceCheckUtils]: 121: Hoare triple {3579#false} assume !#t~short10;call #t~mem9 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem9 == ~bvmul32(#t~mem7, #t~mem8); {3579#false} is VALID [2018-11-23 10:18:10,231 INFO L273 TraceCheckUtils]: 120: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem6 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short10 := #t~mem5 == #t~mem6; {3579#false} is VALID [2018-11-23 10:18:10,231 INFO L273 TraceCheckUtils]: 119: Hoare triple {3579#false} ~i~0 := 0bv32; {3579#false} is VALID [2018-11-23 10:18:10,232 INFO L273 TraceCheckUtils]: 118: Hoare triple {3579#false} assume !~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,232 INFO L273 TraceCheckUtils]: 117: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,232 INFO L273 TraceCheckUtils]: 116: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,232 INFO L273 TraceCheckUtils]: 115: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,233 INFO L273 TraceCheckUtils]: 114: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,233 INFO L273 TraceCheckUtils]: 113: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,233 INFO L273 TraceCheckUtils]: 112: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,233 INFO L273 TraceCheckUtils]: 111: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,233 INFO L273 TraceCheckUtils]: 110: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,233 INFO L273 TraceCheckUtils]: 109: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,234 INFO L273 TraceCheckUtils]: 108: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,234 INFO L273 TraceCheckUtils]: 107: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,234 INFO L273 TraceCheckUtils]: 106: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,234 INFO L273 TraceCheckUtils]: 105: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,234 INFO L273 TraceCheckUtils]: 104: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,234 INFO L273 TraceCheckUtils]: 103: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,234 INFO L273 TraceCheckUtils]: 102: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,235 INFO L273 TraceCheckUtils]: 101: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,235 INFO L273 TraceCheckUtils]: 100: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,235 INFO L273 TraceCheckUtils]: 99: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,235 INFO L273 TraceCheckUtils]: 98: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,235 INFO L273 TraceCheckUtils]: 97: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,235 INFO L273 TraceCheckUtils]: 96: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,235 INFO L273 TraceCheckUtils]: 95: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,235 INFO L273 TraceCheckUtils]: 94: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,236 INFO L273 TraceCheckUtils]: 93: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,236 INFO L273 TraceCheckUtils]: 92: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,236 INFO L273 TraceCheckUtils]: 91: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,236 INFO L273 TraceCheckUtils]: 90: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,236 INFO L273 TraceCheckUtils]: 89: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,236 INFO L273 TraceCheckUtils]: 88: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,236 INFO L273 TraceCheckUtils]: 87: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,237 INFO L273 TraceCheckUtils]: 86: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,237 INFO L273 TraceCheckUtils]: 85: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,237 INFO L273 TraceCheckUtils]: 84: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,237 INFO L273 TraceCheckUtils]: 83: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,237 INFO L273 TraceCheckUtils]: 82: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,237 INFO L273 TraceCheckUtils]: 81: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,237 INFO L273 TraceCheckUtils]: 80: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,237 INFO L273 TraceCheckUtils]: 79: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,238 INFO L273 TraceCheckUtils]: 78: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,238 INFO L273 TraceCheckUtils]: 77: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,238 INFO L273 TraceCheckUtils]: 76: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,238 INFO L273 TraceCheckUtils]: 75: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,238 INFO L273 TraceCheckUtils]: 74: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,238 INFO L273 TraceCheckUtils]: 73: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,238 INFO L273 TraceCheckUtils]: 72: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,239 INFO L273 TraceCheckUtils]: 71: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,239 INFO L273 TraceCheckUtils]: 70: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,239 INFO L273 TraceCheckUtils]: 69: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,239 INFO L273 TraceCheckUtils]: 66: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,239 INFO L273 TraceCheckUtils]: 65: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,239 INFO L273 TraceCheckUtils]: 64: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,240 INFO L273 TraceCheckUtils]: 63: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,240 INFO L273 TraceCheckUtils]: 62: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,240 INFO L273 TraceCheckUtils]: 61: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,240 INFO L273 TraceCheckUtils]: 60: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,240 INFO L273 TraceCheckUtils]: 59: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,240 INFO L273 TraceCheckUtils]: 58: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,240 INFO L273 TraceCheckUtils]: 57: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,241 INFO L273 TraceCheckUtils]: 56: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,241 INFO L273 TraceCheckUtils]: 55: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,241 INFO L273 TraceCheckUtils]: 54: Hoare triple {3579#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {3579#false} is VALID [2018-11-23 10:18:10,241 INFO L273 TraceCheckUtils]: 53: Hoare triple {3579#false} assume !(0bv16 != #t~nondet2);havoc #t~nondet2; {3579#false} is VALID [2018-11-23 10:18:10,241 INFO L273 TraceCheckUtils]: 52: Hoare triple {3579#false} assume !!~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,241 INFO L273 TraceCheckUtils]: 51: Hoare triple {3579#false} ~i~0 := 0bv32; {3579#false} is VALID [2018-11-23 10:18:10,242 INFO L273 TraceCheckUtils]: 50: Hoare triple {4206#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3579#false} is VALID [2018-11-23 10:18:10,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {4210#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4206#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:18:10,243 INFO L273 TraceCheckUtils]: 48: Hoare triple {4210#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4210#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {4217#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4210#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,249 INFO L273 TraceCheckUtils]: 46: Hoare triple {4217#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4217#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,257 INFO L273 TraceCheckUtils]: 45: Hoare triple {4224#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4217#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,257 INFO L273 TraceCheckUtils]: 44: Hoare triple {4224#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4224#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,263 INFO L273 TraceCheckUtils]: 43: Hoare triple {4231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4224#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {4231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,269 INFO L273 TraceCheckUtils]: 41: Hoare triple {4238#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4231#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,270 INFO L273 TraceCheckUtils]: 40: Hoare triple {4238#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4238#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,274 INFO L273 TraceCheckUtils]: 39: Hoare triple {4245#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4238#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,275 INFO L273 TraceCheckUtils]: 38: Hoare triple {4245#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4245#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,283 INFO L273 TraceCheckUtils]: 37: Hoare triple {4252#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4245#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,284 INFO L273 TraceCheckUtils]: 36: Hoare triple {4252#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4252#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,290 INFO L273 TraceCheckUtils]: 35: Hoare triple {4259#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4252#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,291 INFO L273 TraceCheckUtils]: 34: Hoare triple {4259#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4259#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,309 INFO L273 TraceCheckUtils]: 33: Hoare triple {4266#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4259#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,310 INFO L273 TraceCheckUtils]: 32: Hoare triple {4266#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4266#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {4273#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4266#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {4273#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4273#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,325 INFO L273 TraceCheckUtils]: 29: Hoare triple {4280#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4273#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,326 INFO L273 TraceCheckUtils]: 28: Hoare triple {4280#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4280#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {4287#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4280#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {4287#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4287#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,337 INFO L273 TraceCheckUtils]: 25: Hoare triple {4294#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4287#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {4294#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4294#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,343 INFO L273 TraceCheckUtils]: 23: Hoare triple {4301#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4294#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {4301#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4301#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {4308#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4301#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {4308#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4308#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,360 INFO L273 TraceCheckUtils]: 19: Hoare triple {4315#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4308#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {4315#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4315#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,366 INFO L273 TraceCheckUtils]: 17: Hoare triple {4322#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4315#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,367 INFO L273 TraceCheckUtils]: 16: Hoare triple {4322#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4322#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {4329#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4322#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {4329#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4329#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {4336#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4329#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {4336#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4336#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {4343#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4336#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {4343#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4343#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {4350#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4343#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {4350#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4350#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {4357#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4350#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,399 INFO L273 TraceCheckUtils]: 6: Hoare triple {4357#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~i~0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4357#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {3578#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);havoc ~k~0;havoc ~i~0;~i~0 := 0bv32; {4357#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:18:10,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {3578#true} call #t~ret11 := main(); {3578#true} is VALID [2018-11-23 10:18:10,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3578#true} {3578#true} #74#return; {3578#true} is VALID [2018-11-23 10:18:10,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {3578#true} assume true; {3578#true} is VALID [2018-11-23 10:18:10,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {3578#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3578#true} is VALID [2018-11-23 10:18:10,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {3578#true} call ULTIMATE.init(); {3578#true} is VALID [2018-11-23 10:18:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2018-11-23 10:18:10,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:18:10,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:18:10,416 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 126 [2018-11-23 10:18:10,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:18:10,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:18:10,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:18:10,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:18:10,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:18:10,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:18:10,763 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand 48 states. [2018-11-23 10:18:19,399 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:18:19,899 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:18:20,542 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:18:21,123 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:18:21,734 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:18:22,311 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:18:22,904 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:18:23,495 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:19:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:19:26,478 INFO L93 Difference]: Finished difference Result 612 states and 868 transitions. [2018-11-23 10:19:26,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:19:26,479 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 126 [2018-11-23 10:19:26,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:19:26,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:19:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 683 transitions. [2018-11-23 10:19:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:19:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 683 transitions. [2018-11-23 10:19:26,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 683 transitions. [2018-11-23 10:19:28,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 683 edges. 683 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:19:28,473 INFO L225 Difference]: With dead ends: 612 [2018-11-23 10:19:28,474 INFO L226 Difference]: Without dead ends: 527 [2018-11-23 10:19:28,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:19:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-11-23 10:19:29,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 256. [2018-11-23 10:19:29,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:19:29,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 527 states. Second operand 256 states. [2018-11-23 10:19:29,080 INFO L74 IsIncluded]: Start isIncluded. First operand 527 states. Second operand 256 states. [2018-11-23 10:19:29,080 INFO L87 Difference]: Start difference. First operand 527 states. Second operand 256 states. [2018-11-23 10:19:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:19:29,139 INFO L93 Difference]: Finished difference Result 527 states and 711 transitions. [2018-11-23 10:19:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 711 transitions. [2018-11-23 10:19:29,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:19:29,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:19:29,142 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 527 states. [2018-11-23 10:19:29,142 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 527 states. [2018-11-23 10:19:29,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:19:29,177 INFO L93 Difference]: Finished difference Result 527 states and 711 transitions. [2018-11-23 10:19:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 711 transitions. [2018-11-23 10:19:29,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:19:29,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:19:29,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:19:29,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:19:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 10:19:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 305 transitions. [2018-11-23 10:19:29,189 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 305 transitions. Word has length 126 [2018-11-23 10:19:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:19:29,190 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 305 transitions. [2018-11-23 10:19:29,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:19:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 305 transitions. [2018-11-23 10:19:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-11-23 10:19:29,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:19:29,194 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] [2018-11-23 10:19:29,194 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:19:29,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:19:29,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1314631388, now seen corresponding path program 5 times [2018-11-23 10:19:29,196 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:19:29,196 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:19:29,225 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1