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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/mlceu_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:04:57,260 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:04:57,262 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:04:57,279 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:04:57,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:04:57,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:04:57,283 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:04:57,285 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:04:57,287 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:04:57,288 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:04:57,295 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:04:57,296 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:04:57,298 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:04:57,299 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:04:57,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:04:57,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:04:57,304 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:04:57,307 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:04:57,311 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:04:57,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:04:57,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:04:57,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:04:57,323 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:04:57,324 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:04:57,324 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:04:57,325 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:04:57,326 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:04:57,327 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:04:57,330 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:04:57,331 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:04:57,331 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:04:57,333 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:04:57,334 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:04:57,334 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:04:57,335 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:04:57,335 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:04:57,336 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-18 21:04:57,363 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:04:57,363 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:04:57,364 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:04:57,365 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:04:57,366 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:04:57,366 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:04:57,366 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:04:57,366 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:04:57,367 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:04:57,367 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:04:57,367 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:04:57,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:04:57,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:04:57,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:04:57,369 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:04:57,369 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:04:57,369 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:04:57,370 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:04:57,370 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:04:57,370 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:04:57,370 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:04:57,371 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:04:57,372 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:04:57,372 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:04:57,372 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:04:57,373 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:04:57,373 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:04:57,373 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:04:57,373 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:04:57,373 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:04:57,374 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:04:57,374 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:04:57,374 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:04:57,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:04:57,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:04:57,465 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:04:57,467 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:04:57,467 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:04:57,468 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mlceu_false-unreach-call.i [2018-11-18 21:04:57,529 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5d531c6/7fdb7068f19d40f79b0f28838d3acec0/FLAG3614a35e1 [2018-11-18 21:04:57,948 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:04:57,948 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mlceu_false-unreach-call.i [2018-11-18 21:04:57,956 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5d531c6/7fdb7068f19d40f79b0f28838d3acec0/FLAG3614a35e1 [2018-11-18 21:04:58,319 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e5d531c6/7fdb7068f19d40f79b0f28838d3acec0 [2018-11-18 21:04:58,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:04:58,331 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:04:58,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:04:58,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:04:58,336 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:04:58,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:04:58" (1/1) ... [2018-11-18 21:04:58,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7736873c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58, skipping insertion in model container [2018-11-18 21:04:58,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:04:58" (1/1) ... [2018-11-18 21:04:58,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:04:58,372 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:04:58,646 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:04:58,654 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:04:58,685 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:04:58,717 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:04:58,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58 WrapperNode [2018-11-18 21:04:58,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:04:58,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:04:58,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:04:58,719 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:04:58,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58" (1/1) ... [2018-11-18 21:04:58,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58" (1/1) ... [2018-11-18 21:04:58,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58" (1/1) ... [2018-11-18 21:04:58,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58" (1/1) ... [2018-11-18 21:04:58,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58" (1/1) ... [2018-11-18 21:04:58,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58" (1/1) ... [2018-11-18 21:04:58,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58" (1/1) ... [2018-11-18 21:04:58,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:04:58,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:04:58,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:04:58,788 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:04:58,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58" (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-18 21:04:58,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:04:58,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:04:58,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 21:04:58,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:04:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:04:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 21:04:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 21:04:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:04:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:04:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:04:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:04:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:04:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:04:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:04:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:04:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:04:59,494 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:04:59,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:04:59 BoogieIcfgContainer [2018-11-18 21:04:59,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:04:59,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:04:59,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:04:59,499 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:04:59,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:04:58" (1/3) ... [2018-11-18 21:04:59,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4472c75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:04:59, skipping insertion in model container [2018-11-18 21:04:59,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:04:58" (2/3) ... [2018-11-18 21:04:59,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4472c75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:04:59, skipping insertion in model container [2018-11-18 21:04:59,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:04:59" (3/3) ... [2018-11-18 21:04:59,503 INFO L112 eAbstractionObserver]: Analyzing ICFG mlceu_false-unreach-call.i [2018-11-18 21:04:59,511 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:04:59,518 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:04:59,535 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:04:59,567 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:04:59,568 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:04:59,568 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:04:59,569 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:04:59,569 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:04:59,569 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:04:59,570 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:04:59,570 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:04:59,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:04:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-18 21:04:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 21:04:59,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:04:59,597 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:04:59,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:04:59,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:04:59,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1484785060, now seen corresponding path program 1 times [2018-11-18 21:04:59,608 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:04:59,609 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-18 21:04:59,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:04:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:04:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:04:59,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:04:59,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-18 21:04:59,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {32#true} is VALID [2018-11-18 21:04:59,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-18 21:04:59,852 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2018-11-18 21:04:59,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2018-11-18 21:04:59,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {32#true} is VALID [2018-11-18 21:04:59,853 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {32#true} is VALID [2018-11-18 21:04:59,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-18 21:04:59,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-18 21:04:59,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2018-11-18 21:04:59,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {33#false} is VALID [2018-11-18 21:04:59,855 INFO L256 TraceCheckUtils]: 11: Hoare triple {33#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-18 21:04:59,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-18 21:04:59,856 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume 0bv32 == ~cond; {33#false} is VALID [2018-11-18 21:04:59,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-18 21:04:59,859 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-18 21:04:59,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:04:59,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:04:59,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 21:04:59,870 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-18 21:04:59,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:04:59,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 21:05:00,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:00,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 21:05:00,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 21:05:00,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:05:00,042 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-18 21:05:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:00,289 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-18 21:05:00,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 21:05:00,292 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-18 21:05:00,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:05:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:05:00,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-18 21:05:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:05:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-18 21:05:00,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2018-11-18 21:05:00,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:00,596 INFO L225 Difference]: With dead ends: 47 [2018-11-18 21:05:00,596 INFO L226 Difference]: Without dead ends: 23 [2018-11-18 21:05:00,600 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-18 21:05:00,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-18 21:05:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-18 21:05:00,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:05:00,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-18 21:05:00,644 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-18 21:05:00,645 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-18 21:05:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:00,649 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 21:05:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 21:05:00,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:00,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:00,650 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-18 21:05:00,651 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-18 21:05:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:00,655 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-18 21:05:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 21:05:00,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:00,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:00,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:05:00,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:05:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 21:05:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-18 21:05:00,661 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-18 21:05:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:05:00,661 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-18 21:05:00,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 21:05:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-18 21:05:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 21:05:00,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:05:00,663 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:05:00,663 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:05:00,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:05:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 144632911, now seen corresponding path program 1 times [2018-11-18 21:05:00,664 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:05:00,665 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-18 21:05:00,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:05:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:00,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:05:00,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {213#true} is VALID [2018-11-18 21:05:00,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {213#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {213#true} is VALID [2018-11-18 21:05:00,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2018-11-18 21:05:00,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #63#return; {213#true} is VALID [2018-11-18 21:05:00,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret5 := main(); {213#true} is VALID [2018-11-18 21:05:00,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {213#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {213#true} is VALID [2018-11-18 21:05:00,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {213#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {236#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:00,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {236#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {236#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:00,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {236#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {214#false} is VALID [2018-11-18 21:05:00,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#false} ~i~0 := 0bv32; {214#false} is VALID [2018-11-18 21:05:00,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#false} assume true; {214#false} is VALID [2018-11-18 21:05:00,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {214#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {214#false} is VALID [2018-11-18 21:05:00,833 INFO L256 TraceCheckUtils]: 12: Hoare triple {214#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {214#false} is VALID [2018-11-18 21:05:00,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {214#false} ~cond := #in~cond; {214#false} is VALID [2018-11-18 21:05:00,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {214#false} assume 0bv32 == ~cond; {214#false} is VALID [2018-11-18 21:05:00,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {214#false} assume !false; {214#false} is VALID [2018-11-18 21:05:00,836 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-18 21:05:00,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:05:00,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:05:00,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:05:00,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 21:05:00,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:05:00,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:05:00,897 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-18 21:05:00,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:05:00,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:05:00,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:05:00,898 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-18 21:05:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:01,387 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-18 21:05:01,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:05:01,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-18 21:05:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:05:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:05:01,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-18 21:05:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:05:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-18 21:05:01,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-18 21:05:01,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:01,553 INFO L225 Difference]: With dead ends: 43 [2018-11-18 21:05:01,553 INFO L226 Difference]: Without dead ends: 27 [2018-11-18 21:05:01,554 INFO L604 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-18 21:05:01,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-18 21:05:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-18 21:05:01,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:05:01,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-18 21:05:01,577 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-18 21:05:01,577 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-18 21:05:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:01,579 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-18 21:05:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 21:05:01,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:01,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:01,581 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-18 21:05:01,581 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-18 21:05:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:01,584 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-18 21:05:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-18 21:05:01,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:01,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:01,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:05:01,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:05:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 21:05:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-18 21:05:01,588 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2018-11-18 21:05:01,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:05:01,588 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-18 21:05:01,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:05:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-18 21:05:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 21:05:01,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:05:01,590 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:05:01,590 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:05:01,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:05:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1739329064, now seen corresponding path program 1 times [2018-11-18 21:05:01,591 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:05:01,591 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-18 21:05:01,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:05:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:01,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:05:01,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {408#true} is VALID [2018-11-18 21:05:01,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {408#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {408#true} is VALID [2018-11-18 21:05:01,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-18 21:05:01,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #63#return; {408#true} is VALID [2018-11-18 21:05:01,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret5 := main(); {408#true} is VALID [2018-11-18 21:05:01,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {408#true} is VALID [2018-11-18 21:05:01,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {408#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:01,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:01,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:01,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:01,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {444#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:01,803 INFO L273 TraceCheckUtils]: 11: Hoare triple {444#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {444#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:01,804 INFO L273 TraceCheckUtils]: 12: Hoare triple {444#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {409#false} is VALID [2018-11-18 21:05:01,805 INFO L273 TraceCheckUtils]: 13: Hoare triple {409#false} ~i~0 := 0bv32; {409#false} is VALID [2018-11-18 21:05:01,805 INFO L273 TraceCheckUtils]: 14: Hoare triple {409#false} assume true; {409#false} is VALID [2018-11-18 21:05:01,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {409#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {409#false} is VALID [2018-11-18 21:05:01,806 INFO L256 TraceCheckUtils]: 16: Hoare triple {409#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {409#false} is VALID [2018-11-18 21:05:01,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {409#false} ~cond := #in~cond; {409#false} is VALID [2018-11-18 21:05:01,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#false} assume 0bv32 == ~cond; {409#false} is VALID [2018-11-18 21:05:01,807 INFO L273 TraceCheckUtils]: 19: Hoare triple {409#false} assume !false; {409#false} is VALID [2018-11-18 21:05:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:05:01,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:05:02,031 INFO L273 TraceCheckUtils]: 19: Hoare triple {409#false} assume !false; {409#false} is VALID [2018-11-18 21:05:02,032 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#false} assume 0bv32 == ~cond; {409#false} is VALID [2018-11-18 21:05:02,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {409#false} ~cond := #in~cond; {409#false} is VALID [2018-11-18 21:05:02,032 INFO L256 TraceCheckUtils]: 16: Hoare triple {409#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {409#false} is VALID [2018-11-18 21:05:02,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {409#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {409#false} is VALID [2018-11-18 21:05:02,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {409#false} assume true; {409#false} is VALID [2018-11-18 21:05:02,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {409#false} ~i~0 := 0bv32; {409#false} is VALID [2018-11-18 21:05:02,034 INFO L273 TraceCheckUtils]: 12: Hoare triple {493#(bvslt main_~i~0 ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {409#false} is VALID [2018-11-18 21:05:02,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {493#(bvslt main_~i~0 ~SIZE~0)} assume true; {493#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-18 21:05:02,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {493#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-18 21:05:02,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-18 21:05:02,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-18 21:05:02,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume true; {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-18 21:05:02,045 INFO L273 TraceCheckUtils]: 6: Hoare triple {408#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-18 21:05:02,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {408#true} is VALID [2018-11-18 21:05:02,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret5 := main(); {408#true} is VALID [2018-11-18 21:05:02,046 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #63#return; {408#true} is VALID [2018-11-18 21:05:02,046 INFO L273 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-18 21:05:02,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {408#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {408#true} is VALID [2018-11-18 21:05:02,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {408#true} is VALID [2018-11-18 21:05:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:05:02,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:05:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 21:05:02,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 21:05:02,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:05:02,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 21:05:02,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:02,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 21:05:02,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 21:05:02,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 21:05:02,116 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-18 21:05:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:02,590 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-18 21:05:02,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 21:05:02,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 21:05:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:05:02,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 21:05:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-18 21:05:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 21:05:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-18 21:05:02,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-18 21:05:02,691 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:02,693 INFO L225 Difference]: With dead ends: 47 [2018-11-18 21:05:02,693 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 21:05:02,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 21:05:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 21:05:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-18 21:05:02,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:05:02,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-18 21:05:02,711 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-18 21:05:02,711 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-18 21:05:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:02,715 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-18 21:05:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 21:05:02,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:02,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:02,717 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-18 21:05:02,717 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-18 21:05:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:02,720 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-18 21:05:02,720 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 21:05:02,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:02,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:02,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:05:02,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:05:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-18 21:05:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-18 21:05:02,723 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 20 [2018-11-18 21:05:02,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:05:02,724 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-18 21:05:02,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 21:05:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-18 21:05:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 21:05:02,725 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:05:02,725 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:05:02,725 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:05:02,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:05:02,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1429379969, now seen corresponding path program 2 times [2018-11-18 21:05:02,726 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:05:02,726 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-18 21:05:02,744 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 21:05:02,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 21:05:02,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:05:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:02,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:05:02,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-18 21:05:02,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 21:05:02,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:05:02,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:02,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:02,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-18 21:05:03,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-18 21:05:03,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 21:05:03,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 21:05:03,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:05:03,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:03,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:03,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-18 21:05:03,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-18 21:05:03,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-18 21:05:03,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:05:03,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:03,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:03,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-18 21:05:03,421 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:05:03,626 INFO L256 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {696#true} is VALID [2018-11-18 21:05:03,626 INFO L273 TraceCheckUtils]: 1: Hoare triple {696#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {696#true} is VALID [2018-11-18 21:05:03,627 INFO L273 TraceCheckUtils]: 2: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-18 21:05:03,627 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} #63#return; {696#true} is VALID [2018-11-18 21:05:03,627 INFO L256 TraceCheckUtils]: 4: Hoare triple {696#true} call #t~ret5 := main(); {696#true} is VALID [2018-11-18 21:05:03,627 INFO L273 TraceCheckUtils]: 5: Hoare triple {696#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {696#true} is VALID [2018-11-18 21:05:03,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:03,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:03,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:03,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {729#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:03,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {729#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= main_~i~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:03,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:03,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:03,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-18 21:05:03,642 INFO L273 TraceCheckUtils]: 14: Hoare triple {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-18 21:05:03,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume true; {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-18 21:05:03,647 INFO L273 TraceCheckUtils]: 16: Hoare triple {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-18 21:05:03,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {756#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:03,650 INFO L273 TraceCheckUtils]: 18: Hoare triple {756#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {756#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:03,652 INFO L273 TraceCheckUtils]: 19: Hoare triple {756#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {763#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-18 21:05:03,653 INFO L256 TraceCheckUtils]: 20: Hoare triple {763#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {767#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:03,654 INFO L273 TraceCheckUtils]: 21: Hoare triple {767#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {771#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:03,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {771#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {697#false} is VALID [2018-11-18 21:05:03,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {697#false} assume !false; {697#false} is VALID [2018-11-18 21:05:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:05:03,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:05:03,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-18 21:05:03,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-18 21:05:04,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-18 21:05:04,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 21:05:04,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:04,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:04,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:04,058 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-11-18 21:05:04,063 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:05:04,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {697#false} assume !false; {697#false} is VALID [2018-11-18 21:05:04,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {781#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {697#false} is VALID [2018-11-18 21:05:04,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {785#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {781#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 21:05:04,126 INFO L256 TraceCheckUtils]: 20: Hoare triple {763#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {785#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 21:05:04,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {792#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {763#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-18 21:05:04,128 INFO L273 TraceCheckUtils]: 18: Hoare triple {792#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume true; {792#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-18 21:05:04,129 INFO L273 TraceCheckUtils]: 17: Hoare triple {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} ~i~0 := 0bv32; {792#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-18 21:05:04,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-18 21:05:04,131 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume true; {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-18 21:05:04,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-18 21:05:04,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-18 21:05:04,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} assume !!~bvslt32(~i~0, ~SIZE~0); {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} is VALID [2018-11-18 21:05:04,144 INFO L273 TraceCheckUtils]: 11: Hoare triple {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} assume true; {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} is VALID [2018-11-18 21:05:04,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {822#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) |main_~#a~0.offset|))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} is VALID [2018-11-18 21:05:04,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {822#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) |main_~#a~0.offset|))} is VALID [2018-11-18 21:05:04,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:04,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} assume true; {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:04,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:04,152 INFO L273 TraceCheckUtils]: 5: Hoare triple {696#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {696#true} is VALID [2018-11-18 21:05:04,152 INFO L256 TraceCheckUtils]: 4: Hoare triple {696#true} call #t~ret5 := main(); {696#true} is VALID [2018-11-18 21:05:04,152 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} #63#return; {696#true} is VALID [2018-11-18 21:05:04,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-18 21:05:04,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {696#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {696#true} is VALID [2018-11-18 21:05:04,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {696#true} is VALID [2018-11-18 21:05:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:05:04,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:05:04,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-18 21:05:04,160 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-18 21:05:04,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:05:04,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 21:05:04,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:04,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 21:05:04,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 21:05:04,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-11-18 21:05:04,302 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 17 states. [2018-11-18 21:05:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:06,092 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-18 21:05:06,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 21:05:06,092 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-18 21:05:06,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:05:06,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 21:05:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-18 21:05:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 21:05:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-18 21:05:06,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 71 transitions. [2018-11-18 21:05:06,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:06,347 INFO L225 Difference]: With dead ends: 64 [2018-11-18 21:05:06,347 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 21:05:06,348 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-11-18 21:05:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 21:05:06,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2018-11-18 21:05:06,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:05:06,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 47 states. [2018-11-18 21:05:06,413 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 47 states. [2018-11-18 21:05:06,413 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 47 states. [2018-11-18 21:05:06,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:06,419 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-18 21:05:06,419 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-18 21:05:06,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:06,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:06,420 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 62 states. [2018-11-18 21:05:06,421 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 62 states. [2018-11-18 21:05:06,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:06,425 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-18 21:05:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-18 21:05:06,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:06,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:06,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:05:06,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:05:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 21:05:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-18 21:05:06,430 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 24 [2018-11-18 21:05:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:05:06,431 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-18 21:05:06,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 21:05:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-18 21:05:06,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 21:05:06,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:05:06,432 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:05:06,433 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:05:06,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:05:06,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1379438888, now seen corresponding path program 1 times [2018-11-18 21:05:06,434 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:05:06,434 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-18 21:05:06,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 21:05:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:06,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:05:06,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {1139#true} call ULTIMATE.init(); {1139#true} is VALID [2018-11-18 21:05:06,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {1139#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1139#true} is VALID [2018-11-18 21:05:06,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {1139#true} assume true; {1139#true} is VALID [2018-11-18 21:05:06,591 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1139#true} {1139#true} #63#return; {1139#true} is VALID [2018-11-18 21:05:06,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {1139#true} call #t~ret5 := main(); {1139#true} is VALID [2018-11-18 21:05:06,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {1139#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1139#true} is VALID [2018-11-18 21:05:06,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {1139#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1162#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:06,609 INFO L273 TraceCheckUtils]: 7: Hoare triple {1162#(= main_~i~0 (_ bv0 32))} assume true; {1162#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:06,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {1162#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {1162#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:06,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {1162#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1162#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:06,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {1162#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:06,614 INFO L273 TraceCheckUtils]: 11: Hoare triple {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:06,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:06,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:06,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1188#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:06,618 INFO L273 TraceCheckUtils]: 15: Hoare triple {1188#(= (_ bv2 32) main_~i~0)} assume true; {1188#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:06,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {1188#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {1188#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:06,620 INFO L273 TraceCheckUtils]: 17: Hoare triple {1188#(= (_ bv2 32) main_~i~0)} assume ~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1140#false} is VALID [2018-11-18 21:05:06,620 INFO L273 TraceCheckUtils]: 18: Hoare triple {1140#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1140#false} is VALID [2018-11-18 21:05:06,621 INFO L273 TraceCheckUtils]: 19: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 21:05:06,621 INFO L273 TraceCheckUtils]: 20: Hoare triple {1140#false} assume !~bvslt32(~i~0, ~SIZE~0); {1140#false} is VALID [2018-11-18 21:05:06,621 INFO L273 TraceCheckUtils]: 21: Hoare triple {1140#false} ~i~0 := 0bv32; {1140#false} is VALID [2018-11-18 21:05:06,621 INFO L273 TraceCheckUtils]: 22: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 21:05:06,622 INFO L273 TraceCheckUtils]: 23: Hoare triple {1140#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1140#false} is VALID [2018-11-18 21:05:06,622 INFO L256 TraceCheckUtils]: 24: Hoare triple {1140#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {1140#false} is VALID [2018-11-18 21:05:06,622 INFO L273 TraceCheckUtils]: 25: Hoare triple {1140#false} ~cond := #in~cond; {1140#false} is VALID [2018-11-18 21:05:06,623 INFO L273 TraceCheckUtils]: 26: Hoare triple {1140#false} assume 0bv32 == ~cond; {1140#false} is VALID [2018-11-18 21:05:06,623 INFO L273 TraceCheckUtils]: 27: Hoare triple {1140#false} assume !false; {1140#false} is VALID [2018-11-18 21:05:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:05:06,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:05:06,721 INFO L273 TraceCheckUtils]: 27: Hoare triple {1140#false} assume !false; {1140#false} is VALID [2018-11-18 21:05:06,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {1140#false} assume 0bv32 == ~cond; {1140#false} is VALID [2018-11-18 21:05:06,722 INFO L273 TraceCheckUtils]: 25: Hoare triple {1140#false} ~cond := #in~cond; {1140#false} is VALID [2018-11-18 21:05:06,723 INFO L256 TraceCheckUtils]: 24: Hoare triple {1140#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {1140#false} is VALID [2018-11-18 21:05:06,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {1140#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1140#false} is VALID [2018-11-18 21:05:06,723 INFO L273 TraceCheckUtils]: 22: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 21:05:06,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {1140#false} ~i~0 := 0bv32; {1140#false} is VALID [2018-11-18 21:05:06,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {1140#false} assume !~bvslt32(~i~0, ~SIZE~0); {1140#false} is VALID [2018-11-18 21:05:06,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-18 21:05:06,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {1140#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1140#false} is VALID [2018-11-18 21:05:06,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume ~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1140#false} is VALID [2018-11-18 21:05:06,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume true; {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,728 INFO L273 TraceCheckUtils]: 13: Hoare triple {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,729 INFO L273 TraceCheckUtils]: 11: Hoare triple {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,734 INFO L273 TraceCheckUtils]: 10: Hoare triple {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,735 INFO L273 TraceCheckUtils]: 9: Hoare triple {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {1139#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:06,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {1139#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1139#true} is VALID [2018-11-18 21:05:06,737 INFO L256 TraceCheckUtils]: 4: Hoare triple {1139#true} call #t~ret5 := main(); {1139#true} is VALID [2018-11-18 21:05:06,738 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1139#true} {1139#true} #63#return; {1139#true} is VALID [2018-11-18 21:05:06,738 INFO L273 TraceCheckUtils]: 2: Hoare triple {1139#true} assume true; {1139#true} is VALID [2018-11-18 21:05:06,738 INFO L273 TraceCheckUtils]: 1: Hoare triple {1139#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1139#true} is VALID [2018-11-18 21:05:06,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {1139#true} call ULTIMATE.init(); {1139#true} is VALID [2018-11-18 21:05:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:05:06,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:05:06,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 21:05:06,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-18 21:05:06,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:05:06,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 21:05:06,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:06,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 21:05:06,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 21:05:06,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 21:05:06,847 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 8 states. [2018-11-18 21:05:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:08,108 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-11-18 21:05:08,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 21:05:08,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-18 21:05:08,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:05:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 21:05:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-11-18 21:05:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 21:05:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-11-18 21:05:08,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 115 transitions. [2018-11-18 21:05:08,440 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:08,444 INFO L225 Difference]: With dead ends: 114 [2018-11-18 21:05:08,444 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 21:05:08,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-18 21:05:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 21:05:08,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2018-11-18 21:05:08,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:05:08,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 63 states. [2018-11-18 21:05:08,692 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 63 states. [2018-11-18 21:05:08,693 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 63 states. [2018-11-18 21:05:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:08,698 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2018-11-18 21:05:08,699 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2018-11-18 21:05:08,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:08,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:08,700 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 98 states. [2018-11-18 21:05:08,701 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 98 states. [2018-11-18 21:05:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:08,706 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2018-11-18 21:05:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2018-11-18 21:05:08,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:08,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:08,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:05:08,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:05:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 21:05:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-11-18 21:05:08,712 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 28 [2018-11-18 21:05:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:05:08,712 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-11-18 21:05:08,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 21:05:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-18 21:05:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 21:05:08,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:05:08,714 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:05:08,715 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:05:08,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:05:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash 526094817, now seen corresponding path program 1 times [2018-11-18 21:05:08,715 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:05:08,716 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-18 21:05:08,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:05:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:08,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:05:09,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {1747#true} call ULTIMATE.init(); {1747#true} is VALID [2018-11-18 21:05:09,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {1747#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1747#true} is VALID [2018-11-18 21:05:09,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {1747#true} assume true; {1747#true} is VALID [2018-11-18 21:05:09,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1747#true} {1747#true} #63#return; {1747#true} is VALID [2018-11-18 21:05:09,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {1747#true} call #t~ret5 := main(); {1747#true} is VALID [2018-11-18 21:05:09,139 INFO L273 TraceCheckUtils]: 5: Hoare triple {1747#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1747#true} is VALID [2018-11-18 21:05:09,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {1747#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,171 INFO L273 TraceCheckUtils]: 8: Hoare triple {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,184 INFO L273 TraceCheckUtils]: 10: Hoare triple {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:09,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:09,186 INFO L273 TraceCheckUtils]: 12: Hoare triple {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:09,187 INFO L273 TraceCheckUtils]: 13: Hoare triple {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:09,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1796#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:05:09,189 INFO L273 TraceCheckUtils]: 15: Hoare triple {1796#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {1796#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:05:09,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {1796#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~SIZE~0); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~i~0 := 0bv32; {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,191 INFO L273 TraceCheckUtils]: 18: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,195 INFO L256 TraceCheckUtils]: 20: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,195 INFO L273 TraceCheckUtils]: 21: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,196 INFO L273 TraceCheckUtils]: 22: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(0bv32 == ~cond); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,196 INFO L273 TraceCheckUtils]: 23: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,197 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #67#return; {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,197 INFO L273 TraceCheckUtils]: 25: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} havoc #t~mem4; {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,198 INFO L273 TraceCheckUtils]: 26: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:09,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:09,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:09,208 INFO L256 TraceCheckUtils]: 29: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,209 INFO L273 TraceCheckUtils]: 30: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,209 INFO L273 TraceCheckUtils]: 31: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(0bv32 == ~cond); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,210 INFO L273 TraceCheckUtils]: 32: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:05:09,210 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:09,211 INFO L273 TraceCheckUtils]: 34: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:09,211 INFO L273 TraceCheckUtils]: 35: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1863#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:05:09,212 INFO L273 TraceCheckUtils]: 36: Hoare triple {1863#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {1863#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:05:09,219 INFO L273 TraceCheckUtils]: 37: Hoare triple {1863#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1748#false} is VALID [2018-11-18 21:05:09,219 INFO L256 TraceCheckUtils]: 38: Hoare triple {1748#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {1748#false} is VALID [2018-11-18 21:05:09,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {1748#false} ~cond := #in~cond; {1748#false} is VALID [2018-11-18 21:05:09,220 INFO L273 TraceCheckUtils]: 40: Hoare triple {1748#false} assume 0bv32 == ~cond; {1748#false} is VALID [2018-11-18 21:05:09,220 INFO L273 TraceCheckUtils]: 41: Hoare triple {1748#false} assume !false; {1748#false} is VALID [2018-11-18 21:05:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 21:05:09,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:05:09,526 INFO L273 TraceCheckUtils]: 41: Hoare triple {1748#false} assume !false; {1748#false} is VALID [2018-11-18 21:05:09,526 INFO L273 TraceCheckUtils]: 40: Hoare triple {1748#false} assume 0bv32 == ~cond; {1748#false} is VALID [2018-11-18 21:05:09,526 INFO L273 TraceCheckUtils]: 39: Hoare triple {1748#false} ~cond := #in~cond; {1748#false} is VALID [2018-11-18 21:05:09,527 INFO L256 TraceCheckUtils]: 38: Hoare triple {1748#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {1748#false} is VALID [2018-11-18 21:05:09,527 INFO L273 TraceCheckUtils]: 37: Hoare triple {1894#(not (bvslt main_~i~0 ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1748#false} is VALID [2018-11-18 21:05:09,528 INFO L273 TraceCheckUtils]: 36: Hoare triple {1894#(not (bvslt main_~i~0 ~SIZE~0))} assume true; {1894#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:05:09,529 INFO L273 TraceCheckUtils]: 35: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1894#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:05:09,530 INFO L273 TraceCheckUtils]: 34: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} havoc #t~mem4; {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,530 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1747#true} {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #67#return; {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,531 INFO L273 TraceCheckUtils]: 32: Hoare triple {1747#true} assume true; {1747#true} is VALID [2018-11-18 21:05:09,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {1747#true} assume !(0bv32 == ~cond); {1747#true} is VALID [2018-11-18 21:05:09,531 INFO L273 TraceCheckUtils]: 30: Hoare triple {1747#true} ~cond := #in~cond; {1747#true} is VALID [2018-11-18 21:05:09,531 INFO L256 TraceCheckUtils]: 29: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {1747#true} is VALID [2018-11-18 21:05:09,532 INFO L273 TraceCheckUtils]: 28: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,558 INFO L273 TraceCheckUtils]: 26: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} havoc #t~mem4; {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,559 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1747#true} {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #67#return; {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,559 INFO L273 TraceCheckUtils]: 23: Hoare triple {1747#true} assume true; {1747#true} is VALID [2018-11-18 21:05:09,559 INFO L273 TraceCheckUtils]: 22: Hoare triple {1747#true} assume !(0bv32 == ~cond); {1747#true} is VALID [2018-11-18 21:05:09,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {1747#true} ~cond := #in~cond; {1747#true} is VALID [2018-11-18 21:05:09,560 INFO L256 TraceCheckUtils]: 20: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {1747#true} is VALID [2018-11-18 21:05:09,560 INFO L273 TraceCheckUtils]: 19: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume true; {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {1957#(not (bvslt (_ bv2 32) ~SIZE~0))} ~i~0 := 0bv32; {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {1961#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume !~bvslt32(~i~0, ~SIZE~0); {1957#(not (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-18 21:05:09,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {1961#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume true; {1961#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:05:09,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1961#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:05:09,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:05:09,594 INFO L273 TraceCheckUtils]: 9: Hoare triple {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-18 21:05:09,594 INFO L273 TraceCheckUtils]: 8: Hoare triple {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-18 21:05:09,595 INFO L273 TraceCheckUtils]: 7: Hoare triple {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume true; {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-18 21:05:09,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {1747#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-18 21:05:09,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {1747#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1747#true} is VALID [2018-11-18 21:05:09,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {1747#true} call #t~ret5 := main(); {1747#true} is VALID [2018-11-18 21:05:09,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1747#true} {1747#true} #63#return; {1747#true} is VALID [2018-11-18 21:05:09,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {1747#true} assume true; {1747#true} is VALID [2018-11-18 21:05:09,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {1747#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1747#true} is VALID [2018-11-18 21:05:09,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {1747#true} call ULTIMATE.init(); {1747#true} is VALID [2018-11-18 21:05:09,601 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 21:05:09,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:05:09,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-18 21:05:09,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-18 21:05:09,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:05:09,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 21:05:09,787 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:09,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 21:05:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 21:05:09,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-11-18 21:05:09,788 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 16 states. [2018-11-18 21:05:11,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:11,427 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-11-18 21:05:11,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 21:05:11,427 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-18 21:05:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:05:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 21:05:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-18 21:05:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 21:05:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-18 21:05:11,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 81 transitions. [2018-11-18 21:05:11,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:11,607 INFO L225 Difference]: With dead ends: 103 [2018-11-18 21:05:11,607 INFO L226 Difference]: Without dead ends: 75 [2018-11-18 21:05:11,608 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-11-18 21:05:11,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-18 21:05:11,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-11-18 21:05:11,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:05:11,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 63 states. [2018-11-18 21:05:11,680 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 63 states. [2018-11-18 21:05:11,681 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 63 states. [2018-11-18 21:05:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:11,685 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-18 21:05:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-18 21:05:11,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:11,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:11,686 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 75 states. [2018-11-18 21:05:11,686 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 75 states. [2018-11-18 21:05:11,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:11,690 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-18 21:05:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-18 21:05:11,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:11,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:11,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:05:11,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:05:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-18 21:05:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-11-18 21:05:11,694 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 42 [2018-11-18 21:05:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:05:11,694 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-11-18 21:05:11,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 21:05:11,694 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-18 21:05:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 21:05:11,695 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:05:11,695 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:05:11,696 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:05:11,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:05:11,696 INFO L82 PathProgramCache]: Analyzing trace with hash 665453884, now seen corresponding path program 2 times [2018-11-18 21:05:11,696 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:05:11,696 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-18 21:05:11,717 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 21:05:11,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 21:05:11,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:05:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:11,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:05:11,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2388#true} is VALID [2018-11-18 21:05:11,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {2388#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2388#true} is VALID [2018-11-18 21:05:11,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-18 21:05:11,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #63#return; {2388#true} is VALID [2018-11-18 21:05:11,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret5 := main(); {2388#true} is VALID [2018-11-18 21:05:11,910 INFO L273 TraceCheckUtils]: 5: Hoare triple {2388#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2388#true} is VALID [2018-11-18 21:05:11,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {2388#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {2411#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:11,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {2411#(= main_~i~0 (_ bv0 32))} assume true; {2411#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:11,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {2411#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {2411#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:11,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {2411#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2411#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:11,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {2411#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2437#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:11,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {2437#(= (_ bv2 32) main_~i~0)} assume true; {2437#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:11,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {2437#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {2437#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:11,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {2437#(= (_ bv2 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2437#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:11,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {2437#(= (_ bv2 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,922 INFO L273 TraceCheckUtils]: 20: Hoare triple {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2463#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:05:11,924 INFO L273 TraceCheckUtils]: 23: Hoare triple {2463#(= (_ bv4 32) main_~i~0)} assume true; {2463#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:05:11,926 INFO L273 TraceCheckUtils]: 24: Hoare triple {2463#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {2463#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:05:11,926 INFO L273 TraceCheckUtils]: 25: Hoare triple {2463#(= (_ bv4 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2463#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:05:11,927 INFO L273 TraceCheckUtils]: 26: Hoare triple {2463#(= (_ bv4 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,927 INFO L273 TraceCheckUtils]: 27: Hoare triple {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,928 INFO L273 TraceCheckUtils]: 28: Hoare triple {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,928 INFO L273 TraceCheckUtils]: 29: Hoare triple {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:11,929 INFO L273 TraceCheckUtils]: 30: Hoare triple {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2489#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 21:05:11,929 INFO L273 TraceCheckUtils]: 31: Hoare triple {2489#(= (_ bv6 32) main_~i~0)} assume true; {2489#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 21:05:11,929 INFO L273 TraceCheckUtils]: 32: Hoare triple {2489#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {2489#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 21:05:11,939 INFO L273 TraceCheckUtils]: 33: Hoare triple {2489#(= (_ bv6 32) main_~i~0)} assume ~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2389#false} is VALID [2018-11-18 21:05:11,940 INFO L273 TraceCheckUtils]: 34: Hoare triple {2389#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2389#false} is VALID [2018-11-18 21:05:11,940 INFO L273 TraceCheckUtils]: 35: Hoare triple {2389#false} assume true; {2389#false} is VALID [2018-11-18 21:05:11,940 INFO L273 TraceCheckUtils]: 36: Hoare triple {2389#false} assume !~bvslt32(~i~0, ~SIZE~0); {2389#false} is VALID [2018-11-18 21:05:11,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {2389#false} ~i~0 := 0bv32; {2389#false} is VALID [2018-11-18 21:05:11,940 INFO L273 TraceCheckUtils]: 38: Hoare triple {2389#false} assume true; {2389#false} is VALID [2018-11-18 21:05:11,940 INFO L273 TraceCheckUtils]: 39: Hoare triple {2389#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2389#false} is VALID [2018-11-18 21:05:11,941 INFO L256 TraceCheckUtils]: 40: Hoare triple {2389#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {2389#false} is VALID [2018-11-18 21:05:11,941 INFO L273 TraceCheckUtils]: 41: Hoare triple {2389#false} ~cond := #in~cond; {2389#false} is VALID [2018-11-18 21:05:11,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {2389#false} assume 0bv32 == ~cond; {2389#false} is VALID [2018-11-18 21:05:11,941 INFO L273 TraceCheckUtils]: 43: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2018-11-18 21:05:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:05:11,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:05:12,262 INFO L273 TraceCheckUtils]: 43: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2018-11-18 21:05:12,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {2389#false} assume 0bv32 == ~cond; {2389#false} is VALID [2018-11-18 21:05:12,263 INFO L273 TraceCheckUtils]: 41: Hoare triple {2389#false} ~cond := #in~cond; {2389#false} is VALID [2018-11-18 21:05:12,263 INFO L256 TraceCheckUtils]: 40: Hoare triple {2389#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {2389#false} is VALID [2018-11-18 21:05:12,264 INFO L273 TraceCheckUtils]: 39: Hoare triple {2389#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2389#false} is VALID [2018-11-18 21:05:12,264 INFO L273 TraceCheckUtils]: 38: Hoare triple {2389#false} assume true; {2389#false} is VALID [2018-11-18 21:05:12,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {2389#false} ~i~0 := 0bv32; {2389#false} is VALID [2018-11-18 21:05:12,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {2389#false} assume !~bvslt32(~i~0, ~SIZE~0); {2389#false} is VALID [2018-11-18 21:05:12,265 INFO L273 TraceCheckUtils]: 35: Hoare triple {2389#false} assume true; {2389#false} is VALID [2018-11-18 21:05:12,266 INFO L273 TraceCheckUtils]: 34: Hoare triple {2389#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2389#false} is VALID [2018-11-18 21:05:12,271 INFO L273 TraceCheckUtils]: 33: Hoare triple {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume ~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2389#false} is VALID [2018-11-18 21:05:12,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume true; {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,273 INFO L273 TraceCheckUtils]: 29: Hoare triple {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,273 INFO L273 TraceCheckUtils]: 28: Hoare triple {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,279 INFO L273 TraceCheckUtils]: 25: Hoare triple {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,280 INFO L273 TraceCheckUtils]: 23: Hoare triple {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,285 INFO L273 TraceCheckUtils]: 20: Hoare triple {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,285 INFO L273 TraceCheckUtils]: 19: Hoare triple {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,290 INFO L273 TraceCheckUtils]: 18: Hoare triple {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,290 INFO L273 TraceCheckUtils]: 17: Hoare triple {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,291 INFO L273 TraceCheckUtils]: 16: Hoare triple {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,291 INFO L273 TraceCheckUtils]: 15: Hoare triple {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,298 INFO L273 TraceCheckUtils]: 12: Hoare triple {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,317 INFO L273 TraceCheckUtils]: 9: Hoare triple {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {2388#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-18 21:05:12,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {2388#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2388#true} is VALID [2018-11-18 21:05:12,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret5 := main(); {2388#true} is VALID [2018-11-18 21:05:12,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #63#return; {2388#true} is VALID [2018-11-18 21:05:12,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-18 21:05:12,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {2388#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2388#true} is VALID [2018-11-18 21:05:12,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2388#true} is VALID [2018-11-18 21:05:12,322 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:05:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:05:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-18 21:05:12,324 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-18 21:05:12,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:05:12,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 21:05:12,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:12,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 21:05:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 21:05:12,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-18 21:05:12,454 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 16 states. [2018-11-18 21:05:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:16,166 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2018-11-18 21:05:16,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 21:05:16,166 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-18 21:05:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:05:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 21:05:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 213 transitions. [2018-11-18 21:05:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 21:05:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 213 transitions. [2018-11-18 21:05:16,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 213 transitions. [2018-11-18 21:05:16,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:16,561 INFO L225 Difference]: With dead ends: 193 [2018-11-18 21:05:16,561 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 21:05:16,562 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2018-11-18 21:05:16,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 21:05:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2018-11-18 21:05:16,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:05:16,761 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 95 states. [2018-11-18 21:05:16,761 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 95 states. [2018-11-18 21:05:16,761 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 95 states. [2018-11-18 21:05:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:16,769 INFO L93 Difference]: Finished difference Result 177 states and 207 transitions. [2018-11-18 21:05:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 207 transitions. [2018-11-18 21:05:16,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:16,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:16,771 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 177 states. [2018-11-18 21:05:16,771 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 177 states. [2018-11-18 21:05:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:05:16,779 INFO L93 Difference]: Finished difference Result 177 states and 207 transitions. [2018-11-18 21:05:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 207 transitions. [2018-11-18 21:05:16,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:05:16,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:05:16,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:05:16,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:05:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 21:05:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-11-18 21:05:16,784 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 44 [2018-11-18 21:05:16,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:05:16,784 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-11-18 21:05:16,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 21:05:16,784 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-11-18 21:05:16,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 21:05:16,786 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:05:16,786 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:05:16,786 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:05:16,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:05:16,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1593268614, now seen corresponding path program 2 times [2018-11-18 21:05:16,787 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:05:16,787 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-18 21:05:16,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 21:05:16,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 21:05:16,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:05:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:05:16,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:05:16,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 21:05:16,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 21:05:16,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:05:16,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:16,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:16,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-18 21:05:17,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 21:05:17,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 21:05:17,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:05:17,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:17,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:17,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-18 21:05:17,267 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:05:17,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {3409#true} call ULTIMATE.init(); {3409#true} is VALID [2018-11-18 21:05:17,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {3409#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3409#true} is VALID [2018-11-18 21:05:17,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-18 21:05:17,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3409#true} {3409#true} #63#return; {3409#true} is VALID [2018-11-18 21:05:17,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {3409#true} call #t~ret5 := main(); {3409#true} is VALID [2018-11-18 21:05:17,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {3409#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3409#true} is VALID [2018-11-18 21:05:17,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {3409#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {3432#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:17,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {3432#(= main_~i~0 (_ bv0 32))} assume true; {3432#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:17,326 INFO L273 TraceCheckUtils]: 8: Hoare triple {3432#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {3432#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:17,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {3432#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3432#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:05:17,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {3432#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:17,327 INFO L273 TraceCheckUtils]: 11: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:17,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:17,328 INFO L273 TraceCheckUtils]: 13: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:17,329 INFO L273 TraceCheckUtils]: 14: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3458#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:17,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {3458#(= (_ bv2 32) main_~i~0)} assume true; {3458#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:17,330 INFO L273 TraceCheckUtils]: 16: Hoare triple {3458#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {3458#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:05:17,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {3458#(= (_ bv2 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-18 21:05:17,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-18 21:05:17,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} assume true; {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-18 21:05:17,333 INFO L273 TraceCheckUtils]: 20: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} assume !~bvslt32(~i~0, ~SIZE~0); {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-18 21:05:17,334 INFO L273 TraceCheckUtils]: 21: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} ~i~0 := 0bv32; {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:17,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} assume true; {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:17,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:17,345 INFO L256 TraceCheckUtils]: 24: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-18 21:05:17,346 INFO L273 TraceCheckUtils]: 25: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} ~cond := #in~cond; {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-18 21:05:17,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} assume !(0bv32 == ~cond); {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-18 21:05:17,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} assume true; {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-18 21:05:17,347 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} #67#return; {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:17,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} havoc #t~mem4; {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:05:17,348 INFO L273 TraceCheckUtils]: 30: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:17,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:17,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:17,352 INFO L256 TraceCheckUtils]: 33: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-18 21:05:17,355 INFO L273 TraceCheckUtils]: 34: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} ~cond := #in~cond; {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-18 21:05:17,357 INFO L273 TraceCheckUtils]: 35: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} assume !(0bv32 == ~cond); {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-18 21:05:17,360 INFO L273 TraceCheckUtils]: 36: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} assume true; {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-18 21:05:17,363 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:17,364 INFO L273 TraceCheckUtils]: 38: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:05:17,369 INFO L273 TraceCheckUtils]: 39: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3538#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:05:17,369 INFO L273 TraceCheckUtils]: 40: Hoare triple {3538#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv2 32) main_~i~0))} assume true; {3538#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:05:17,370 INFO L273 TraceCheckUtils]: 41: Hoare triple {3538#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3545#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-18 21:05:17,371 INFO L256 TraceCheckUtils]: 42: Hoare triple {3545#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {3549#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:17,372 INFO L273 TraceCheckUtils]: 43: Hoare triple {3549#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3553#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:05:17,372 INFO L273 TraceCheckUtils]: 44: Hoare triple {3553#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3410#false} is VALID [2018-11-18 21:05:17,372 INFO L273 TraceCheckUtils]: 45: Hoare triple {3410#false} assume !false; {3410#false} is VALID [2018-11-18 21:05:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 21:05:17,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:05:23,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-18 21:05:23,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-18 21:05:23,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:05:23,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:23,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:05:23,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:5 [2018-11-18 21:05:23,887 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:05:24,117 INFO L273 TraceCheckUtils]: 45: Hoare triple {3410#false} assume !false; {3410#false} is VALID [2018-11-18 21:05:24,118 INFO L273 TraceCheckUtils]: 44: Hoare triple {3563#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {3410#false} is VALID [2018-11-18 21:05:24,118 INFO L273 TraceCheckUtils]: 43: Hoare triple {3567#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3563#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 21:05:24,119 INFO L256 TraceCheckUtils]: 42: Hoare triple {3545#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {3567#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 21:05:24,120 INFO L273 TraceCheckUtils]: 41: Hoare triple {3574#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3545#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-18 21:05:24,120 INFO L273 TraceCheckUtils]: 40: Hoare triple {3574#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume true; {3574#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-18 21:05:24,296 INFO L273 TraceCheckUtils]: 39: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3574#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-18 21:05:24,297 INFO L273 TraceCheckUtils]: 38: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} havoc #t~mem4; {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:05:24,298 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3409#true} {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #67#return; {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:05:24,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-18 21:05:24,298 INFO L273 TraceCheckUtils]: 35: Hoare triple {3409#true} assume !(0bv32 == ~cond); {3409#true} is VALID [2018-11-18 21:05:24,298 INFO L273 TraceCheckUtils]: 34: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-18 21:05:24,298 INFO L256 TraceCheckUtils]: 33: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {3409#true} is VALID [2018-11-18 21:05:24,299 INFO L273 TraceCheckUtils]: 32: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:05:24,299 INFO L273 TraceCheckUtils]: 31: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume true; {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:05:24,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:05:24,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} havoc #t~mem4; {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:05:24,557 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {3409#true} {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #67#return; {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:05:24,557 INFO L273 TraceCheckUtils]: 27: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-18 21:05:24,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {3409#true} assume !(0bv32 == ~cond); {3409#true} is VALID [2018-11-18 21:05:24,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-18 21:05:24,558 INFO L256 TraceCheckUtils]: 24: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {3409#true} is VALID [2018-11-18 21:05:24,558 INFO L273 TraceCheckUtils]: 23: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:05:24,558 INFO L273 TraceCheckUtils]: 22: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume true; {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:05:24,559 INFO L273 TraceCheckUtils]: 21: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} ~i~0 := 0bv32; {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:05:24,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} assume !~bvslt32(~i~0, ~SIZE~0); {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-18 21:05:24,560 INFO L273 TraceCheckUtils]: 19: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} assume true; {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-18 21:05:24,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-18 21:05:24,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-18 21:05:24,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,565 INFO L273 TraceCheckUtils]: 14: Hoare triple {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,566 INFO L273 TraceCheckUtils]: 13: Hoare triple {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,567 INFO L273 TraceCheckUtils]: 12: Hoare triple {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,581 INFO L273 TraceCheckUtils]: 8: Hoare triple {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,581 INFO L273 TraceCheckUtils]: 7: Hoare triple {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,582 INFO L273 TraceCheckUtils]: 6: Hoare triple {3409#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:05:24,582 INFO L273 TraceCheckUtils]: 5: Hoare triple {3409#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3409#true} is VALID [2018-11-18 21:05:24,582 INFO L256 TraceCheckUtils]: 4: Hoare triple {3409#true} call #t~ret5 := main(); {3409#true} is VALID [2018-11-18 21:05:24,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3409#true} {3409#true} #63#return; {3409#true} is VALID [2018-11-18 21:05:24,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-18 21:05:24,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {3409#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3409#true} is VALID [2018-11-18 21:05:24,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {3409#true} call ULTIMATE.init(); {3409#true} is VALID [2018-11-18 21:05:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-18 21:05:24,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:05:24,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-11-18 21:05:24,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-18 21:05:24,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:05:24,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 21:05:25,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:05:25,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 21:05:25,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 21:05:25,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=357, Unknown=3, NotChecked=0, Total=420 [2018-11-18 21:05:25,564 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 21 states. [2018-11-18 21:06:00,755 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-18 21:06:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:06:02,517 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2018-11-18 21:06:02,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 21:06:02,517 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-18 21:06:02,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:06:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 21:06:02,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2018-11-18 21:06:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 21:06:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2018-11-18 21:06:02,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 97 transitions. [2018-11-18 21:06:02,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:06:02,716 INFO L225 Difference]: With dead ends: 135 [2018-11-18 21:06:02,716 INFO L226 Difference]: Without dead ends: 133 [2018-11-18 21:06:02,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=104, Invalid=647, Unknown=5, NotChecked=0, Total=756 [2018-11-18 21:06:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-18 21:06:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2018-11-18 21:06:02,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:06:02,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 104 states. [2018-11-18 21:06:02,947 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 104 states. [2018-11-18 21:06:02,947 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 104 states. [2018-11-18 21:06:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:06:02,954 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-11-18 21:06:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-11-18 21:06:02,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:06:02,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:06:02,955 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 133 states. [2018-11-18 21:06:02,955 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 133 states. [2018-11-18 21:06:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:06:02,960 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-11-18 21:06:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-11-18 21:06:02,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:06:02,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:06:02,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:06:02,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:06:02,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 21:06:02,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-11-18 21:06:02,965 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 46 [2018-11-18 21:06:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:06:02,965 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-11-18 21:06:02,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 21:06:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-11-18 21:06:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 21:06:02,966 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:06:02,967 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:06:02,967 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:06:02,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:06:02,967 INFO L82 PathProgramCache]: Analyzing trace with hash 319969027, now seen corresponding path program 3 times [2018-11-18 21:06:02,967 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:06:02,968 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:06:02,988 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 21:06:03,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 21:06:03,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:06:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:06:03,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:06:03,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {4295#true} call ULTIMATE.init(); {4295#true} is VALID [2018-11-18 21:06:03,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {4295#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {4295#true} is VALID [2018-11-18 21:06:03,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-18 21:06:03,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4295#true} {4295#true} #63#return; {4295#true} is VALID [2018-11-18 21:06:03,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {4295#true} call #t~ret5 := main(); {4295#true} is VALID [2018-11-18 21:06:03,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {4295#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4295#true} is VALID [2018-11-18 21:06:03,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {4295#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,513 INFO L273 TraceCheckUtils]: 7: Hoare triple {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:03,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:03,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:03,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:03,523 INFO L273 TraceCheckUtils]: 14: Hoare triple {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:03,524 INFO L273 TraceCheckUtils]: 15: Hoare triple {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:03,524 INFO L273 TraceCheckUtils]: 16: Hoare triple {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:03,525 INFO L273 TraceCheckUtils]: 17: Hoare triple {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:03,527 INFO L273 TraceCheckUtils]: 18: Hoare triple {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4357#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,527 INFO L273 TraceCheckUtils]: 19: Hoare triple {4357#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4357#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {4357#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~i~0 := 0bv32; {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,532 INFO L273 TraceCheckUtils]: 22: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,533 INFO L256 TraceCheckUtils]: 24: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(0bv32 == ~cond); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,536 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #67#return; {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} havoc #t~mem4; {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:03,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:03,539 INFO L273 TraceCheckUtils]: 32: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:03,540 INFO L256 TraceCheckUtils]: 33: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,541 INFO L273 TraceCheckUtils]: 34: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,542 INFO L273 TraceCheckUtils]: 35: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(0bv32 == ~cond); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,542 INFO L273 TraceCheckUtils]: 36: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,543 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:03,544 INFO L273 TraceCheckUtils]: 38: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:03,545 INFO L273 TraceCheckUtils]: 39: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:03,546 INFO L273 TraceCheckUtils]: 40: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:03,547 INFO L273 TraceCheckUtils]: 41: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:03,548 INFO L256 TraceCheckUtils]: 42: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,549 INFO L273 TraceCheckUtils]: 43: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,549 INFO L273 TraceCheckUtils]: 44: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(0bv32 == ~cond); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,550 INFO L273 TraceCheckUtils]: 45: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,551 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} #67#return; {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:03,552 INFO L273 TraceCheckUtils]: 47: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} havoc #t~mem4; {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:03,553 INFO L273 TraceCheckUtils]: 48: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4452#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,554 INFO L273 TraceCheckUtils]: 49: Hoare triple {4452#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4452#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-18 21:06:03,555 INFO L273 TraceCheckUtils]: 50: Hoare triple {4452#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4296#false} is VALID [2018-11-18 21:06:03,555 INFO L256 TraceCheckUtils]: 51: Hoare triple {4296#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {4296#false} is VALID [2018-11-18 21:06:03,555 INFO L273 TraceCheckUtils]: 52: Hoare triple {4296#false} ~cond := #in~cond; {4296#false} is VALID [2018-11-18 21:06:03,555 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#false} assume 0bv32 == ~cond; {4296#false} is VALID [2018-11-18 21:06:03,556 INFO L273 TraceCheckUtils]: 54: Hoare triple {4296#false} assume !false; {4296#false} is VALID [2018-11-18 21:06:03,566 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 21:06:03,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:06:04,083 INFO L273 TraceCheckUtils]: 54: Hoare triple {4296#false} assume !false; {4296#false} is VALID [2018-11-18 21:06:04,083 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#false} assume 0bv32 == ~cond; {4296#false} is VALID [2018-11-18 21:06:04,083 INFO L273 TraceCheckUtils]: 52: Hoare triple {4296#false} ~cond := #in~cond; {4296#false} is VALID [2018-11-18 21:06:04,083 INFO L256 TraceCheckUtils]: 51: Hoare triple {4296#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {4296#false} is VALID [2018-11-18 21:06:04,084 INFO L273 TraceCheckUtils]: 50: Hoare triple {4483#(not (bvslt main_~i~0 ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4296#false} is VALID [2018-11-18 21:06:04,084 INFO L273 TraceCheckUtils]: 49: Hoare triple {4483#(not (bvslt main_~i~0 ~SIZE~0))} assume true; {4483#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:06:04,085 INFO L273 TraceCheckUtils]: 48: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4483#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:06:04,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} havoc #t~mem4; {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,086 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4295#true} {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #67#return; {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,086 INFO L273 TraceCheckUtils]: 45: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-18 21:06:04,087 INFO L273 TraceCheckUtils]: 44: Hoare triple {4295#true} assume !(0bv32 == ~cond); {4295#true} is VALID [2018-11-18 21:06:04,087 INFO L273 TraceCheckUtils]: 43: Hoare triple {4295#true} ~cond := #in~cond; {4295#true} is VALID [2018-11-18 21:06:04,087 INFO L256 TraceCheckUtils]: 42: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {4295#true} is VALID [2018-11-18 21:06:04,087 INFO L273 TraceCheckUtils]: 41: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,088 INFO L273 TraceCheckUtils]: 40: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,109 INFO L273 TraceCheckUtils]: 39: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,110 INFO L273 TraceCheckUtils]: 38: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} havoc #t~mem4; {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,110 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {4295#true} {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #67#return; {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-18 21:06:04,111 INFO L273 TraceCheckUtils]: 35: Hoare triple {4295#true} assume !(0bv32 == ~cond); {4295#true} is VALID [2018-11-18 21:06:04,111 INFO L273 TraceCheckUtils]: 34: Hoare triple {4295#true} ~cond := #in~cond; {4295#true} is VALID [2018-11-18 21:06:04,111 INFO L256 TraceCheckUtils]: 33: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {4295#true} is VALID [2018-11-18 21:06:04,128 INFO L273 TraceCheckUtils]: 32: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume true; {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,152 INFO L273 TraceCheckUtils]: 29: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} havoc #t~mem4; {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,153 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {4295#true} {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} #67#return; {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,153 INFO L273 TraceCheckUtils]: 27: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-18 21:06:04,153 INFO L273 TraceCheckUtils]: 26: Hoare triple {4295#true} assume !(0bv32 == ~cond); {4295#true} is VALID [2018-11-18 21:06:04,153 INFO L273 TraceCheckUtils]: 25: Hoare triple {4295#true} ~cond := #in~cond; {4295#true} is VALID [2018-11-18 21:06:04,153 INFO L256 TraceCheckUtils]: 24: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {4295#true} is VALID [2018-11-18 21:06:04,154 INFO L273 TraceCheckUtils]: 23: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,154 INFO L273 TraceCheckUtils]: 22: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume true; {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {4574#(not (bvslt (_ bv3 32) ~SIZE~0))} ~i~0 := 0bv32; {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {4578#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume !~bvslt32(~i~0, ~SIZE~0); {4574#(not (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:06:04,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {4578#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume true; {4578#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:06:04,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4578#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:06:04,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,159 INFO L273 TraceCheckUtils]: 15: Hoare triple {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,189 INFO L273 TraceCheckUtils]: 14: Hoare triple {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,189 INFO L273 TraceCheckUtils]: 13: Hoare triple {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume true; {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,222 INFO L273 TraceCheckUtils]: 10: Hoare triple {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume true; {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,224 INFO L273 TraceCheckUtils]: 6: Hoare triple {4295#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:06:04,225 INFO L273 TraceCheckUtils]: 5: Hoare triple {4295#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4295#true} is VALID [2018-11-18 21:06:04,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {4295#true} call #t~ret5 := main(); {4295#true} is VALID [2018-11-18 21:06:04,225 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4295#true} {4295#true} #63#return; {4295#true} is VALID [2018-11-18 21:06:04,225 INFO L273 TraceCheckUtils]: 2: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-18 21:06:04,225 INFO L273 TraceCheckUtils]: 1: Hoare triple {4295#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {4295#true} is VALID [2018-11-18 21:06:04,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {4295#true} call ULTIMATE.init(); {4295#true} is VALID [2018-11-18 21:06:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 21:06:04,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:06:04,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-18 21:06:04,232 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-18 21:06:04,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:06:04,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 21:06:04,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:06:04,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 21:06:04,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 21:06:04,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-11-18 21:06:04,486 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 20 states. [2018-11-18 21:06:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:06:07,861 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2018-11-18 21:06:07,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 21:06:07,862 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-18 21:06:07,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:06:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 21:06:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions. [2018-11-18 21:06:07,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 21:06:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions. [2018-11-18 21:06:07,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 97 transitions. [2018-11-18 21:06:08,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:06:08,700 INFO L225 Difference]: With dead ends: 158 [2018-11-18 21:06:08,700 INFO L226 Difference]: Without dead ends: 121 [2018-11-18 21:06:08,701 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-18 21:06:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-18 21:06:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2018-11-18 21:06:08,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:06:08,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 104 states. [2018-11-18 21:06:08,882 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 104 states. [2018-11-18 21:06:08,882 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 104 states. [2018-11-18 21:06:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:06:08,887 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2018-11-18 21:06:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2018-11-18 21:06:08,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:06:08,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:06:08,889 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 121 states. [2018-11-18 21:06:08,889 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 121 states. [2018-11-18 21:06:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:06:08,893 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2018-11-18 21:06:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2018-11-18 21:06:08,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:06:08,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:06:08,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:06:08,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:06:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-18 21:06:08,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2018-11-18 21:06:08,897 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 55 [2018-11-18 21:06:08,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:06:08,898 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-11-18 21:06:08,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 21:06:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-11-18 21:06:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 21:06:08,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:06:08,899 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:06:08,900 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:06:08,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:06:08,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1009564918, now seen corresponding path program 4 times [2018-11-18 21:06:08,900 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:06:08,900 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:06:08,924 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 21:06:09,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 21:06:09,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:06:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:06:09,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:06:09,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 21:06:09,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 21:06:09,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:06:09,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:06:09,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:06:09,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-18 21:06:09,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 21:06:09,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 21:06:09,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:06:09,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:06:09,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:06:09,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-18 21:06:09,598 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:06:09,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {5235#true} call ULTIMATE.init(); {5235#true} is VALID [2018-11-18 21:06:09,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {5235#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {5235#true} is VALID [2018-11-18 21:06:09,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-18 21:06:09,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5235#true} {5235#true} #63#return; {5235#true} is VALID [2018-11-18 21:06:09,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {5235#true} call #t~ret5 := main(); {5235#true} is VALID [2018-11-18 21:06:09,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {5235#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {5235#true} is VALID [2018-11-18 21:06:09,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {5235#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {5258#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:06:09,698 INFO L273 TraceCheckUtils]: 7: Hoare triple {5258#(= main_~i~0 (_ bv0 32))} assume true; {5258#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:06:09,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {5258#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:06:09,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {5258#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5258#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:06:09,701 INFO L273 TraceCheckUtils]: 10: Hoare triple {5258#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:06:09,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:06:09,703 INFO L273 TraceCheckUtils]: 12: Hoare triple {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:06:09,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:06:09,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5284#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:06:09,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {5284#(= (_ bv2 32) main_~i~0)} assume true; {5284#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:06:09,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {5284#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {5284#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:06:09,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {5284#(= (_ bv2 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5284#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:06:09,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {5284#(= (_ bv2 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:06:09,705 INFO L273 TraceCheckUtils]: 19: Hoare triple {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:06:09,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:06:09,707 INFO L273 TraceCheckUtils]: 21: Hoare triple {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-18 21:06:09,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-18 21:06:09,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} assume true; {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-18 21:06:09,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} assume !~bvslt32(~i~0, ~SIZE~0); {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-18 21:06:09,712 INFO L273 TraceCheckUtils]: 25: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} ~i~0 := 0bv32; {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:06:09,715 INFO L273 TraceCheckUtils]: 26: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} assume true; {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:06:09,715 INFO L273 TraceCheckUtils]: 27: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:06:09,717 INFO L256 TraceCheckUtils]: 28: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} ~cond := #in~cond; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume !(0bv32 == ~cond); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume true; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,721 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} #67#return; {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:06:09,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} havoc #t~mem4; {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:06:09,723 INFO L273 TraceCheckUtils]: 34: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:09,723 INFO L273 TraceCheckUtils]: 35: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:09,724 INFO L273 TraceCheckUtils]: 36: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:09,725 INFO L256 TraceCheckUtils]: 37: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,726 INFO L273 TraceCheckUtils]: 38: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} ~cond := #in~cond; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,727 INFO L273 TraceCheckUtils]: 39: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume !(0bv32 == ~cond); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,727 INFO L273 TraceCheckUtils]: 40: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume true; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,728 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:09,728 INFO L273 TraceCheckUtils]: 42: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:09,729 INFO L273 TraceCheckUtils]: 43: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:09,729 INFO L273 TraceCheckUtils]: 44: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} assume true; {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:09,730 INFO L273 TraceCheckUtils]: 45: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:09,732 INFO L256 TraceCheckUtils]: 46: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,733 INFO L273 TraceCheckUtils]: 47: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} ~cond := #in~cond; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,734 INFO L273 TraceCheckUtils]: 48: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume !(0bv32 == ~cond); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,734 INFO L273 TraceCheckUtils]: 49: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume true; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-18 21:06:09,735 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} #67#return; {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:09,736 INFO L273 TraceCheckUtils]: 51: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} havoc #t~mem4; {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:06:09,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5405#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:09,739 INFO L273 TraceCheckUtils]: 53: Hoare triple {5405#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {5405#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 21:06:09,740 INFO L273 TraceCheckUtils]: 54: Hoare triple {5405#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5412#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-18 21:06:09,741 INFO L256 TraceCheckUtils]: 55: Hoare triple {5412#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {5416#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:06:09,741 INFO L273 TraceCheckUtils]: 56: Hoare triple {5416#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {5420#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:06:09,742 INFO L273 TraceCheckUtils]: 57: Hoare triple {5420#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {5236#false} is VALID [2018-11-18 21:06:09,742 INFO L273 TraceCheckUtils]: 58: Hoare triple {5236#false} assume !false; {5236#false} is VALID [2018-11-18 21:06:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 21:06:09,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:06:18,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-18 21:06:18,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-18 21:06:18,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:06:18,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:06:18,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:06:18,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:5 [2018-11-18 21:06:18,304 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:06:18,570 INFO L273 TraceCheckUtils]: 58: Hoare triple {5236#false} assume !false; {5236#false} is VALID [2018-11-18 21:06:18,571 INFO L273 TraceCheckUtils]: 57: Hoare triple {5430#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {5236#false} is VALID [2018-11-18 21:06:18,572 INFO L273 TraceCheckUtils]: 56: Hoare triple {5434#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {5430#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 21:06:18,573 INFO L256 TraceCheckUtils]: 55: Hoare triple {5412#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {5434#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 21:06:18,573 INFO L273 TraceCheckUtils]: 54: Hoare triple {5441#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5412#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-18 21:06:18,574 INFO L273 TraceCheckUtils]: 53: Hoare triple {5441#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume true; {5441#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-18 21:06:18,785 INFO L273 TraceCheckUtils]: 52: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5441#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-18 21:06:18,786 INFO L273 TraceCheckUtils]: 51: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} havoc #t~mem4; {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:18,787 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5235#true} {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #67#return; {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:18,787 INFO L273 TraceCheckUtils]: 49: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-18 21:06:18,787 INFO L273 TraceCheckUtils]: 48: Hoare triple {5235#true} assume !(0bv32 == ~cond); {5235#true} is VALID [2018-11-18 21:06:18,787 INFO L273 TraceCheckUtils]: 47: Hoare triple {5235#true} ~cond := #in~cond; {5235#true} is VALID [2018-11-18 21:06:18,787 INFO L256 TraceCheckUtils]: 46: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {5235#true} is VALID [2018-11-18 21:06:18,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:18,788 INFO L273 TraceCheckUtils]: 44: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume true; {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:19,119 INFO L273 TraceCheckUtils]: 43: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:19,120 INFO L273 TraceCheckUtils]: 42: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} havoc #t~mem4; {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:06:19,120 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5235#true} {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #67#return; {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:06:19,120 INFO L273 TraceCheckUtils]: 40: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-18 21:06:19,120 INFO L273 TraceCheckUtils]: 39: Hoare triple {5235#true} assume !(0bv32 == ~cond); {5235#true} is VALID [2018-11-18 21:06:19,121 INFO L273 TraceCheckUtils]: 38: Hoare triple {5235#true} ~cond := #in~cond; {5235#true} is VALID [2018-11-18 21:06:19,121 INFO L256 TraceCheckUtils]: 37: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {5235#true} is VALID [2018-11-18 21:06:19,121 INFO L273 TraceCheckUtils]: 36: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:06:19,121 INFO L273 TraceCheckUtils]: 35: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume true; {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:06:19,427 INFO L273 TraceCheckUtils]: 34: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:06:19,428 INFO L273 TraceCheckUtils]: 33: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} havoc #t~mem4; {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:19,428 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5235#true} {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} #67#return; {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:19,428 INFO L273 TraceCheckUtils]: 31: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-18 21:06:19,429 INFO L273 TraceCheckUtils]: 30: Hoare triple {5235#true} assume !(0bv32 == ~cond); {5235#true} is VALID [2018-11-18 21:06:19,429 INFO L273 TraceCheckUtils]: 29: Hoare triple {5235#true} ~cond := #in~cond; {5235#true} is VALID [2018-11-18 21:06:19,429 INFO L256 TraceCheckUtils]: 28: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {5235#true} is VALID [2018-11-18 21:06:19,429 INFO L273 TraceCheckUtils]: 27: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:19,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} assume true; {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:19,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} ~i~0 := 0bv32; {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:06:19,431 INFO L273 TraceCheckUtils]: 24: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} assume !~bvslt32(~i~0, ~SIZE~0); {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-18 21:06:19,432 INFO L273 TraceCheckUtils]: 23: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} assume true; {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-18 21:06:19,432 INFO L273 TraceCheckUtils]: 22: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-18 21:06:19,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-18 21:06:19,434 INFO L273 TraceCheckUtils]: 20: Hoare triple {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,434 INFO L273 TraceCheckUtils]: 19: Hoare triple {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,436 INFO L273 TraceCheckUtils]: 18: Hoare triple {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,440 INFO L273 TraceCheckUtils]: 13: Hoare triple {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,441 INFO L273 TraceCheckUtils]: 11: Hoare triple {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,463 INFO L273 TraceCheckUtils]: 7: Hoare triple {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {5235#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:06:19,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {5235#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {5235#true} is VALID [2018-11-18 21:06:19,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {5235#true} call #t~ret5 := main(); {5235#true} is VALID [2018-11-18 21:06:19,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5235#true} {5235#true} #63#return; {5235#true} is VALID [2018-11-18 21:06:19,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-18 21:06:19,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {5235#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {5235#true} is VALID [2018-11-18 21:06:19,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {5235#true} call ULTIMATE.init(); {5235#true} is VALID [2018-11-18 21:06:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 21:06:19,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:06:19,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-11-18 21:06:19,476 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-11-18 21:06:19,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:06:19,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 21:06:20,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:06:20,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 21:06:20,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 21:06:20,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=522, Unknown=4, NotChecked=0, Total=600 [2018-11-18 21:06:20,503 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 25 states. [2018-11-18 21:07:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:07:10,311 INFO L93 Difference]: Finished difference Result 149 states and 168 transitions. [2018-11-18 21:07:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 21:07:10,311 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-11-18 21:07:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:07:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 21:07:10,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 113 transitions. [2018-11-18 21:07:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 21:07:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 113 transitions. [2018-11-18 21:07:10,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 113 transitions. [2018-11-18 21:07:10,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:07:10,584 INFO L225 Difference]: With dead ends: 149 [2018-11-18 21:07:10,584 INFO L226 Difference]: Without dead ends: 147 [2018-11-18 21:07:10,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 89 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=123, Invalid=926, Unknown=7, NotChecked=0, Total=1056 [2018-11-18 21:07:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-18 21:07:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 113. [2018-11-18 21:07:10,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:07:10,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 113 states. [2018-11-18 21:07:10,733 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 113 states. [2018-11-18 21:07:10,733 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 113 states. [2018-11-18 21:07:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:07:10,738 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2018-11-18 21:07:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2018-11-18 21:07:10,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:07:10,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:07:10,739 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 147 states. [2018-11-18 21:07:10,739 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 147 states. [2018-11-18 21:07:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:07:10,744 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2018-11-18 21:07:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2018-11-18 21:07:10,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:07:10,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:07:10,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:07:10,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:07:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-18 21:07:10,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2018-11-18 21:07:10,748 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 59 [2018-11-18 21:07:10,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:07:10,749 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2018-11-18 21:07:10,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 21:07:10,749 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2018-11-18 21:07:10,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 21:07:10,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:07:10,750 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:07:10,751 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:07:10,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:07:10,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1647911821, now seen corresponding path program 5 times [2018-11-18 21:07:10,751 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:07:10,751 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:07:10,778 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-18 21:07:11,110 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-18 21:07:11,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:07:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:07:11,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:07:11,806 INFO L256 TraceCheckUtils]: 0: Hoare triple {6264#true} call ULTIMATE.init(); {6264#true} is VALID [2018-11-18 21:07:11,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {6264#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {6264#true} is VALID [2018-11-18 21:07:11,807 INFO L273 TraceCheckUtils]: 2: Hoare triple {6264#true} assume true; {6264#true} is VALID [2018-11-18 21:07:11,807 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6264#true} {6264#true} #63#return; {6264#true} is VALID [2018-11-18 21:07:11,807 INFO L256 TraceCheckUtils]: 4: Hoare triple {6264#true} call #t~ret5 := main(); {6264#true} is VALID [2018-11-18 21:07:11,807 INFO L273 TraceCheckUtils]: 5: Hoare triple {6264#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6264#true} is VALID [2018-11-18 21:07:11,808 INFO L273 TraceCheckUtils]: 6: Hoare triple {6264#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {6287#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:07:11,808 INFO L273 TraceCheckUtils]: 7: Hoare triple {6287#(= main_~i~0 (_ bv0 32))} assume true; {6287#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:07:11,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {6287#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {6294#(and (bvslt main_~i~0 ~SIZE~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:07:11,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {6294#(and (bvslt main_~i~0 ~SIZE~0) (= main_~i~0 (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6294#(and (bvslt main_~i~0 ~SIZE~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:07:11,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {6294#(and (bvslt main_~i~0 ~SIZE~0) (= main_~i~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6301#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:11,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {6301#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {6301#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:11,812 INFO L273 TraceCheckUtils]: 12: Hoare triple {6301#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {6301#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:11,813 INFO L273 TraceCheckUtils]: 13: Hoare triple {6301#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6301#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:11,814 INFO L273 TraceCheckUtils]: 14: Hoare triple {6301#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6314#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) ~SIZE~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:07:11,815 INFO L273 TraceCheckUtils]: 15: Hoare triple {6314#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) ~SIZE~0) (= (_ bv2 32) main_~i~0))} assume true; {6314#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) ~SIZE~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:07:11,816 INFO L273 TraceCheckUtils]: 16: Hoare triple {6314#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) ~SIZE~0) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {6314#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) ~SIZE~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:07:11,818 INFO L273 TraceCheckUtils]: 17: Hoare triple {6314#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) ~SIZE~0) (= (_ bv2 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6314#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) ~SIZE~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:07:11,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {6314#(and (bvslt (bvadd main_~i~0 (_ bv4294967294 32)) ~SIZE~0) (= (_ bv2 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6327#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {6327#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) ~SIZE~0))} assume true; {6327#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {6327#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv0 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {6334#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:07:11,821 INFO L273 TraceCheckUtils]: 21: Hoare triple {6334#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~i~0 ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6334#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:07:11,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {6334#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt main_~i~0 ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6341#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:11,824 INFO L273 TraceCheckUtils]: 23: Hoare triple {6341#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (_ bv4 32) main_~i~0))} assume true; {6341#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:11,824 INFO L273 TraceCheckUtils]: 24: Hoare triple {6341#(and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~SIZE~0) (= (_ bv4 32) main_~i~0))} assume !~bvslt32(~i~0, ~SIZE~0); {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} ~i~0 := 0bv32; {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,826 INFO L273 TraceCheckUtils]: 26: Hoare triple {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} assume true; {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,827 INFO L273 TraceCheckUtils]: 27: Hoare triple {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,828 INFO L256 TraceCheckUtils]: 28: Hoare triple {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,829 INFO L273 TraceCheckUtils]: 29: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} ~cond := #in~cond; {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,830 INFO L273 TraceCheckUtils]: 30: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} assume !(0bv32 == ~cond); {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,830 INFO L273 TraceCheckUtils]: 31: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} assume true; {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,831 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} #67#return; {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,832 INFO L273 TraceCheckUtils]: 33: Hoare triple {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} havoc #t~mem4; {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {6352#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:11,834 INFO L273 TraceCheckUtils]: 35: Hoare triple {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:11,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:11,836 INFO L256 TraceCheckUtils]: 37: Hoare triple {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,837 INFO L273 TraceCheckUtils]: 38: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} ~cond := #in~cond; {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,837 INFO L273 TraceCheckUtils]: 39: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} assume !(0bv32 == ~cond); {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,838 INFO L273 TraceCheckUtils]: 40: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} assume true; {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,839 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:11,840 INFO L273 TraceCheckUtils]: 42: Hoare triple {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:11,841 INFO L273 TraceCheckUtils]: 43: Hoare triple {6380#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,841 INFO L273 TraceCheckUtils]: 44: Hoare triple {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} assume true; {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,842 INFO L273 TraceCheckUtils]: 45: Hoare triple {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,844 INFO L256 TraceCheckUtils]: 46: Hoare triple {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,844 INFO L273 TraceCheckUtils]: 47: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} ~cond := #in~cond; {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,845 INFO L273 TraceCheckUtils]: 48: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} assume !(0bv32 == ~cond); {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,846 INFO L273 TraceCheckUtils]: 49: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} assume true; {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,847 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} #67#return; {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,847 INFO L273 TraceCheckUtils]: 51: Hoare triple {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} havoc #t~mem4; {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,848 INFO L273 TraceCheckUtils]: 52: Hoare triple {6408#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv2 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,849 INFO L273 TraceCheckUtils]: 53: Hoare triple {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} assume true; {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,856 INFO L256 TraceCheckUtils]: 55: Hoare triple {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,857 INFO L273 TraceCheckUtils]: 56: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} ~cond := #in~cond; {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,857 INFO L273 TraceCheckUtils]: 57: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} assume !(0bv32 == ~cond); {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,858 INFO L273 TraceCheckUtils]: 58: Hoare triple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} assume true; {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,858 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6348#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (_ bv3 32) ~SIZE~0))} {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} #67#return; {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,859 INFO L273 TraceCheckUtils]: 60: Hoare triple {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} havoc #t~mem4; {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,860 INFO L273 TraceCheckUtils]: 61: Hoare triple {6436#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvslt (_ bv3 32) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6464#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv4 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,860 INFO L273 TraceCheckUtils]: 62: Hoare triple {6464#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv4 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} assume true; {6464#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv4 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-18 21:07:11,861 INFO L273 TraceCheckUtils]: 63: Hoare triple {6464#(and (not (bvslt (_ bv4 32) ~SIZE~0)) (= (_ bv4 32) main_~i~0) (bvslt (_ bv3 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6265#false} is VALID [2018-11-18 21:07:11,862 INFO L256 TraceCheckUtils]: 64: Hoare triple {6265#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6265#false} is VALID [2018-11-18 21:07:11,862 INFO L273 TraceCheckUtils]: 65: Hoare triple {6265#false} ~cond := #in~cond; {6265#false} is VALID [2018-11-18 21:07:11,862 INFO L273 TraceCheckUtils]: 66: Hoare triple {6265#false} assume 0bv32 == ~cond; {6265#false} is VALID [2018-11-18 21:07:11,862 INFO L273 TraceCheckUtils]: 67: Hoare triple {6265#false} assume !false; {6265#false} is VALID [2018-11-18 21:07:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 70 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 21:07:11,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:07:12,961 INFO L273 TraceCheckUtils]: 67: Hoare triple {6265#false} assume !false; {6265#false} is VALID [2018-11-18 21:07:12,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {6265#false} assume 0bv32 == ~cond; {6265#false} is VALID [2018-11-18 21:07:12,962 INFO L273 TraceCheckUtils]: 65: Hoare triple {6265#false} ~cond := #in~cond; {6265#false} is VALID [2018-11-18 21:07:12,962 INFO L256 TraceCheckUtils]: 64: Hoare triple {6265#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6265#false} is VALID [2018-11-18 21:07:12,962 INFO L273 TraceCheckUtils]: 63: Hoare triple {6495#(not (bvslt main_~i~0 ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6265#false} is VALID [2018-11-18 21:07:12,963 INFO L273 TraceCheckUtils]: 62: Hoare triple {6495#(not (bvslt main_~i~0 ~SIZE~0))} assume true; {6495#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:07:12,965 INFO L273 TraceCheckUtils]: 61: Hoare triple {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6495#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:07:12,965 INFO L273 TraceCheckUtils]: 60: Hoare triple {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} havoc #t~mem4; {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:12,966 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6264#true} {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #67#return; {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:12,967 INFO L273 TraceCheckUtils]: 58: Hoare triple {6264#true} assume true; {6264#true} is VALID [2018-11-18 21:07:12,967 INFO L273 TraceCheckUtils]: 57: Hoare triple {6264#true} assume !(0bv32 == ~cond); {6264#true} is VALID [2018-11-18 21:07:12,967 INFO L273 TraceCheckUtils]: 56: Hoare triple {6264#true} ~cond := #in~cond; {6264#true} is VALID [2018-11-18 21:07:12,967 INFO L256 TraceCheckUtils]: 55: Hoare triple {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6264#true} is VALID [2018-11-18 21:07:12,967 INFO L273 TraceCheckUtils]: 54: Hoare triple {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:12,968 INFO L273 TraceCheckUtils]: 53: Hoare triple {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:12,987 INFO L273 TraceCheckUtils]: 52: Hoare triple {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6502#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:12,988 INFO L273 TraceCheckUtils]: 51: Hoare triple {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} havoc #t~mem4; {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:12,989 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {6264#true} {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #67#return; {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:12,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {6264#true} assume true; {6264#true} is VALID [2018-11-18 21:07:12,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {6264#true} assume !(0bv32 == ~cond); {6264#true} is VALID [2018-11-18 21:07:12,989 INFO L273 TraceCheckUtils]: 47: Hoare triple {6264#true} ~cond := #in~cond; {6264#true} is VALID [2018-11-18 21:07:12,989 INFO L256 TraceCheckUtils]: 46: Hoare triple {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6264#true} is VALID [2018-11-18 21:07:12,989 INFO L273 TraceCheckUtils]: 45: Hoare triple {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:12,990 INFO L273 TraceCheckUtils]: 44: Hoare triple {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume true; {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,019 INFO L273 TraceCheckUtils]: 43: Hoare triple {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6530#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} havoc #t~mem4; {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,020 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {6264#true} {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} #67#return; {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {6264#true} assume true; {6264#true} is VALID [2018-11-18 21:07:13,021 INFO L273 TraceCheckUtils]: 39: Hoare triple {6264#true} assume !(0bv32 == ~cond); {6264#true} is VALID [2018-11-18 21:07:13,021 INFO L273 TraceCheckUtils]: 38: Hoare triple {6264#true} ~cond := #in~cond; {6264#true} is VALID [2018-11-18 21:07:13,021 INFO L256 TraceCheckUtils]: 37: Hoare triple {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6264#true} is VALID [2018-11-18 21:07:13,025 INFO L273 TraceCheckUtils]: 36: Hoare triple {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,025 INFO L273 TraceCheckUtils]: 35: Hoare triple {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume true; {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,060 INFO L273 TraceCheckUtils]: 34: Hoare triple {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {6558#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,060 INFO L273 TraceCheckUtils]: 33: Hoare triple {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} havoc #t~mem4; {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,061 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {6264#true} {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} #67#return; {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,061 INFO L273 TraceCheckUtils]: 31: Hoare triple {6264#true} assume true; {6264#true} is VALID [2018-11-18 21:07:13,061 INFO L273 TraceCheckUtils]: 30: Hoare triple {6264#true} assume !(0bv32 == ~cond); {6264#true} is VALID [2018-11-18 21:07:13,061 INFO L273 TraceCheckUtils]: 29: Hoare triple {6264#true} ~cond := #in~cond; {6264#true} is VALID [2018-11-18 21:07:13,062 INFO L256 TraceCheckUtils]: 28: Hoare triple {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {6264#true} is VALID [2018-11-18 21:07:13,062 INFO L273 TraceCheckUtils]: 27: Hoare triple {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,063 INFO L273 TraceCheckUtils]: 26: Hoare triple {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} assume true; {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {6614#(not (bvslt (_ bv4 32) ~SIZE~0))} ~i~0 := 0bv32; {6586#(not (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {6618#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume !~bvslt32(~i~0, ~SIZE~0); {6614#(not (bvslt (_ bv4 32) ~SIZE~0))} is VALID [2018-11-18 21:07:13,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {6618#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume true; {6618#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:07:13,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {6625#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6618#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-18 21:07:13,139 INFO L273 TraceCheckUtils]: 21: Hoare triple {6625#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6625#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,154 INFO L273 TraceCheckUtils]: 20: Hoare triple {6632#(or (not (bvslt main_~i~0 ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {6625#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {6632#(or (not (bvslt main_~i~0 ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {6632#(or (not (bvslt main_~i~0 ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {6639#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv4 32) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6632#(or (not (bvslt main_~i~0 ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {6639#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv4 32) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6639#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv4 32) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)))} is VALID [2018-11-18 21:07:13,191 INFO L273 TraceCheckUtils]: 16: Hoare triple {6639#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv4 32) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)))} assume !!~bvslt32(~i~0, ~SIZE~0); {6639#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv4 32) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)))} is VALID [2018-11-18 21:07:13,191 INFO L273 TraceCheckUtils]: 15: Hoare triple {6639#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv4 32) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)))} assume true; {6639#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv4 32) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)))} is VALID [2018-11-18 21:07:13,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {6652#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6639#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv4 32) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)))} is VALID [2018-11-18 21:07:13,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {6652#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6652#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {6652#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {6652#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {6652#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume true; {6652#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {6665#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6652#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-18 21:07:13,379 INFO L273 TraceCheckUtils]: 9: Hoare triple {6665#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6665#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0)))} is VALID [2018-11-18 21:07:13,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {6672#(forall ((~SIZE~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))))} assume !!~bvslt32(~i~0, ~SIZE~0); {6665#(or (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0)))} is VALID [2018-11-18 21:07:13,403 INFO L273 TraceCheckUtils]: 7: Hoare triple {6672#(forall ((~SIZE~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))))} assume true; {6672#(forall ((~SIZE~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))))} is VALID [2018-11-18 21:07:13,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {6264#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {6672#(forall ((~SIZE~0 (_ BitVec 32))) (or (not (bvslt main_~i~0 ~SIZE~0)) (not (bvslt (_ bv4 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv4 32)) ~SIZE~0) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))))} is VALID [2018-11-18 21:07:13,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {6264#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {6264#true} is VALID [2018-11-18 21:07:13,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {6264#true} call #t~ret5 := main(); {6264#true} is VALID [2018-11-18 21:07:13,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6264#true} {6264#true} #63#return; {6264#true} is VALID [2018-11-18 21:07:13,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {6264#true} assume true; {6264#true} is VALID [2018-11-18 21:07:13,405 INFO L273 TraceCheckUtils]: 1: Hoare triple {6264#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {6264#true} is VALID [2018-11-18 21:07:13,405 INFO L256 TraceCheckUtils]: 0: Hoare triple {6264#true} call ULTIMATE.init(); {6264#true} is VALID [2018-11-18 21:07:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 70 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 21:07:13,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:07:13,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-18 21:07:13,415 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 68 [2018-11-18 21:07:13,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:07:13,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-18 21:07:13,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:07:13,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-18 21:07:13,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-18 21:07:13,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2018-11-18 21:07:13,893 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand 28 states. [2018-11-18 21:07:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:07:17,800 INFO L93 Difference]: Finished difference Result 184 states and 205 transitions. [2018-11-18 21:07:17,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 21:07:17,800 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 68 [2018-11-18 21:07:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:07:17,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 21:07:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2018-11-18 21:07:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 21:07:17,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2018-11-18 21:07:17,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2018-11-18 21:07:18,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:07:18,350 INFO L225 Difference]: With dead ends: 184 [2018-11-18 21:07:18,351 INFO L226 Difference]: Without dead ends: 138 [2018-11-18 21:07:18,352 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2018-11-18 21:07:18,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-18 21:07:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2018-11-18 21:07:18,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:07:18,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 113 states. [2018-11-18 21:07:18,568 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 113 states. [2018-11-18 21:07:18,568 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 113 states. [2018-11-18 21:07:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:07:18,572 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2018-11-18 21:07:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2018-11-18 21:07:18,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:07:18,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:07:18,573 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 138 states. [2018-11-18 21:07:18,573 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 138 states. [2018-11-18 21:07:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:07:18,577 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2018-11-18 21:07:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2018-11-18 21:07:18,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:07:18,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:07:18,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:07:18,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:07:18,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-18 21:07:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-11-18 21:07:18,580 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 68 [2018-11-18 21:07:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:07:18,581 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-11-18 21:07:18,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-18 21:07:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-11-18 21:07:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-18 21:07:18,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:07:18,582 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:07:18,582 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:07:18,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:07:18,583 INFO L82 PathProgramCache]: Analyzing trace with hash -940182580, now seen corresponding path program 6 times [2018-11-18 21:07:18,583 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:07:18,583 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:07:18,610 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-18 21:07:18,941 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-18 21:07:18,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:07:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:07:18,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:07:19,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 21:07:19,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 21:07:19,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:07:19,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:07:19,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:07:19,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-18 21:07:19,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-18 21:07:19,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-18 21:07:19,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:07:19,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:07:19,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:07:19,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-18 21:07:19,674 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:07:19,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {7365#true} call ULTIMATE.init(); {7365#true} is VALID [2018-11-18 21:07:19,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {7365#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {7365#true} is VALID [2018-11-18 21:07:19,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {7365#true} assume true; {7365#true} is VALID [2018-11-18 21:07:19,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7365#true} {7365#true} #63#return; {7365#true} is VALID [2018-11-18 21:07:19,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {7365#true} call #t~ret5 := main(); {7365#true} is VALID [2018-11-18 21:07:19,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {7365#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {7365#true} is VALID [2018-11-18 21:07:19,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {7365#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {7388#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:07:19,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {7388#(= main_~i~0 (_ bv0 32))} assume true; {7388#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:07:19,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {7388#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {7388#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:07:19,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {7388#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7388#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:07:19,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {7388#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7401#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {7401#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {7401#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {7401#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {7401#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {7401#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7401#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {7401#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7414#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:07:19,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {7414#(= (_ bv2 32) main_~i~0)} assume true; {7414#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:07:19,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {7414#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {7414#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:07:19,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {7414#(= (_ bv2 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7414#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:07:19,753 INFO L273 TraceCheckUtils]: 18: Hoare triple {7414#(= (_ bv2 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7427#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {7427#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {7427#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {7427#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {7427#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,754 INFO L273 TraceCheckUtils]: 21: Hoare triple {7427#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7427#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,755 INFO L273 TraceCheckUtils]: 22: Hoare triple {7427#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7440#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:07:19,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {7440#(= (_ bv4 32) main_~i~0)} assume true; {7440#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:07:19,756 INFO L273 TraceCheckUtils]: 24: Hoare triple {7440#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {7440#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:07:19,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {7440#(= (_ bv4 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:19,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:19,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} assume true; {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:19,760 INFO L273 TraceCheckUtils]: 28: Hoare triple {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:19,760 INFO L273 TraceCheckUtils]: 29: Hoare triple {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} ~i~0 := 0bv32; {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:07:19,761 INFO L273 TraceCheckUtils]: 30: Hoare triple {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:07:19,762 INFO L273 TraceCheckUtils]: 31: Hoare triple {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:07:19,765 INFO L256 TraceCheckUtils]: 32: Hoare triple {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,765 INFO L273 TraceCheckUtils]: 33: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} ~cond := #in~cond; {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} assume !(0bv32 == ~cond); {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,766 INFO L273 TraceCheckUtils]: 35: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} assume true; {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,767 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #67#return; {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:07:19,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} havoc #t~mem4; {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:07:19,769 INFO L273 TraceCheckUtils]: 38: Hoare triple {7463#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,770 INFO L273 TraceCheckUtils]: 39: Hoare triple {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,771 INFO L273 TraceCheckUtils]: 40: Hoare triple {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,773 INFO L256 TraceCheckUtils]: 41: Hoare triple {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,774 INFO L273 TraceCheckUtils]: 42: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} ~cond := #in~cond; {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,774 INFO L273 TraceCheckUtils]: 43: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} assume !(0bv32 == ~cond); {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,775 INFO L273 TraceCheckUtils]: 44: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} assume true; {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,776 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,776 INFO L273 TraceCheckUtils]: 46: Hoare triple {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,777 INFO L273 TraceCheckUtils]: 47: Hoare triple {7492#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:07:19,777 INFO L273 TraceCheckUtils]: 48: Hoare triple {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} assume true; {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:07:19,778 INFO L273 TraceCheckUtils]: 49: Hoare triple {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:07:19,781 INFO L256 TraceCheckUtils]: 50: Hoare triple {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,781 INFO L273 TraceCheckUtils]: 51: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} ~cond := #in~cond; {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,782 INFO L273 TraceCheckUtils]: 52: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} assume !(0bv32 == ~cond); {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,782 INFO L273 TraceCheckUtils]: 53: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} assume true; {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,784 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} #67#return; {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:07:19,784 INFO L273 TraceCheckUtils]: 55: Hoare triple {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} havoc #t~mem4; {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-18 21:07:19,786 INFO L273 TraceCheckUtils]: 56: Hoare triple {7520#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv2 32) main_~i~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,787 INFO L273 TraceCheckUtils]: 57: Hoare triple {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,788 INFO L273 TraceCheckUtils]: 58: Hoare triple {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,790 INFO L256 TraceCheckUtils]: 59: Hoare triple {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,791 INFO L273 TraceCheckUtils]: 60: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} ~cond := #in~cond; {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,792 INFO L273 TraceCheckUtils]: 61: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} assume !(0bv32 == ~cond); {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,792 INFO L273 TraceCheckUtils]: 62: Hoare triple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} assume true; {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} is VALID [2018-11-18 21:07:19,793 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {7473#(exists ((|v_main_~#a~0.base_BEFORE_CALL_11| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_11| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_11| (_ bv16 32)))))} {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #67#return; {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,794 INFO L273 TraceCheckUtils]: 64: Hoare triple {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} havoc #t~mem4; {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-18 21:07:19,795 INFO L273 TraceCheckUtils]: 65: Hoare triple {7548#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7576#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:19,796 INFO L273 TraceCheckUtils]: 66: Hoare triple {7576#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume true; {7576#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:19,797 INFO L273 TraceCheckUtils]: 67: Hoare triple {7576#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32)) (= (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7583#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-18 21:07:19,799 INFO L256 TraceCheckUtils]: 68: Hoare triple {7583#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7587#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,800 INFO L273 TraceCheckUtils]: 69: Hoare triple {7587#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {7591#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:07:19,800 INFO L273 TraceCheckUtils]: 70: Hoare triple {7591#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {7366#false} is VALID [2018-11-18 21:07:19,800 INFO L273 TraceCheckUtils]: 71: Hoare triple {7366#false} assume !false; {7366#false} is VALID [2018-11-18 21:07:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 21:07:19,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:07:30,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-18 21:07:30,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-18 21:07:30,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 21:07:30,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:07:30,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 21:07:30,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:5 [2018-11-18 21:07:30,451 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 21:07:30,763 INFO L273 TraceCheckUtils]: 71: Hoare triple {7366#false} assume !false; {7366#false} is VALID [2018-11-18 21:07:30,764 INFO L273 TraceCheckUtils]: 70: Hoare triple {7601#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {7366#false} is VALID [2018-11-18 21:07:30,765 INFO L273 TraceCheckUtils]: 69: Hoare triple {7605#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {7601#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-18 21:07:30,765 INFO L256 TraceCheckUtils]: 68: Hoare triple {7583#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7605#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-18 21:07:30,766 INFO L273 TraceCheckUtils]: 67: Hoare triple {7612#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7583#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-18 21:07:30,766 INFO L273 TraceCheckUtils]: 66: Hoare triple {7612#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume true; {7612#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-18 21:07:30,983 INFO L273 TraceCheckUtils]: 65: Hoare triple {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7612#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-18 21:07:30,984 INFO L273 TraceCheckUtils]: 64: Hoare triple {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} havoc #t~mem4; {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:30,984 INFO L268 TraceCheckUtils]: 63: Hoare quadruple {7365#true} {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #67#return; {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:30,984 INFO L273 TraceCheckUtils]: 62: Hoare triple {7365#true} assume true; {7365#true} is VALID [2018-11-18 21:07:30,985 INFO L273 TraceCheckUtils]: 61: Hoare triple {7365#true} assume !(0bv32 == ~cond); {7365#true} is VALID [2018-11-18 21:07:30,985 INFO L273 TraceCheckUtils]: 60: Hoare triple {7365#true} ~cond := #in~cond; {7365#true} is VALID [2018-11-18 21:07:30,985 INFO L256 TraceCheckUtils]: 59: Hoare triple {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7365#true} is VALID [2018-11-18 21:07:30,985 INFO L273 TraceCheckUtils]: 58: Hoare triple {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:30,985 INFO L273 TraceCheckUtils]: 57: Hoare triple {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume true; {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,264 INFO L273 TraceCheckUtils]: 56: Hoare triple {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7619#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,265 INFO L273 TraceCheckUtils]: 55: Hoare triple {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} havoc #t~mem4; {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:07:31,266 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {7365#true} {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #67#return; {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:07:31,266 INFO L273 TraceCheckUtils]: 53: Hoare triple {7365#true} assume true; {7365#true} is VALID [2018-11-18 21:07:31,266 INFO L273 TraceCheckUtils]: 52: Hoare triple {7365#true} assume !(0bv32 == ~cond); {7365#true} is VALID [2018-11-18 21:07:31,266 INFO L273 TraceCheckUtils]: 51: Hoare triple {7365#true} ~cond := #in~cond; {7365#true} is VALID [2018-11-18 21:07:31,266 INFO L256 TraceCheckUtils]: 50: Hoare triple {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7365#true} is VALID [2018-11-18 21:07:31,267 INFO L273 TraceCheckUtils]: 49: Hoare triple {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:07:31,267 INFO L273 TraceCheckUtils]: 48: Hoare triple {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume true; {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:07:31,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7647#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-18 21:07:31,583 INFO L273 TraceCheckUtils]: 46: Hoare triple {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} havoc #t~mem4; {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,587 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {7365#true} {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} #67#return; {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,587 INFO L273 TraceCheckUtils]: 44: Hoare triple {7365#true} assume true; {7365#true} is VALID [2018-11-18 21:07:31,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {7365#true} assume !(0bv32 == ~cond); {7365#true} is VALID [2018-11-18 21:07:31,587 INFO L273 TraceCheckUtils]: 42: Hoare triple {7365#true} ~cond := #in~cond; {7365#true} is VALID [2018-11-18 21:07:31,587 INFO L256 TraceCheckUtils]: 41: Hoare triple {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7365#true} is VALID [2018-11-18 21:07:31,588 INFO L273 TraceCheckUtils]: 40: Hoare triple {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,588 INFO L273 TraceCheckUtils]: 39: Hoare triple {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} assume true; {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,905 INFO L273 TraceCheckUtils]: 38: Hoare triple {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {7675#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,907 INFO L273 TraceCheckUtils]: 37: Hoare triple {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} havoc #t~mem4; {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,909 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {7365#true} {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} #67#return; {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,909 INFO L273 TraceCheckUtils]: 35: Hoare triple {7365#true} assume true; {7365#true} is VALID [2018-11-18 21:07:31,909 INFO L273 TraceCheckUtils]: 34: Hoare triple {7365#true} assume !(0bv32 == ~cond); {7365#true} is VALID [2018-11-18 21:07:31,909 INFO L273 TraceCheckUtils]: 33: Hoare triple {7365#true} ~cond := #in~cond; {7365#true} is VALID [2018-11-18 21:07:31,910 INFO L256 TraceCheckUtils]: 32: Hoare triple {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {7365#true} is VALID [2018-11-18 21:07:31,910 INFO L273 TraceCheckUtils]: 31: Hoare triple {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,911 INFO L273 TraceCheckUtils]: 30: Hoare triple {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} assume true; {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,911 INFO L273 TraceCheckUtils]: 29: Hoare triple {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} ~i~0 := 0bv32; {7703#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} assume true; {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,916 INFO L273 TraceCheckUtils]: 25: Hoare triple {7743#(= (_ bv16 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7450#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv0 32))} is VALID [2018-11-18 21:07:31,917 INFO L273 TraceCheckUtils]: 24: Hoare triple {7743#(= (_ bv16 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {7743#(= (_ bv16 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,917 INFO L273 TraceCheckUtils]: 23: Hoare triple {7743#(= (_ bv16 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {7743#(= (_ bv16 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {7753#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7743#(= (_ bv16 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,919 INFO L273 TraceCheckUtils]: 21: Hoare triple {7753#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7753#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {7753#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {7753#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {7753#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {7753#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {7766#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7753#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {7766#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7766#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,925 INFO L273 TraceCheckUtils]: 16: Hoare triple {7766#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {7766#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {7766#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {7766#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {7779#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7766#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {7779#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7779#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {7779#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {7779#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {7779#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {7779#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {7792#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {7779#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {7792#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {7792#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {7792#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {7792#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,932 INFO L273 TraceCheckUtils]: 7: Hoare triple {7792#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {7792#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {7365#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {7792#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-18 21:07:31,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {7365#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {7365#true} is VALID [2018-11-18 21:07:31,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {7365#true} call #t~ret5 := main(); {7365#true} is VALID [2018-11-18 21:07:31,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7365#true} {7365#true} #63#return; {7365#true} is VALID [2018-11-18 21:07:31,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {7365#true} assume true; {7365#true} is VALID [2018-11-18 21:07:31,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {7365#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {7365#true} is VALID [2018-11-18 21:07:31,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {7365#true} call ULTIMATE.init(); {7365#true} is VALID [2018-11-18 21:07:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 8 proven. 92 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 21:07:31,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:07:31,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2018-11-18 21:07:31,943 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2018-11-18 21:07:31,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:07:31,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 21:07:33,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:07:33,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 21:07:33,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 21:07:33,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=719, Unknown=5, NotChecked=0, Total=812 [2018-11-18 21:07:33,382 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 29 states. [2018-11-18 21:08:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:08:29,526 INFO L93 Difference]: Finished difference Result 163 states and 182 transitions. [2018-11-18 21:08:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 21:08:29,526 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2018-11-18 21:08:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:08:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 21:08:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 129 transitions. [2018-11-18 21:08:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 21:08:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 129 transitions. [2018-11-18 21:08:29,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 129 transitions. [2018-11-18 21:08:30,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:08:30,105 INFO L225 Difference]: With dead ends: 163 [2018-11-18 21:08:30,105 INFO L226 Difference]: Without dead ends: 161 [2018-11-18 21:08:30,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 109 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=142, Invalid=1255, Unknown=9, NotChecked=0, Total=1406 [2018-11-18 21:08:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-18 21:08:30,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2018-11-18 21:08:30,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:08:30,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 122 states. [2018-11-18 21:08:30,318 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 122 states. [2018-11-18 21:08:30,318 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 122 states. [2018-11-18 21:08:30,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:08:30,323 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2018-11-18 21:08:30,323 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2018-11-18 21:08:30,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:08:30,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:08:30,324 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 161 states. [2018-11-18 21:08:30,324 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 161 states. [2018-11-18 21:08:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:08:30,329 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2018-11-18 21:08:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2018-11-18 21:08:30,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:08:30,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:08:30,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:08:30,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:08:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-18 21:08:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2018-11-18 21:08:30,334 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 72 [2018-11-18 21:08:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:08:30,334 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2018-11-18 21:08:30,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 21:08:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2018-11-18 21:08:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-18 21:08:30,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:08:30,336 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:08:30,336 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:08:30,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:08:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1437902332, now seen corresponding path program 3 times [2018-11-18 21:08:30,337 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:08:30,337 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:08:30,366 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 21:08:32,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-18 21:08:32,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:08:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:08:32,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:08:32,863 INFO L256 TraceCheckUtils]: 0: Hoare triple {8537#true} call ULTIMATE.init(); {8537#true} is VALID [2018-11-18 21:08:32,863 INFO L273 TraceCheckUtils]: 1: Hoare triple {8537#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {8537#true} is VALID [2018-11-18 21:08:32,863 INFO L273 TraceCheckUtils]: 2: Hoare triple {8537#true} assume true; {8537#true} is VALID [2018-11-18 21:08:32,863 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8537#true} {8537#true} #63#return; {8537#true} is VALID [2018-11-18 21:08:32,864 INFO L256 TraceCheckUtils]: 4: Hoare triple {8537#true} call #t~ret5 := main(); {8537#true} is VALID [2018-11-18 21:08:32,864 INFO L273 TraceCheckUtils]: 5: Hoare triple {8537#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {8537#true} is VALID [2018-11-18 21:08:32,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {8537#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {8560#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:08:32,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {8560#(= main_~i~0 (_ bv0 32))} assume true; {8560#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:08:32,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {8560#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {8560#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:08:32,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {8560#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8560#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 21:08:32,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {8560#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8573#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {8573#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {8573#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {8573#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {8573#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,867 INFO L273 TraceCheckUtils]: 13: Hoare triple {8573#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8573#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {8573#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8586#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:08:32,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {8586#(= (_ bv2 32) main_~i~0)} assume true; {8586#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:08:32,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {8586#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {8586#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:08:32,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {8586#(= (_ bv2 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8586#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 21:08:32,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {8586#(= (_ bv2 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8599#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {8599#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {8599#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {8599#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {8599#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {8599#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8599#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,871 INFO L273 TraceCheckUtils]: 22: Hoare triple {8599#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8612#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:08:32,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {8612#(= (_ bv4 32) main_~i~0)} assume true; {8612#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:08:32,873 INFO L273 TraceCheckUtils]: 24: Hoare triple {8612#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {8612#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:08:32,873 INFO L273 TraceCheckUtils]: 25: Hoare triple {8612#(= (_ bv4 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8612#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 21:08:32,874 INFO L273 TraceCheckUtils]: 26: Hoare triple {8612#(= (_ bv4 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8625#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {8625#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {8625#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {8625#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {8625#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,876 INFO L273 TraceCheckUtils]: 29: Hoare triple {8625#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8625#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {8625#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8638#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 21:08:32,877 INFO L273 TraceCheckUtils]: 31: Hoare triple {8638#(= (_ bv6 32) main_~i~0)} assume true; {8638#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 21:08:32,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {8638#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {8638#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 21:08:32,878 INFO L273 TraceCheckUtils]: 33: Hoare triple {8638#(= (_ bv6 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8638#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 21:08:32,879 INFO L273 TraceCheckUtils]: 34: Hoare triple {8638#(= (_ bv6 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8651#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,879 INFO L273 TraceCheckUtils]: 35: Hoare triple {8651#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {8651#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,880 INFO L273 TraceCheckUtils]: 36: Hoare triple {8651#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {8651#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,880 INFO L273 TraceCheckUtils]: 37: Hoare triple {8651#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8651#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {8651#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8664#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 21:08:32,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {8664#(= (_ bv8 32) main_~i~0)} assume true; {8664#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 21:08:32,882 INFO L273 TraceCheckUtils]: 40: Hoare triple {8664#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {8664#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 21:08:32,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {8664#(= (_ bv8 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8664#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 21:08:32,883 INFO L273 TraceCheckUtils]: 42: Hoare triple {8664#(= (_ bv8 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8677#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,884 INFO L273 TraceCheckUtils]: 43: Hoare triple {8677#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {8677#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,884 INFO L273 TraceCheckUtils]: 44: Hoare triple {8677#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {8677#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,885 INFO L273 TraceCheckUtils]: 45: Hoare triple {8677#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8677#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,885 INFO L273 TraceCheckUtils]: 46: Hoare triple {8677#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8690#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 21:08:32,886 INFO L273 TraceCheckUtils]: 47: Hoare triple {8690#(= (_ bv10 32) main_~i~0)} assume true; {8690#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 21:08:32,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {8690#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {8690#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 21:08:32,887 INFO L273 TraceCheckUtils]: 49: Hoare triple {8690#(= (_ bv10 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8690#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 21:08:32,887 INFO L273 TraceCheckUtils]: 50: Hoare triple {8690#(= (_ bv10 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8703#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,888 INFO L273 TraceCheckUtils]: 51: Hoare triple {8703#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {8703#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,889 INFO L273 TraceCheckUtils]: 52: Hoare triple {8703#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {8703#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,889 INFO L273 TraceCheckUtils]: 53: Hoare triple {8703#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8703#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,890 INFO L273 TraceCheckUtils]: 54: Hoare triple {8703#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8716#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-18 21:08:32,890 INFO L273 TraceCheckUtils]: 55: Hoare triple {8716#(= (_ bv12 32) main_~i~0)} assume true; {8716#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-18 21:08:32,891 INFO L273 TraceCheckUtils]: 56: Hoare triple {8716#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {8716#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-18 21:08:32,891 INFO L273 TraceCheckUtils]: 57: Hoare triple {8716#(= (_ bv12 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8716#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-18 21:08:32,892 INFO L273 TraceCheckUtils]: 58: Hoare triple {8716#(= (_ bv12 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8729#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,892 INFO L273 TraceCheckUtils]: 59: Hoare triple {8729#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {8729#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {8729#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {8729#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,894 INFO L273 TraceCheckUtils]: 61: Hoare triple {8729#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8729#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 21:08:32,894 INFO L273 TraceCheckUtils]: 62: Hoare triple {8729#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8742#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 21:08:32,895 INFO L273 TraceCheckUtils]: 63: Hoare triple {8742#(= (_ bv14 32) main_~i~0)} assume true; {8742#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 21:08:32,895 INFO L273 TraceCheckUtils]: 64: Hoare triple {8742#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {8742#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 21:08:32,896 INFO L273 TraceCheckUtils]: 65: Hoare triple {8742#(= (_ bv14 32) main_~i~0)} assume ~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8538#false} is VALID [2018-11-18 21:08:32,896 INFO L273 TraceCheckUtils]: 66: Hoare triple {8538#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {8538#false} is VALID [2018-11-18 21:08:32,897 INFO L273 TraceCheckUtils]: 67: Hoare triple {8538#false} assume true; {8538#false} is VALID [2018-11-18 21:08:32,897 INFO L273 TraceCheckUtils]: 68: Hoare triple {8538#false} assume !~bvslt32(~i~0, ~SIZE~0); {8538#false} is VALID [2018-11-18 21:08:32,897 INFO L273 TraceCheckUtils]: 69: Hoare triple {8538#false} ~i~0 := 0bv32; {8538#false} is VALID [2018-11-18 21:08:32,897 INFO L273 TraceCheckUtils]: 70: Hoare triple {8538#false} assume true; {8538#false} is VALID [2018-11-18 21:08:32,897 INFO L273 TraceCheckUtils]: 71: Hoare triple {8538#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {8538#false} is VALID [2018-11-18 21:08:32,898 INFO L256 TraceCheckUtils]: 72: Hoare triple {8538#false} call __VERIFIER_assert((if 0bv32 == #t~mem4 then 1bv32 else 0bv32)); {8538#false} is VALID [2018-11-18 21:08:32,898 INFO L273 TraceCheckUtils]: 73: Hoare triple {8538#false} ~cond := #in~cond; {8538#false} is VALID [2018-11-18 21:08:32,898 INFO L273 TraceCheckUtils]: 74: Hoare triple {8538#false} assume 0bv32 == ~cond; {8538#false} is VALID [2018-11-18 21:08:32,898 INFO L273 TraceCheckUtils]: 75: Hoare triple {8538#false} assume !false; {8538#false} is VALID [2018-11-18 21:08:32,903 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 44 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:08:32,903 INFO L316 TraceCheckSpWp]: Computing backward predicates...