java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/vogal_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:03:02,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:02,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:02,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:02,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:02,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:02,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:02,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:02,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:02,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:02,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:02,478 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:02,479 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:02,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:02,481 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:02,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:02,482 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:02,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:02,486 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:02,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:02,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:02,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:02,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:02,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:02,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:02,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:02,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:02,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:02,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:02,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:02,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:02,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:02,498 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:02,498 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:02,499 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:02,500 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:02,500 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:03:02,514 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:02,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:02,515 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:02,516 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:02,516 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:02,516 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:02,517 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:02,517 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:02,517 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:02,517 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:03:02,517 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:02,518 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:02,518 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:03:02,518 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:02,518 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:03:02,518 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:02,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:03:02,519 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:02,519 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:03:02,519 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:02,519 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:02,519 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:02,520 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:02,520 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:02,520 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:02,520 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:02,520 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:03:02,521 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:03:02,521 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:02,521 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:03:02,521 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:03:02,584 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:02,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:02,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:02,612 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:02,612 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:02,613 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal_false-unreach-call.i [2018-11-23 13:03:02,679 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1d5cfb0/2cafaa240afc4338b7c57c4010a4563a/FLAGa4584fe81 [2018-11-23 13:03:03,157 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:03,157 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal_false-unreach-call.i [2018-11-23 13:03:03,164 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1d5cfb0/2cafaa240afc4338b7c57c4010a4563a/FLAGa4584fe81 [2018-11-23 13:03:03,518 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc1d5cfb0/2cafaa240afc4338b7c57c4010a4563a [2018-11-23 13:03:03,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:03,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:03:03,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:03,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:03,538 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:03,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:03,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437369d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03, skipping insertion in model container [2018-11-23 13:03:03,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:03,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:03,577 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:03,871 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:03,879 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:03,922 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:03,946 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:03,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03 WrapperNode [2018-11-23 13:03:03,947 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:03,948 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:03,948 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:03:03,949 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:03:03,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:03,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:03,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:03,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:03,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:03,990 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:04,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:04,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:04,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:04,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:04,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:04,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:04,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... [2018-11-23 13:03:04,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:04,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:04,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:04,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:04,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:03:04,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:04,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:03:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:04,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:03:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 13:03:04,185 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:04,185 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:03:04,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:03:04,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:03:05,015 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:05,016 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:03:05,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:05 BoogieIcfgContainer [2018-11-23 13:03:05,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:05,017 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:05,017 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:05,020 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:05,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:03" (1/3) ... [2018-11-23 13:03:05,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5e33ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:05, skipping insertion in model container [2018-11-23 13:03:05,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:03" (2/3) ... [2018-11-23 13:03:05,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5e33ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:05, skipping insertion in model container [2018-11-23 13:03:05,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:05" (3/3) ... [2018-11-23 13:03:05,024 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal_false-unreach-call.i [2018-11-23 13:03:05,034 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:05,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:03:05,057 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:03:05,090 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:05,091 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:05,091 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:03:05,091 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:05,092 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:05,092 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:05,092 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:05,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:05,093 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:05,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 13:03:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:03:05,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:05,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:05,123 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:05,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash 907546272, now seen corresponding path program 1 times [2018-11-23 13:03:05,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:05,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:05,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:05,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:05,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:05,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {39#true} is VALID [2018-11-23 13:03:05,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {39#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39#true} is VALID [2018-11-23 13:03:05,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2018-11-23 13:03:05,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #112#return; {39#true} is VALID [2018-11-23 13:03:05,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret15 := main(); {39#true} is VALID [2018-11-23 13:03:05,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {39#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {39#true} is VALID [2018-11-23 13:03:05,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {39#true} assume !true; {40#false} is VALID [2018-11-23 13:03:05,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {40#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {40#false} is VALID [2018-11-23 13:03:05,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 13:03:05,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {40#false} ~cont~0 := 0;~i~0 := 0; {40#false} is VALID [2018-11-23 13:03:05,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {40#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {40#false} is VALID [2018-11-23 13:03:05,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {40#false} ~i~0 := 0;~cont_aux~0 := 0; {40#false} is VALID [2018-11-23 13:03:05,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2018-11-23 13:03:05,320 INFO L256 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {40#false} is VALID [2018-11-23 13:03:05,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2018-11-23 13:03:05,321 INFO L273 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2018-11-23 13:03:05,321 INFO L273 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2018-11-23 13:03:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:05,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:05,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:05,332 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:03:05,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:05,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:03:05,426 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:05,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:05,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:05,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:05,437 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 13:03:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:05,729 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2018-11-23 13:03:05,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:05,729 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:03:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-23 13:03:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2018-11-23 13:03:05,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 91 transitions. [2018-11-23 13:03:06,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:06,037 INFO L225 Difference]: With dead ends: 64 [2018-11-23 13:03:06,037 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:03:06,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:03:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:03:06,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:06,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:06,084 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:06,084 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:06,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:06,095 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 13:03:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 13:03:06,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:06,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:06,097 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:06,097 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:06,101 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 13:03:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 13:03:06,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:06,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:06,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:06,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:06,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:03:06,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-23 13:03:06,107 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2018-11-23 13:03:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:06,108 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 13:03:06,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 13:03:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:03:06,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:06,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:06,110 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:06,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1455815888, now seen corresponding path program 1 times [2018-11-23 13:03:06,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:06,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:06,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:06,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:06,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:06,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-23 13:03:06,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {225#true} is VALID [2018-11-23 13:03:06,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-23 13:03:06,325 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #112#return; {225#true} is VALID [2018-11-23 13:03:06,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret15 := main(); {225#true} is VALID [2018-11-23 13:03:06,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {227#(= main_~i~0 0)} is VALID [2018-11-23 13:03:06,357 INFO L273 TraceCheckUtils]: 6: Hoare triple {227#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 10); {226#false} is VALID [2018-11-23 13:03:06,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {226#false} is VALID [2018-11-23 13:03:06,358 INFO L273 TraceCheckUtils]: 8: Hoare triple {226#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {226#false} is VALID [2018-11-23 13:03:06,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#false} assume !(0 != #t~mem2);havoc #t~mem2; {226#false} is VALID [2018-11-23 13:03:06,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#false} ~cont~0 := 0;~i~0 := 0; {226#false} is VALID [2018-11-23 13:03:06,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {226#false} is VALID [2018-11-23 13:03:06,359 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#false} ~i~0 := 0;~cont_aux~0 := 0; {226#false} is VALID [2018-11-23 13:03:06,359 INFO L273 TraceCheckUtils]: 13: Hoare triple {226#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {226#false} is VALID [2018-11-23 13:03:06,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#false} assume !(0 != #t~mem9);havoc #t~mem9; {226#false} is VALID [2018-11-23 13:03:06,360 INFO L256 TraceCheckUtils]: 15: Hoare triple {226#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {226#false} is VALID [2018-11-23 13:03:06,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2018-11-23 13:03:06,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {226#false} assume 0 == ~cond; {226#false} is VALID [2018-11-23 13:03:06,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-23 13:03:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:06,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:06,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:03:06,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 13:03:06,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:06,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:03:06,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:06,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:03:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:03:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:06,505 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 3 states. [2018-11-23 13:03:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:07,030 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2018-11-23 13:03:07,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:03:07,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 13:03:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-23 13:03:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:07,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-23 13:03:07,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2018-11-23 13:03:07,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:07,224 INFO L225 Difference]: With dead ends: 65 [2018-11-23 13:03:07,224 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:03:07,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:03:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2018-11-23 13:03:07,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:07,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 30 states. [2018-11-23 13:03:07,244 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 30 states. [2018-11-23 13:03:07,244 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 30 states. [2018-11-23 13:03:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:07,248 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2018-11-23 13:03:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2018-11-23 13:03:07,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:07,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:07,249 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 44 states. [2018-11-23 13:03:07,249 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 44 states. [2018-11-23 13:03:07,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:07,253 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2018-11-23 13:03:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2018-11-23 13:03:07,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:07,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:07,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:07,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:07,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:03:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 13:03:07,257 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 19 [2018-11-23 13:03:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:07,258 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 13:03:07,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:03:07,258 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 13:03:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:03:07,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:07,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:07,259 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:07,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:07,260 INFO L82 PathProgramCache]: Analyzing trace with hash -941161554, now seen corresponding path program 1 times [2018-11-23 13:03:07,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:07,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:07,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:07,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:07,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:07,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {451#true} call ULTIMATE.init(); {451#true} is VALID [2018-11-23 13:03:07,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {451#true} is VALID [2018-11-23 13:03:07,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {451#true} assume true; {451#true} is VALID [2018-11-23 13:03:07,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {451#true} {451#true} #112#return; {451#true} is VALID [2018-11-23 13:03:07,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {451#true} call #t~ret15 := main(); {451#true} is VALID [2018-11-23 13:03:07,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {451#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {453#(= main_~i~0 0)} is VALID [2018-11-23 13:03:07,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {453#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {453#(= main_~i~0 0)} is VALID [2018-11-23 13:03:07,483 INFO L273 TraceCheckUtils]: 7: Hoare triple {453#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {454#(and (<= main_~i~0 1) (< 0 (+ (div main_~i~0 4294967296) 1)))} is VALID [2018-11-23 13:03:07,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {454#(and (<= main_~i~0 1) (< 0 (+ (div main_~i~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < 10); {452#false} is VALID [2018-11-23 13:03:07,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {452#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {452#false} is VALID [2018-11-23 13:03:07,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {452#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {452#false} is VALID [2018-11-23 13:03:07,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {452#false} assume !(0 != #t~mem2);havoc #t~mem2; {452#false} is VALID [2018-11-23 13:03:07,486 INFO L273 TraceCheckUtils]: 12: Hoare triple {452#false} ~cont~0 := 0;~i~0 := 0; {452#false} is VALID [2018-11-23 13:03:07,486 INFO L273 TraceCheckUtils]: 13: Hoare triple {452#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {452#false} is VALID [2018-11-23 13:03:07,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {452#false} ~i~0 := 0;~cont_aux~0 := 0; {452#false} is VALID [2018-11-23 13:03:07,487 INFO L273 TraceCheckUtils]: 15: Hoare triple {452#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {452#false} is VALID [2018-11-23 13:03:07,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {452#false} assume !(0 != #t~mem9);havoc #t~mem9; {452#false} is VALID [2018-11-23 13:03:07,488 INFO L256 TraceCheckUtils]: 17: Hoare triple {452#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {452#false} is VALID [2018-11-23 13:03:07,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {452#false} ~cond := #in~cond; {452#false} is VALID [2018-11-23 13:03:07,489 INFO L273 TraceCheckUtils]: 19: Hoare triple {452#false} assume 0 == ~cond; {452#false} is VALID [2018-11-23 13:03:07,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {452#false} assume !false; {452#false} is VALID [2018-11-23 13:03:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:07,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:07,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:07,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:07,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:07,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {451#true} call ULTIMATE.init(); {451#true} is VALID [2018-11-23 13:03:07,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {451#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {451#true} is VALID [2018-11-23 13:03:07,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {451#true} assume true; {451#true} is VALID [2018-11-23 13:03:07,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {451#true} {451#true} #112#return; {451#true} is VALID [2018-11-23 13:03:07,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {451#true} call #t~ret15 := main(); {451#true} is VALID [2018-11-23 13:03:07,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {451#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {451#true} is VALID [2018-11-23 13:03:07,698 INFO L273 TraceCheckUtils]: 6: Hoare triple {451#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {451#true} is VALID [2018-11-23 13:03:07,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {451#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {451#true} is VALID [2018-11-23 13:03:07,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {451#true} assume !(~i~0 % 4294967296 < 10); {451#true} is VALID [2018-11-23 13:03:07,699 INFO L273 TraceCheckUtils]: 9: Hoare triple {451#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {451#true} is VALID [2018-11-23 13:03:07,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {451#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {451#true} is VALID [2018-11-23 13:03:07,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {451#true} assume !(0 != #t~mem2);havoc #t~mem2; {451#true} is VALID [2018-11-23 13:03:07,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {451#true} ~cont~0 := 0;~i~0 := 0; {494#(= main_~cont~0 0)} is VALID [2018-11-23 13:03:07,703 INFO L273 TraceCheckUtils]: 13: Hoare triple {494#(= main_~cont~0 0)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {494#(= main_~cont~0 0)} is VALID [2018-11-23 13:03:07,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {494#(= main_~cont~0 0)} ~i~0 := 0;~cont_aux~0 := 0; {501#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:03:07,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {501#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {501#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:03:07,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {501#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} assume !(0 != #t~mem9);havoc #t~mem9; {501#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:03:07,707 INFO L256 TraceCheckUtils]: 17: Hoare triple {501#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {511#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:07,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {511#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {515#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:03:07,715 INFO L273 TraceCheckUtils]: 19: Hoare triple {515#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {452#false} is VALID [2018-11-23 13:03:07,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {452#false} assume !false; {452#false} is VALID [2018-11-23 13:03:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:07,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:03:07,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-23 13:03:07,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 13:03:07,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:07,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:03:07,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:07,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:03:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:03:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:07,851 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 8 states. [2018-11-23 13:03:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:08,919 INFO L93 Difference]: Finished difference Result 137 states and 188 transitions. [2018-11-23 13:03:08,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:03:08,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-11-23 13:03:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 188 transitions. [2018-11-23 13:03:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 188 transitions. [2018-11-23 13:03:08,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 188 transitions. [2018-11-23 13:03:09,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:09,385 INFO L225 Difference]: With dead ends: 137 [2018-11-23 13:03:09,385 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 13:03:09,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 13:03:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 44. [2018-11-23 13:03:09,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:09,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 44 states. [2018-11-23 13:03:09,451 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 44 states. [2018-11-23 13:03:09,451 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 44 states. [2018-11-23 13:03:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:09,459 INFO L93 Difference]: Finished difference Result 111 states and 152 transitions. [2018-11-23 13:03:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 152 transitions. [2018-11-23 13:03:09,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:09,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:09,461 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 111 states. [2018-11-23 13:03:09,461 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 111 states. [2018-11-23 13:03:09,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:09,467 INFO L93 Difference]: Finished difference Result 111 states and 152 transitions. [2018-11-23 13:03:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 152 transitions. [2018-11-23 13:03:09,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:09,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:09,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:09,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:03:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2018-11-23 13:03:09,472 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 21 [2018-11-23 13:03:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:09,473 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2018-11-23 13:03:09,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:03:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-23 13:03:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:03:09,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:09,474 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:09,475 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:09,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:09,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2022961947, now seen corresponding path program 1 times [2018-11-23 13:03:09,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:09,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:09,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:09,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:09,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:09,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {1005#true} call ULTIMATE.init(); {1005#true} is VALID [2018-11-23 13:03:09,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {1005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1005#true} is VALID [2018-11-23 13:03:09,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {1005#true} assume true; {1005#true} is VALID [2018-11-23 13:03:09,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1005#true} {1005#true} #112#return; {1005#true} is VALID [2018-11-23 13:03:09,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {1005#true} call #t~ret15 := main(); {1005#true} is VALID [2018-11-23 13:03:09,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {1005#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1005#true} is VALID [2018-11-23 13:03:09,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {1005#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {1005#true} is VALID [2018-11-23 13:03:09,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {1005#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1005#true} is VALID [2018-11-23 13:03:09,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {1005#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {1005#true} is VALID [2018-11-23 13:03:09,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {1005#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1005#true} is VALID [2018-11-23 13:03:09,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {1005#true} assume !(~i~0 % 4294967296 < 10); {1005#true} is VALID [2018-11-23 13:03:09,712 INFO L273 TraceCheckUtils]: 11: Hoare triple {1005#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {1007#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:03:09,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {1007#(= main_~n_caracter~0 0)} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1007#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:03:09,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {1007#(= main_~n_caracter~0 0)} assume !(0 != #t~mem2);havoc #t~mem2; {1007#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:03:09,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {1007#(= main_~n_caracter~0 0)} ~cont~0 := 0;~i~0 := 0; {1007#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:03:09,716 INFO L273 TraceCheckUtils]: 15: Hoare triple {1007#(= main_~n_caracter~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {1006#false} is VALID [2018-11-23 13:03:09,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {1006#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1006#false} is VALID [2018-11-23 13:03:09,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {1006#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {1006#false} is VALID [2018-11-23 13:03:09,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {1006#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1006#false} is VALID [2018-11-23 13:03:09,717 INFO L273 TraceCheckUtils]: 19: Hoare triple {1006#false} assume !(~j~0 % 4294967296 < 8); {1006#false} is VALID [2018-11-23 13:03:09,717 INFO L273 TraceCheckUtils]: 20: Hoare triple {1006#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1006#false} is VALID [2018-11-23 13:03:09,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {1006#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1006#false} is VALID [2018-11-23 13:03:09,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {1006#false} ~i~0 := 0;~cont_aux~0 := 0; {1006#false} is VALID [2018-11-23 13:03:09,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {1006#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1006#false} is VALID [2018-11-23 13:03:09,718 INFO L273 TraceCheckUtils]: 24: Hoare triple {1006#false} assume !(0 != #t~mem9);havoc #t~mem9; {1006#false} is VALID [2018-11-23 13:03:09,719 INFO L256 TraceCheckUtils]: 25: Hoare triple {1006#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1006#false} is VALID [2018-11-23 13:03:09,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {1006#false} ~cond := #in~cond; {1006#false} is VALID [2018-11-23 13:03:09,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {1006#false} assume 0 == ~cond; {1006#false} is VALID [2018-11-23 13:03:09,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {1006#false} assume !false; {1006#false} is VALID [2018-11-23 13:03:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:03:09,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:09,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:03:09,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 13:03:09,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:09,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:03:09,759 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-23 13:03:09,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:03:09,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:03:09,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:09,761 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 3 states. [2018-11-23 13:03:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:09,892 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2018-11-23 13:03:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:03:09,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 13:03:09,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-23 13:03:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-23 13:03:09,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-23 13:03:10,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:10,032 INFO L225 Difference]: With dead ends: 91 [2018-11-23 13:03:10,033 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:03:10,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:10,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:03:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2018-11-23 13:03:10,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:10,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 48 states. [2018-11-23 13:03:10,116 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 48 states. [2018-11-23 13:03:10,116 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 48 states. [2018-11-23 13:03:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:10,121 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-23 13:03:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2018-11-23 13:03:10,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:10,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:10,122 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 62 states. [2018-11-23 13:03:10,122 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 62 states. [2018-11-23 13:03:10,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:10,125 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-23 13:03:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2018-11-23 13:03:10,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:10,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:10,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:10,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:10,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:03:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2018-11-23 13:03:10,129 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 29 [2018-11-23 13:03:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:10,129 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-11-23 13:03:10,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:03:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2018-11-23 13:03:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:03:10,130 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:10,130 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:10,131 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:10,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:10,131 INFO L82 PathProgramCache]: Analyzing trace with hash -410031266, now seen corresponding path program 1 times [2018-11-23 13:03:10,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:10,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:10,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:10,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:10,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:10,757 INFO L256 TraceCheckUtils]: 0: Hoare triple {1328#true} call ULTIMATE.init(); {1328#true} is VALID [2018-11-23 13:03:10,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {1328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1328#true} is VALID [2018-11-23 13:03:10,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {1328#true} assume true; {1328#true} is VALID [2018-11-23 13:03:10,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1328#true} {1328#true} #112#return; {1328#true} is VALID [2018-11-23 13:03:10,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {1328#true} call #t~ret15 := main(); {1328#true} is VALID [2018-11-23 13:03:10,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {1328#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1330#(= main_~i~0 0)} is VALID [2018-11-23 13:03:10,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {1330#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {1330#(= main_~i~0 0)} is VALID [2018-11-23 13:03:10,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {1330#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1331#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:10,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {1331#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {1331#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:10,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {1331#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1332#(and (<= main_~i~0 2) (< 0 (+ (div main_~i~0 4294967296) 1)))} is VALID [2018-11-23 13:03:10,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {1332#(and (<= main_~i~0 2) (< 0 (+ (div main_~i~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < 10); {1329#false} is VALID [2018-11-23 13:03:10,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {1329#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {1329#false} is VALID [2018-11-23 13:03:10,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {1329#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1329#false} is VALID [2018-11-23 13:03:10,765 INFO L273 TraceCheckUtils]: 13: Hoare triple {1329#false} assume !(0 != #t~mem2);havoc #t~mem2; {1329#false} is VALID [2018-11-23 13:03:10,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {1329#false} ~cont~0 := 0;~i~0 := 0; {1329#false} is VALID [2018-11-23 13:03:10,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {1329#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1329#false} is VALID [2018-11-23 13:03:10,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {1329#false} ~i~0 := 0;~cont_aux~0 := 0; {1329#false} is VALID [2018-11-23 13:03:10,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {1329#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1329#false} is VALID [2018-11-23 13:03:10,768 INFO L273 TraceCheckUtils]: 18: Hoare triple {1329#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {1329#false} is VALID [2018-11-23 13:03:10,768 INFO L273 TraceCheckUtils]: 19: Hoare triple {1329#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1329#false} is VALID [2018-11-23 13:03:10,768 INFO L273 TraceCheckUtils]: 20: Hoare triple {1329#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {1329#false} is VALID [2018-11-23 13:03:10,769 INFO L273 TraceCheckUtils]: 21: Hoare triple {1329#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {1329#false} is VALID [2018-11-23 13:03:10,769 INFO L273 TraceCheckUtils]: 22: Hoare triple {1329#false} assume !(~j~0 % 4294967296 < 10); {1329#false} is VALID [2018-11-23 13:03:10,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {1329#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1329#false} is VALID [2018-11-23 13:03:10,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {1329#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1329#false} is VALID [2018-11-23 13:03:10,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {1329#false} assume !(0 != #t~mem9);havoc #t~mem9; {1329#false} is VALID [2018-11-23 13:03:10,770 INFO L256 TraceCheckUtils]: 26: Hoare triple {1329#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1329#false} is VALID [2018-11-23 13:03:10,771 INFO L273 TraceCheckUtils]: 27: Hoare triple {1329#false} ~cond := #in~cond; {1329#false} is VALID [2018-11-23 13:03:10,771 INFO L273 TraceCheckUtils]: 28: Hoare triple {1329#false} assume 0 == ~cond; {1329#false} is VALID [2018-11-23 13:03:10,771 INFO L273 TraceCheckUtils]: 29: Hoare triple {1329#false} assume !false; {1329#false} is VALID [2018-11-23 13:03:10,773 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:03:10,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:10,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:10,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:10,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:10,963 INFO L256 TraceCheckUtils]: 0: Hoare triple {1328#true} call ULTIMATE.init(); {1328#true} is VALID [2018-11-23 13:03:10,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {1328#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1328#true} is VALID [2018-11-23 13:03:10,963 INFO L273 TraceCheckUtils]: 2: Hoare triple {1328#true} assume true; {1328#true} is VALID [2018-11-23 13:03:10,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1328#true} {1328#true} #112#return; {1328#true} is VALID [2018-11-23 13:03:10,964 INFO L256 TraceCheckUtils]: 4: Hoare triple {1328#true} call #t~ret15 := main(); {1328#true} is VALID [2018-11-23 13:03:10,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {1328#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1330#(= main_~i~0 0)} is VALID [2018-11-23 13:03:10,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {1330#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {1330#(= main_~i~0 0)} is VALID [2018-11-23 13:03:10,965 INFO L273 TraceCheckUtils]: 7: Hoare triple {1330#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1331#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:03:10,966 INFO L273 TraceCheckUtils]: 8: Hoare triple {1331#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {1328#true} is VALID [2018-11-23 13:03:10,966 INFO L273 TraceCheckUtils]: 9: Hoare triple {1328#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1328#true} is VALID [2018-11-23 13:03:10,966 INFO L273 TraceCheckUtils]: 10: Hoare triple {1328#true} assume !(~i~0 % 4294967296 < 10); {1328#true} is VALID [2018-11-23 13:03:10,966 INFO L273 TraceCheckUtils]: 11: Hoare triple {1328#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {1328#true} is VALID [2018-11-23 13:03:10,967 INFO L273 TraceCheckUtils]: 12: Hoare triple {1328#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1328#true} is VALID [2018-11-23 13:03:10,967 INFO L273 TraceCheckUtils]: 13: Hoare triple {1328#true} assume !(0 != #t~mem2);havoc #t~mem2; {1328#true} is VALID [2018-11-23 13:03:10,967 INFO L273 TraceCheckUtils]: 14: Hoare triple {1328#true} ~cont~0 := 0;~i~0 := 0; {1328#true} is VALID [2018-11-23 13:03:10,968 INFO L273 TraceCheckUtils]: 15: Hoare triple {1328#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1328#true} is VALID [2018-11-23 13:03:10,968 INFO L273 TraceCheckUtils]: 16: Hoare triple {1328#true} ~i~0 := 0;~cont_aux~0 := 0; {1328#true} is VALID [2018-11-23 13:03:10,968 INFO L273 TraceCheckUtils]: 17: Hoare triple {1328#true} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1328#true} is VALID [2018-11-23 13:03:10,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {1328#true} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {1390#(= main_~j~0 0)} is VALID [2018-11-23 13:03:10,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {1390#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1390#(= main_~j~0 0)} is VALID [2018-11-23 13:03:10,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {1390#(= main_~j~0 0)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {1390#(= main_~j~0 0)} is VALID [2018-11-23 13:03:10,977 INFO L273 TraceCheckUtils]: 21: Hoare triple {1390#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {1400#(= main_~j~0 1)} is VALID [2018-11-23 13:03:10,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {1400#(= main_~j~0 1)} assume !(~j~0 % 4294967296 < 10); {1329#false} is VALID [2018-11-23 13:03:10,979 INFO L273 TraceCheckUtils]: 23: Hoare triple {1329#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {1329#false} is VALID [2018-11-23 13:03:10,979 INFO L273 TraceCheckUtils]: 24: Hoare triple {1329#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1329#false} is VALID [2018-11-23 13:03:10,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {1329#false} assume !(0 != #t~mem9);havoc #t~mem9; {1329#false} is VALID [2018-11-23 13:03:10,980 INFO L256 TraceCheckUtils]: 26: Hoare triple {1329#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1329#false} is VALID [2018-11-23 13:03:10,980 INFO L273 TraceCheckUtils]: 27: Hoare triple {1329#false} ~cond := #in~cond; {1329#false} is VALID [2018-11-23 13:03:10,980 INFO L273 TraceCheckUtils]: 28: Hoare triple {1329#false} assume 0 == ~cond; {1329#false} is VALID [2018-11-23 13:03:10,980 INFO L273 TraceCheckUtils]: 29: Hoare triple {1329#false} assume !false; {1329#false} is VALID [2018-11-23 13:03:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:11,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:11,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2018-11-23 13:03:11,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 13:03:11,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:11,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:03:11,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:11,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:03:11,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:03:11,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:11,134 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 7 states. [2018-11-23 13:03:12,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:12,763 INFO L93 Difference]: Finished difference Result 255 states and 375 transitions. [2018-11-23 13:03:12,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:03:12,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-11-23 13:03:12,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:03:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 207 transitions. [2018-11-23 13:03:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:03:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 207 transitions. [2018-11-23 13:03:12,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 207 transitions. [2018-11-23 13:03:13,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:13,124 INFO L225 Difference]: With dead ends: 255 [2018-11-23 13:03:13,124 INFO L226 Difference]: Without dead ends: 218 [2018-11-23 13:03:13,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-23 13:03:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 66. [2018-11-23 13:03:13,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:13,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand 66 states. [2018-11-23 13:03:13,277 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 66 states. [2018-11-23 13:03:13,277 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 66 states. [2018-11-23 13:03:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:13,287 INFO L93 Difference]: Finished difference Result 218 states and 294 transitions. [2018-11-23 13:03:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 294 transitions. [2018-11-23 13:03:13,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:13,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:13,288 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 218 states. [2018-11-23 13:03:13,288 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 218 states. [2018-11-23 13:03:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:13,298 INFO L93 Difference]: Finished difference Result 218 states and 294 transitions. [2018-11-23 13:03:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 294 transitions. [2018-11-23 13:03:13,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:13,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:13,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:13,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:03:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2018-11-23 13:03:13,321 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 30 [2018-11-23 13:03:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:13,321 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2018-11-23 13:03:13,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:03:13,322 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2018-11-23 13:03:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:03:13,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:13,323 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:13,323 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:13,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:13,324 INFO L82 PathProgramCache]: Analyzing trace with hash -125440420, now seen corresponding path program 2 times [2018-11-23 13:03:13,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:13,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:13,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:14,066 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-11-23 13:03:14,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {2313#true} call ULTIMATE.init(); {2313#true} is VALID [2018-11-23 13:03:14,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {2313#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2313#true} is VALID [2018-11-23 13:03:14,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {2313#true} assume true; {2313#true} is VALID [2018-11-23 13:03:14,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2313#true} {2313#true} #112#return; {2313#true} is VALID [2018-11-23 13:03:14,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {2313#true} call #t~ret15 := main(); {2313#true} is VALID [2018-11-23 13:03:14,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {2313#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {2315#(= main_~i~0 0)} is VALID [2018-11-23 13:03:14,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {2315#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {2315#(= main_~i~0 0)} is VALID [2018-11-23 13:03:14,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {2315#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2316#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:03:14,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {2316#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {2316#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:03:14,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {2316#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2317#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:03:14,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {2317#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {2317#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:03:14,177 INFO L273 TraceCheckUtils]: 11: Hoare triple {2317#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2318#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 3))} is VALID [2018-11-23 13:03:14,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {2318#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 3))} assume !(~i~0 % 4294967296 < 10); {2314#false} is VALID [2018-11-23 13:03:14,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {2314#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {2314#false} is VALID [2018-11-23 13:03:14,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {2314#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2314#false} is VALID [2018-11-23 13:03:14,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {2314#false} assume !(0 != #t~mem2);havoc #t~mem2; {2314#false} is VALID [2018-11-23 13:03:14,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {2314#false} ~cont~0 := 0;~i~0 := 0; {2314#false} is VALID [2018-11-23 13:03:14,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {2314#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2314#false} is VALID [2018-11-23 13:03:14,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {2314#false} ~i~0 := 0;~cont_aux~0 := 0; {2314#false} is VALID [2018-11-23 13:03:14,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {2314#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2314#false} is VALID [2018-11-23 13:03:14,180 INFO L273 TraceCheckUtils]: 20: Hoare triple {2314#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {2314#false} is VALID [2018-11-23 13:03:14,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {2314#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2314#false} is VALID [2018-11-23 13:03:14,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {2314#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {2314#false} is VALID [2018-11-23 13:03:14,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {2314#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {2314#false} is VALID [2018-11-23 13:03:14,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {2314#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2314#false} is VALID [2018-11-23 13:03:14,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {2314#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {2314#false} is VALID [2018-11-23 13:03:14,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {2314#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {2314#false} is VALID [2018-11-23 13:03:14,183 INFO L273 TraceCheckUtils]: 27: Hoare triple {2314#false} assume !(~j~0 % 4294967296 < 10); {2314#false} is VALID [2018-11-23 13:03:14,183 INFO L273 TraceCheckUtils]: 28: Hoare triple {2314#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2314#false} is VALID [2018-11-23 13:03:14,183 INFO L273 TraceCheckUtils]: 29: Hoare triple {2314#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2314#false} is VALID [2018-11-23 13:03:14,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {2314#false} assume !(0 != #t~mem9);havoc #t~mem9; {2314#false} is VALID [2018-11-23 13:03:14,184 INFO L256 TraceCheckUtils]: 31: Hoare triple {2314#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2314#false} is VALID [2018-11-23 13:03:14,184 INFO L273 TraceCheckUtils]: 32: Hoare triple {2314#false} ~cond := #in~cond; {2314#false} is VALID [2018-11-23 13:03:14,185 INFO L273 TraceCheckUtils]: 33: Hoare triple {2314#false} assume 0 == ~cond; {2314#false} is VALID [2018-11-23 13:03:14,185 INFO L273 TraceCheckUtils]: 34: Hoare triple {2314#false} assume !false; {2314#false} is VALID [2018-11-23 13:03:14,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:03:14,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:14,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:14,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:14,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:14,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:14,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:14,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {2313#true} call ULTIMATE.init(); {2313#true} is VALID [2018-11-23 13:03:14,362 INFO L273 TraceCheckUtils]: 1: Hoare triple {2313#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2313#true} is VALID [2018-11-23 13:03:14,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {2313#true} assume true; {2313#true} is VALID [2018-11-23 13:03:14,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2313#true} {2313#true} #112#return; {2313#true} is VALID [2018-11-23 13:03:14,363 INFO L256 TraceCheckUtils]: 4: Hoare triple {2313#true} call #t~ret15 := main(); {2313#true} is VALID [2018-11-23 13:03:14,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {2313#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {2315#(= main_~i~0 0)} is VALID [2018-11-23 13:03:14,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {2315#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {2315#(= main_~i~0 0)} is VALID [2018-11-23 13:03:14,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {2315#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2343#(= main_~i~0 1)} is VALID [2018-11-23 13:03:14,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {2343#(= main_~i~0 1)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {2343#(= main_~i~0 1)} is VALID [2018-11-23 13:03:14,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {2343#(= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2350#(= main_~i~0 2)} is VALID [2018-11-23 13:03:14,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {2350#(= main_~i~0 2)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {2313#true} is VALID [2018-11-23 13:03:14,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {2313#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2313#true} is VALID [2018-11-23 13:03:14,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {2313#true} assume !(~i~0 % 4294967296 < 10); {2313#true} is VALID [2018-11-23 13:03:14,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {2313#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {2313#true} is VALID [2018-11-23 13:03:14,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {2313#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2313#true} is VALID [2018-11-23 13:03:14,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {2313#true} assume !(0 != #t~mem2);havoc #t~mem2; {2313#true} is VALID [2018-11-23 13:03:14,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {2313#true} ~cont~0 := 0;~i~0 := 0; {2313#true} is VALID [2018-11-23 13:03:14,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {2313#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2313#true} is VALID [2018-11-23 13:03:14,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {2313#true} ~i~0 := 0;~cont_aux~0 := 0; {2313#true} is VALID [2018-11-23 13:03:14,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {2313#true} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2313#true} is VALID [2018-11-23 13:03:14,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {2313#true} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {2384#(= main_~j~0 0)} is VALID [2018-11-23 13:03:14,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {2384#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2384#(= main_~j~0 0)} is VALID [2018-11-23 13:03:14,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {2384#(= main_~j~0 0)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {2384#(= main_~j~0 0)} is VALID [2018-11-23 13:03:14,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {2384#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {2394#(= main_~j~0 1)} is VALID [2018-11-23 13:03:14,375 INFO L273 TraceCheckUtils]: 24: Hoare triple {2394#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2394#(= main_~j~0 1)} is VALID [2018-11-23 13:03:14,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {2394#(= main_~j~0 1)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {2394#(= main_~j~0 1)} is VALID [2018-11-23 13:03:14,376 INFO L273 TraceCheckUtils]: 26: Hoare triple {2394#(= main_~j~0 1)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {2404#(= main_~j~0 2)} is VALID [2018-11-23 13:03:14,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {2404#(= main_~j~0 2)} assume !(~j~0 % 4294967296 < 10); {2314#false} is VALID [2018-11-23 13:03:14,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {2314#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {2314#false} is VALID [2018-11-23 13:03:14,381 INFO L273 TraceCheckUtils]: 29: Hoare triple {2314#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2314#false} is VALID [2018-11-23 13:03:14,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {2314#false} assume !(0 != #t~mem9);havoc #t~mem9; {2314#false} is VALID [2018-11-23 13:03:14,381 INFO L256 TraceCheckUtils]: 31: Hoare triple {2314#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2314#false} is VALID [2018-11-23 13:03:14,381 INFO L273 TraceCheckUtils]: 32: Hoare triple {2314#false} ~cond := #in~cond; {2314#false} is VALID [2018-11-23 13:03:14,381 INFO L273 TraceCheckUtils]: 33: Hoare triple {2314#false} assume 0 == ~cond; {2314#false} is VALID [2018-11-23 13:03:14,382 INFO L273 TraceCheckUtils]: 34: Hoare triple {2314#false} assume !false; {2314#false} is VALID [2018-11-23 13:03:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:14,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:14,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 11 [2018-11-23 13:03:14,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-23 13:03:14,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:14,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 13:03:14,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:14,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 13:03:14,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:03:14,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:14,471 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand 11 states. [2018-11-23 13:03:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,846 INFO L93 Difference]: Finished difference Result 382 states and 534 transitions. [2018-11-23 13:03:16,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:03:16,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-11-23 13:03:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 278 transitions. [2018-11-23 13:03:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:03:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 278 transitions. [2018-11-23 13:03:16,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 278 transitions. [2018-11-23 13:03:17,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:17,247 INFO L225 Difference]: With dead ends: 382 [2018-11-23 13:03:17,248 INFO L226 Difference]: Without dead ends: 329 [2018-11-23 13:03:17,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:03:17,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-23 13:03:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 80. [2018-11-23 13:03:17,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:17,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 329 states. Second operand 80 states. [2018-11-23 13:03:17,393 INFO L74 IsIncluded]: Start isIncluded. First operand 329 states. Second operand 80 states. [2018-11-23 13:03:17,393 INFO L87 Difference]: Start difference. First operand 329 states. Second operand 80 states. [2018-11-23 13:03:17,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:17,406 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2018-11-23 13:03:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 444 transitions. [2018-11-23 13:03:17,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:17,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:17,407 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 329 states. [2018-11-23 13:03:17,407 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 329 states. [2018-11-23 13:03:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:17,421 INFO L93 Difference]: Finished difference Result 329 states and 444 transitions. [2018-11-23 13:03:17,421 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 444 transitions. [2018-11-23 13:03:17,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:17,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:17,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:17,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:03:17,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2018-11-23 13:03:17,426 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 35 [2018-11-23 13:03:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:17,427 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2018-11-23 13:03:17,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 13:03:17,427 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2018-11-23 13:03:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:03:17,428 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:17,428 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:17,428 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:17,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1110173534, now seen corresponding path program 3 times [2018-11-23 13:03:17,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:17,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:17,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:17,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {3743#true} call ULTIMATE.init(); {3743#true} is VALID [2018-11-23 13:03:17,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {3743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3743#true} is VALID [2018-11-23 13:03:17,899 INFO L273 TraceCheckUtils]: 2: Hoare triple {3743#true} assume true; {3743#true} is VALID [2018-11-23 13:03:17,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3743#true} {3743#true} #112#return; {3743#true} is VALID [2018-11-23 13:03:17,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {3743#true} call #t~ret15 := main(); {3743#true} is VALID [2018-11-23 13:03:17,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {3743#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {3745#(= main_~i~0 0)} is VALID [2018-11-23 13:03:17,900 INFO L273 TraceCheckUtils]: 6: Hoare triple {3745#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {3745#(= main_~i~0 0)} is VALID [2018-11-23 13:03:17,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {3745#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3746#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:03:17,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {3746#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {3746#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:03:17,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {3746#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3747#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:03:17,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {3747#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {3747#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:03:17,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {3747#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3748#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:03:17,906 INFO L273 TraceCheckUtils]: 12: Hoare triple {3748#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {3748#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:03:17,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {3748#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3749#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 4))} is VALID [2018-11-23 13:03:17,909 INFO L273 TraceCheckUtils]: 14: Hoare triple {3749#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 4))} assume !(~i~0 % 4294967296 < 10); {3744#false} is VALID [2018-11-23 13:03:17,909 INFO L273 TraceCheckUtils]: 15: Hoare triple {3744#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {3744#false} is VALID [2018-11-23 13:03:17,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {3744#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:17,910 INFO L273 TraceCheckUtils]: 17: Hoare triple {3744#false} assume !(0 != #t~mem2);havoc #t~mem2; {3744#false} is VALID [2018-11-23 13:03:17,910 INFO L273 TraceCheckUtils]: 18: Hoare triple {3744#false} ~cont~0 := 0;~i~0 := 0; {3744#false} is VALID [2018-11-23 13:03:17,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {3744#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3744#false} is VALID [2018-11-23 13:03:17,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {3744#false} ~i~0 := 0;~cont_aux~0 := 0; {3744#false} is VALID [2018-11-23 13:03:17,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {3744#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:17,911 INFO L273 TraceCheckUtils]: 22: Hoare triple {3744#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {3744#false} is VALID [2018-11-23 13:03:17,911 INFO L273 TraceCheckUtils]: 23: Hoare triple {3744#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:17,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {3744#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {3744#false} is VALID [2018-11-23 13:03:17,912 INFO L273 TraceCheckUtils]: 25: Hoare triple {3744#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3744#false} is VALID [2018-11-23 13:03:17,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {3744#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:17,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {3744#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {3744#false} is VALID [2018-11-23 13:03:17,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {3744#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3744#false} is VALID [2018-11-23 13:03:17,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {3744#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:17,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {3744#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {3744#false} is VALID [2018-11-23 13:03:17,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {3744#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3744#false} is VALID [2018-11-23 13:03:17,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {3744#false} assume !(~j~0 % 4294967296 < 10); {3744#false} is VALID [2018-11-23 13:03:17,913 INFO L273 TraceCheckUtils]: 33: Hoare triple {3744#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3744#false} is VALID [2018-11-23 13:03:17,913 INFO L273 TraceCheckUtils]: 34: Hoare triple {3744#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:17,913 INFO L273 TraceCheckUtils]: 35: Hoare triple {3744#false} assume !(0 != #t~mem9);havoc #t~mem9; {3744#false} is VALID [2018-11-23 13:03:17,913 INFO L256 TraceCheckUtils]: 36: Hoare triple {3744#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3744#false} is VALID [2018-11-23 13:03:17,913 INFO L273 TraceCheckUtils]: 37: Hoare triple {3744#false} ~cond := #in~cond; {3744#false} is VALID [2018-11-23 13:03:17,914 INFO L273 TraceCheckUtils]: 38: Hoare triple {3744#false} assume 0 == ~cond; {3744#false} is VALID [2018-11-23 13:03:17,914 INFO L273 TraceCheckUtils]: 39: Hoare triple {3744#false} assume !false; {3744#false} is VALID [2018-11-23 13:03:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 13:03:17,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:17,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:17,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:03:17,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:03:17,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:18,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:18,571 INFO L478 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 15 treesize of output 11 [2018-11-23 13:03:18,634 INFO L478 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 11 treesize of output 3 [2018-11-23 13:03:18,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:18,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:18,679 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-23 13:03:18,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 13:03:18,681 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:18,681 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#string_entrada~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#string_entrada~0.base|) 0))) (and (= .cse0 0) (= .cse0 |main_#t~mem9|))) [2018-11-23 13:03:18,682 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |main_#t~mem9|) [2018-11-23 13:03:18,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {3743#true} call ULTIMATE.init(); {3743#true} is VALID [2018-11-23 13:03:18,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {3743#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3743#true} is VALID [2018-11-23 13:03:18,736 INFO L273 TraceCheckUtils]: 2: Hoare triple {3743#true} assume true; {3743#true} is VALID [2018-11-23 13:03:18,736 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3743#true} {3743#true} #112#return; {3743#true} is VALID [2018-11-23 13:03:18,736 INFO L256 TraceCheckUtils]: 4: Hoare triple {3743#true} call #t~ret15 := main(); {3743#true} is VALID [2018-11-23 13:03:18,738 INFO L273 TraceCheckUtils]: 5: Hoare triple {3743#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {3768#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:03:18,739 INFO L273 TraceCheckUtils]: 6: Hoare triple {3768#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {3772#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:18,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {3772#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:18,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {3772#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {3772#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:18,761 INFO L273 TraceCheckUtils]: 9: Hoare triple {3772#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:18,770 INFO L273 TraceCheckUtils]: 10: Hoare triple {3772#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {3772#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:18,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {3772#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:18,793 INFO L273 TraceCheckUtils]: 12: Hoare triple {3772#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {3772#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:18,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {3772#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3772#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:18,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {3772#(= 0 |main_~#string_entrada~0.offset|)} assume !(~i~0 % 4294967296 < 10); {3772#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:18,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {3772#(= 0 |main_~#string_entrada~0.offset|)} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {3800#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~n_caracter~0 0))} is VALID [2018-11-23 13:03:18,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {3800#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~n_caracter~0 0))} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3804#(and (= 0 |main_~#string_entrada~0.offset|) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|) |main_#t~mem2|))} is VALID [2018-11-23 13:03:18,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {3804#(and (= 0 |main_~#string_entrada~0.offset|) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|) |main_#t~mem2|))} assume !(0 != #t~mem2);havoc #t~mem2; {3808#(and (= 0 |main_~#string_entrada~0.offset|) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|)))} is VALID [2018-11-23 13:03:18,845 INFO L273 TraceCheckUtils]: 18: Hoare triple {3808#(and (= 0 |main_~#string_entrada~0.offset|) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|)))} ~cont~0 := 0;~i~0 := 0; {3808#(and (= 0 |main_~#string_entrada~0.offset|) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|)))} is VALID [2018-11-23 13:03:18,846 INFO L273 TraceCheckUtils]: 19: Hoare triple {3808#(and (= 0 |main_~#string_entrada~0.offset|) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3808#(and (= 0 |main_~#string_entrada~0.offset|) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|)))} is VALID [2018-11-23 13:03:18,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {3808#(and (= 0 |main_~#string_entrada~0.offset|) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|)))} ~i~0 := 0;~cont_aux~0 := 0; {3818#(and (= 0 |main_~#string_entrada~0.offset|) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|)) (= main_~i~0 0))} is VALID [2018-11-23 13:03:18,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {3818#(and (= 0 |main_~#string_entrada~0.offset|) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|)) (= main_~i~0 0))} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3822#(= 0 |main_#t~mem9|)} is VALID [2018-11-23 13:03:18,851 INFO L273 TraceCheckUtils]: 22: Hoare triple {3822#(= 0 |main_#t~mem9|)} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {3744#false} is VALID [2018-11-23 13:03:18,851 INFO L273 TraceCheckUtils]: 23: Hoare triple {3744#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:18,851 INFO L273 TraceCheckUtils]: 24: Hoare triple {3744#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {3744#false} is VALID [2018-11-23 13:03:18,851 INFO L273 TraceCheckUtils]: 25: Hoare triple {3744#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3744#false} is VALID [2018-11-23 13:03:18,851 INFO L273 TraceCheckUtils]: 26: Hoare triple {3744#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:18,852 INFO L273 TraceCheckUtils]: 27: Hoare triple {3744#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {3744#false} is VALID [2018-11-23 13:03:18,852 INFO L273 TraceCheckUtils]: 28: Hoare triple {3744#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3744#false} is VALID [2018-11-23 13:03:18,852 INFO L273 TraceCheckUtils]: 29: Hoare triple {3744#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:18,852 INFO L273 TraceCheckUtils]: 30: Hoare triple {3744#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {3744#false} is VALID [2018-11-23 13:03:18,852 INFO L273 TraceCheckUtils]: 31: Hoare triple {3744#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {3744#false} is VALID [2018-11-23 13:03:18,852 INFO L273 TraceCheckUtils]: 32: Hoare triple {3744#false} assume !(~j~0 % 4294967296 < 10); {3744#false} is VALID [2018-11-23 13:03:18,853 INFO L273 TraceCheckUtils]: 33: Hoare triple {3744#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {3744#false} is VALID [2018-11-23 13:03:18,853 INFO L273 TraceCheckUtils]: 34: Hoare triple {3744#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3744#false} is VALID [2018-11-23 13:03:18,853 INFO L273 TraceCheckUtils]: 35: Hoare triple {3744#false} assume !(0 != #t~mem9);havoc #t~mem9; {3744#false} is VALID [2018-11-23 13:03:18,853 INFO L256 TraceCheckUtils]: 36: Hoare triple {3744#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3744#false} is VALID [2018-11-23 13:03:18,854 INFO L273 TraceCheckUtils]: 37: Hoare triple {3744#false} ~cond := #in~cond; {3744#false} is VALID [2018-11-23 13:03:18,854 INFO L273 TraceCheckUtils]: 38: Hoare triple {3744#false} assume 0 == ~cond; {3744#false} is VALID [2018-11-23 13:03:18,854 INFO L273 TraceCheckUtils]: 39: Hoare triple {3744#false} assume !false; {3744#false} is VALID [2018-11-23 13:03:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 13:03:18,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:18,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-11-23 13:03:18,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-23 13:03:18,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:18,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:03:18,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:18,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:03:18,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:03:18,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:03:18,940 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand 14 states. [2018-11-23 13:03:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:23,053 INFO L93 Difference]: Finished difference Result 412 states and 547 transitions. [2018-11-23 13:03:23,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:03:23,054 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2018-11-23 13:03:23,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:03:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2018-11-23 13:03:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:03:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2018-11-23 13:03:23,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2018-11-23 13:03:23,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:23,535 INFO L225 Difference]: With dead ends: 412 [2018-11-23 13:03:23,536 INFO L226 Difference]: Without dead ends: 342 [2018-11-23 13:03:23,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:03:23,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-11-23 13:03:24,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 80. [2018-11-23 13:03:24,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:24,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand 80 states. [2018-11-23 13:03:24,003 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand 80 states. [2018-11-23 13:03:24,004 INFO L87 Difference]: Start difference. First operand 342 states. Second operand 80 states. [2018-11-23 13:03:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:24,018 INFO L93 Difference]: Finished difference Result 342 states and 455 transitions. [2018-11-23 13:03:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 455 transitions. [2018-11-23 13:03:24,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:24,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:24,019 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 342 states. [2018-11-23 13:03:24,019 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 342 states. [2018-11-23 13:03:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:24,033 INFO L93 Difference]: Finished difference Result 342 states and 455 transitions. [2018-11-23 13:03:24,033 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 455 transitions. [2018-11-23 13:03:24,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:24,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:24,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:24,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:24,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-23 13:03:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2018-11-23 13:03:24,037 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 40 [2018-11-23 13:03:24,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:24,038 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2018-11-23 13:03:24,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:03:24,038 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2018-11-23 13:03:24,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:03:24,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:24,039 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:24,039 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:24,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:24,040 INFO L82 PathProgramCache]: Analyzing trace with hash -691414726, now seen corresponding path program 1 times [2018-11-23 13:03:24,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:24,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:24,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:24,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:24,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:24,576 INFO L256 TraceCheckUtils]: 0: Hoare triple {5266#true} call ULTIMATE.init(); {5266#true} is VALID [2018-11-23 13:03:24,576 INFO L273 TraceCheckUtils]: 1: Hoare triple {5266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5266#true} is VALID [2018-11-23 13:03:24,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {5266#true} assume true; {5266#true} is VALID [2018-11-23 13:03:24,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5266#true} {5266#true} #112#return; {5266#true} is VALID [2018-11-23 13:03:24,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {5266#true} call #t~ret15 := main(); {5266#true} is VALID [2018-11-23 13:03:24,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {5266#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5268#(= main_~i~0 0)} is VALID [2018-11-23 13:03:24,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {5268#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5268#(= main_~i~0 0)} is VALID [2018-11-23 13:03:24,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {5268#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5269#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:03:24,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {5269#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5269#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:03:24,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {5269#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5270#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:03:24,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {5270#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5270#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:03:24,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {5270#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5271#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:03:24,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {5271#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5271#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:03:24,584 INFO L273 TraceCheckUtils]: 13: Hoare triple {5271#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5272#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:03:24,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {5272#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5272#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:03:24,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {5272#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5273#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 5))} is VALID [2018-11-23 13:03:24,587 INFO L273 TraceCheckUtils]: 16: Hoare triple {5273#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 5))} assume !(~i~0 % 4294967296 < 10); {5267#false} is VALID [2018-11-23 13:03:24,588 INFO L273 TraceCheckUtils]: 17: Hoare triple {5267#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {5267#false} is VALID [2018-11-23 13:03:24,588 INFO L273 TraceCheckUtils]: 18: Hoare triple {5267#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5267#false} is VALID [2018-11-23 13:03:24,588 INFO L273 TraceCheckUtils]: 19: Hoare triple {5267#false} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {5267#false} is VALID [2018-11-23 13:03:24,588 INFO L273 TraceCheckUtils]: 20: Hoare triple {5267#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5267#false} is VALID [2018-11-23 13:03:24,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {5267#false} assume !(0 != #t~mem2);havoc #t~mem2; {5267#false} is VALID [2018-11-23 13:03:24,588 INFO L273 TraceCheckUtils]: 22: Hoare triple {5267#false} ~cont~0 := 0;~i~0 := 0; {5267#false} is VALID [2018-11-23 13:03:24,589 INFO L273 TraceCheckUtils]: 23: Hoare triple {5267#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {5267#false} is VALID [2018-11-23 13:03:24,589 INFO L273 TraceCheckUtils]: 24: Hoare triple {5267#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5267#false} is VALID [2018-11-23 13:03:24,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {5267#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {5267#false} is VALID [2018-11-23 13:03:24,589 INFO L273 TraceCheckUtils]: 26: Hoare triple {5267#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5267#false} is VALID [2018-11-23 13:03:24,589 INFO L273 TraceCheckUtils]: 27: Hoare triple {5267#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5267#false} is VALID [2018-11-23 13:03:24,589 INFO L273 TraceCheckUtils]: 28: Hoare triple {5267#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {5267#false} is VALID [2018-11-23 13:03:24,590 INFO L273 TraceCheckUtils]: 29: Hoare triple {5267#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5267#false} is VALID [2018-11-23 13:03:24,590 INFO L273 TraceCheckUtils]: 30: Hoare triple {5267#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5267#false} is VALID [2018-11-23 13:03:24,590 INFO L273 TraceCheckUtils]: 31: Hoare triple {5267#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {5267#false} is VALID [2018-11-23 13:03:24,590 INFO L273 TraceCheckUtils]: 32: Hoare triple {5267#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5267#false} is VALID [2018-11-23 13:03:24,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {5267#false} assume !(~j~0 % 4294967296 < 8); {5267#false} is VALID [2018-11-23 13:03:24,595 INFO L273 TraceCheckUtils]: 34: Hoare triple {5267#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5267#false} is VALID [2018-11-23 13:03:24,596 INFO L273 TraceCheckUtils]: 35: Hoare triple {5267#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5267#false} is VALID [2018-11-23 13:03:24,596 INFO L273 TraceCheckUtils]: 36: Hoare triple {5267#false} ~i~0 := 0;~cont_aux~0 := 0; {5267#false} is VALID [2018-11-23 13:03:24,596 INFO L273 TraceCheckUtils]: 37: Hoare triple {5267#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5267#false} is VALID [2018-11-23 13:03:24,596 INFO L273 TraceCheckUtils]: 38: Hoare triple {5267#false} assume !(0 != #t~mem9);havoc #t~mem9; {5267#false} is VALID [2018-11-23 13:03:24,596 INFO L256 TraceCheckUtils]: 39: Hoare triple {5267#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5267#false} is VALID [2018-11-23 13:03:24,596 INFO L273 TraceCheckUtils]: 40: Hoare triple {5267#false} ~cond := #in~cond; {5267#false} is VALID [2018-11-23 13:03:24,596 INFO L273 TraceCheckUtils]: 41: Hoare triple {5267#false} assume 0 == ~cond; {5267#false} is VALID [2018-11-23 13:03:24,597 INFO L273 TraceCheckUtils]: 42: Hoare triple {5267#false} assume !false; {5267#false} is VALID [2018-11-23 13:03:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 13:03:24,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:24,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:24,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:24,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:24,863 INFO L478 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 12 [2018-11-23 13:03:24,867 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 13:03:24,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:24,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:24,875 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-23 13:03:24,875 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 13:03:24,877 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:24,877 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#string_entrada~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#string_entrada~0.base|) 0))) (and (not (= .cse0 0)) (= .cse0 |main_#t~mem9|))) [2018-11-23 13:03:24,877 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= 0 |main_#t~mem9|)) [2018-11-23 13:03:24,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {5266#true} call ULTIMATE.init(); {5266#true} is VALID [2018-11-23 13:03:24,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {5266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5266#true} is VALID [2018-11-23 13:03:24,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {5266#true} assume true; {5266#true} is VALID [2018-11-23 13:03:24,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5266#true} {5266#true} #112#return; {5266#true} is VALID [2018-11-23 13:03:24,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {5266#true} call #t~ret15 := main(); {5266#true} is VALID [2018-11-23 13:03:24,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {5266#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5292#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:03:24,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {5292#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,904 INFO L273 TraceCheckUtils]: 7: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,904 INFO L273 TraceCheckUtils]: 8: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,904 INFO L273 TraceCheckUtils]: 9: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,905 INFO L273 TraceCheckUtils]: 10: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,905 INFO L273 TraceCheckUtils]: 11: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,905 INFO L273 TraceCheckUtils]: 12: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,906 INFO L273 TraceCheckUtils]: 14: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} assume !(~i~0 % 4294967296 < 10); {5296#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:03:24,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {5296#(= 0 |main_~#string_entrada~0.offset|)} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {5330#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~n_caracter~0 0))} is VALID [2018-11-23 13:03:24,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {5330#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~n_caracter~0 0))} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5334#(and (= 0 |main_~#string_entrada~0.offset|) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|) |main_#t~mem2|))} is VALID [2018-11-23 13:03:24,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {5334#(and (= 0 |main_~#string_entrada~0.offset|) (= (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|) |main_#t~mem2|))} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume !(0 != #t~mem2);havoc #t~mem2; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,915 INFO L273 TraceCheckUtils]: 22: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} ~cont~0 := 0;~i~0 := 0; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,918 INFO L273 TraceCheckUtils]: 23: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,923 INFO L273 TraceCheckUtils]: 27: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,925 INFO L273 TraceCheckUtils]: 30: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,926 INFO L273 TraceCheckUtils]: 32: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume !(~j~0 % 4294967296 < 8); {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,927 INFO L273 TraceCheckUtils]: 34: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,927 INFO L273 TraceCheckUtils]: 35: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} is VALID [2018-11-23 13:03:24,928 INFO L273 TraceCheckUtils]: 36: Hoare triple {5338#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))))} ~i~0 := 0;~cont_aux~0 := 0; {5390#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 13:03:24,931 INFO L273 TraceCheckUtils]: 37: Hoare triple {5390#(and (= 0 |main_~#string_entrada~0.offset|) (not (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|))) (= main_~i~0 0))} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5394#(not (= 0 |main_#t~mem9|))} is VALID [2018-11-23 13:03:24,931 INFO L273 TraceCheckUtils]: 38: Hoare triple {5394#(not (= 0 |main_#t~mem9|))} assume !(0 != #t~mem9);havoc #t~mem9; {5267#false} is VALID [2018-11-23 13:03:24,931 INFO L256 TraceCheckUtils]: 39: Hoare triple {5267#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5267#false} is VALID [2018-11-23 13:03:24,932 INFO L273 TraceCheckUtils]: 40: Hoare triple {5267#false} ~cond := #in~cond; {5267#false} is VALID [2018-11-23 13:03:24,932 INFO L273 TraceCheckUtils]: 41: Hoare triple {5267#false} assume 0 == ~cond; {5267#false} is VALID [2018-11-23 13:03:24,932 INFO L273 TraceCheckUtils]: 42: Hoare triple {5267#false} assume !false; {5267#false} is VALID [2018-11-23 13:03:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 13:03:24,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:24,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2018-11-23 13:03:24,956 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-11-23 13:03:24,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:24,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:03:25,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:25,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:03:25,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:03:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:03:25,051 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 15 states. [2018-11-23 13:03:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:30,746 INFO L93 Difference]: Finished difference Result 459 states and 611 transitions. [2018-11-23 13:03:30,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:03:30,746 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-11-23 13:03:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:30,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2018-11-23 13:03:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:30,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 191 transitions. [2018-11-23 13:03:30,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 191 transitions. [2018-11-23 13:03:31,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:31,154 INFO L225 Difference]: With dead ends: 459 [2018-11-23 13:03:31,154 INFO L226 Difference]: Without dead ends: 396 [2018-11-23 13:03:31,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:03:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-23 13:03:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 84. [2018-11-23 13:03:31,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:31,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand 84 states. [2018-11-23 13:03:31,701 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand 84 states. [2018-11-23 13:03:31,701 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 84 states. [2018-11-23 13:03:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:31,715 INFO L93 Difference]: Finished difference Result 396 states and 527 transitions. [2018-11-23 13:03:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 527 transitions. [2018-11-23 13:03:31,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:31,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:31,717 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 396 states. [2018-11-23 13:03:31,717 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 396 states. [2018-11-23 13:03:31,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:31,730 INFO L93 Difference]: Finished difference Result 396 states and 527 transitions. [2018-11-23 13:03:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 527 transitions. [2018-11-23 13:03:31,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:31,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:31,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:31,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:31,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 13:03:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2018-11-23 13:03:31,734 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 43 [2018-11-23 13:03:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:31,735 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2018-11-23 13:03:31,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:03:31,735 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2018-11-23 13:03:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:03:31,736 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:31,736 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:31,736 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:31,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:31,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1877801557, now seen corresponding path program 1 times [2018-11-23 13:03:31,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:31,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:31,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:31,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:31,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,221 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-23 13:03:32,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {6986#true} call ULTIMATE.init(); {6986#true} is VALID [2018-11-23 13:03:32,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {6986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6986#true} is VALID [2018-11-23 13:03:32,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {6986#true} assume true; {6986#true} is VALID [2018-11-23 13:03:32,260 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6986#true} {6986#true} #112#return; {6986#true} is VALID [2018-11-23 13:03:32,260 INFO L256 TraceCheckUtils]: 4: Hoare triple {6986#true} call #t~ret15 := main(); {6986#true} is VALID [2018-11-23 13:03:32,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {6986#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {6986#true} is VALID [2018-11-23 13:03:32,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {6986#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {6986#true} is VALID [2018-11-23 13:03:32,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {6986#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#true} is VALID [2018-11-23 13:03:32,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {6986#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {6986#true} is VALID [2018-11-23 13:03:32,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {6986#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#true} is VALID [2018-11-23 13:03:32,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {6986#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {6986#true} is VALID [2018-11-23 13:03:32,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {6986#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#true} is VALID [2018-11-23 13:03:32,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {6986#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {6986#true} is VALID [2018-11-23 13:03:32,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {6986#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#true} is VALID [2018-11-23 13:03:32,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {6986#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {6986#true} is VALID [2018-11-23 13:03:32,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {6986#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#true} is VALID [2018-11-23 13:03:32,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {6986#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {6986#true} is VALID [2018-11-23 13:03:32,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {6986#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#true} is VALID [2018-11-23 13:03:32,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {6986#true} assume !(~i~0 % 4294967296 < 10); {6986#true} is VALID [2018-11-23 13:03:32,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {6986#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {6988#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:03:32,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {6988#(= main_~n_caracter~0 0)} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {6988#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:03:32,278 INFO L273 TraceCheckUtils]: 21: Hoare triple {6988#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {6989#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:03:32,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {6989#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {6989#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:03:32,280 INFO L273 TraceCheckUtils]: 23: Hoare triple {6989#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} assume !(0 != #t~mem2);havoc #t~mem2; {6989#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:03:32,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {6989#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} ~cont~0 := 0;~i~0 := 0; {6990#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:32,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {6990#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {6987#false} is VALID [2018-11-23 13:03:32,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {6987#false} ~i~0 := 0;~cont_aux~0 := 0; {6987#false} is VALID [2018-11-23 13:03:32,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {6987#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6987#false} is VALID [2018-11-23 13:03:32,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {6987#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {6987#false} is VALID [2018-11-23 13:03:32,283 INFO L273 TraceCheckUtils]: 29: Hoare triple {6987#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {6987#false} is VALID [2018-11-23 13:03:32,283 INFO L273 TraceCheckUtils]: 30: Hoare triple {6987#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {6987#false} is VALID [2018-11-23 13:03:32,283 INFO L273 TraceCheckUtils]: 31: Hoare triple {6987#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {6987#false} is VALID [2018-11-23 13:03:32,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {6987#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {6987#false} is VALID [2018-11-23 13:03:32,284 INFO L273 TraceCheckUtils]: 33: Hoare triple {6987#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {6987#false} is VALID [2018-11-23 13:03:32,284 INFO L273 TraceCheckUtils]: 34: Hoare triple {6987#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {6987#false} is VALID [2018-11-23 13:03:32,284 INFO L273 TraceCheckUtils]: 35: Hoare triple {6987#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {6987#false} is VALID [2018-11-23 13:03:32,285 INFO L273 TraceCheckUtils]: 36: Hoare triple {6987#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {6987#false} is VALID [2018-11-23 13:03:32,285 INFO L273 TraceCheckUtils]: 37: Hoare triple {6987#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {6987#false} is VALID [2018-11-23 13:03:32,285 INFO L273 TraceCheckUtils]: 38: Hoare triple {6987#false} assume !(~j~0 % 4294967296 < 10); {6987#false} is VALID [2018-11-23 13:03:32,285 INFO L273 TraceCheckUtils]: 39: Hoare triple {6987#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6987#false} is VALID [2018-11-23 13:03:32,285 INFO L273 TraceCheckUtils]: 40: Hoare triple {6987#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6987#false} is VALID [2018-11-23 13:03:32,285 INFO L273 TraceCheckUtils]: 41: Hoare triple {6987#false} assume !(0 != #t~mem9);havoc #t~mem9; {6987#false} is VALID [2018-11-23 13:03:32,286 INFO L256 TraceCheckUtils]: 42: Hoare triple {6987#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {6987#false} is VALID [2018-11-23 13:03:32,286 INFO L273 TraceCheckUtils]: 43: Hoare triple {6987#false} ~cond := #in~cond; {6987#false} is VALID [2018-11-23 13:03:32,286 INFO L273 TraceCheckUtils]: 44: Hoare triple {6987#false} assume 0 == ~cond; {6987#false} is VALID [2018-11-23 13:03:32,286 INFO L273 TraceCheckUtils]: 45: Hoare triple {6987#false} assume !false; {6987#false} is VALID [2018-11-23 13:03:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-23 13:03:32,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:32,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:32,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:32,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {6986#true} call ULTIMATE.init(); {6986#true} is VALID [2018-11-23 13:03:32,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {6986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6986#true} is VALID [2018-11-23 13:03:32,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {6986#true} assume true; {6986#true} is VALID [2018-11-23 13:03:32,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6986#true} {6986#true} #112#return; {6986#true} is VALID [2018-11-23 13:03:32,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {6986#true} call #t~ret15 := main(); {6986#true} is VALID [2018-11-23 13:03:32,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {6986#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {7009#(= main_~i~0 0)} is VALID [2018-11-23 13:03:32,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {7009#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {7009#(= main_~i~0 0)} is VALID [2018-11-23 13:03:32,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {7009#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7016#(= main_~i~0 1)} is VALID [2018-11-23 13:03:32,483 INFO L273 TraceCheckUtils]: 8: Hoare triple {7016#(= main_~i~0 1)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {7016#(= main_~i~0 1)} is VALID [2018-11-23 13:03:32,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {7016#(= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7023#(= main_~i~0 2)} is VALID [2018-11-23 13:03:32,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {7023#(= main_~i~0 2)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {7023#(= main_~i~0 2)} is VALID [2018-11-23 13:03:32,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {7023#(= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {7030#(= main_~i~0 3)} is VALID [2018-11-23 13:03:32,484 INFO L273 TraceCheckUtils]: 12: Hoare triple {7030#(= main_~i~0 3)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {6986#true} is VALID [2018-11-23 13:03:32,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {6986#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#true} is VALID [2018-11-23 13:03:32,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {6986#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {6986#true} is VALID [2018-11-23 13:03:32,484 INFO L273 TraceCheckUtils]: 15: Hoare triple {6986#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#true} is VALID [2018-11-23 13:03:32,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {6986#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {6986#true} is VALID [2018-11-23 13:03:32,485 INFO L273 TraceCheckUtils]: 17: Hoare triple {6986#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {6986#true} is VALID [2018-11-23 13:03:32,485 INFO L273 TraceCheckUtils]: 18: Hoare triple {6986#true} assume !(~i~0 % 4294967296 < 10); {6986#true} is VALID [2018-11-23 13:03:32,485 INFO L273 TraceCheckUtils]: 19: Hoare triple {6986#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {6986#true} is VALID [2018-11-23 13:03:32,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {6986#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {6986#true} is VALID [2018-11-23 13:03:32,485 INFO L273 TraceCheckUtils]: 21: Hoare triple {6986#true} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {6986#true} is VALID [2018-11-23 13:03:32,485 INFO L273 TraceCheckUtils]: 22: Hoare triple {6986#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {6986#true} is VALID [2018-11-23 13:03:32,485 INFO L273 TraceCheckUtils]: 23: Hoare triple {6986#true} assume !(0 != #t~mem2);havoc #t~mem2; {6986#true} is VALID [2018-11-23 13:03:32,486 INFO L273 TraceCheckUtils]: 24: Hoare triple {6986#true} ~cont~0 := 0;~i~0 := 0; {6986#true} is VALID [2018-11-23 13:03:32,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {6986#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {6986#true} is VALID [2018-11-23 13:03:32,486 INFO L273 TraceCheckUtils]: 26: Hoare triple {6986#true} ~i~0 := 0;~cont_aux~0 := 0; {6986#true} is VALID [2018-11-23 13:03:32,486 INFO L273 TraceCheckUtils]: 27: Hoare triple {6986#true} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6986#true} is VALID [2018-11-23 13:03:32,486 INFO L273 TraceCheckUtils]: 28: Hoare triple {6986#true} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {7082#(= main_~j~0 0)} is VALID [2018-11-23 13:03:32,487 INFO L273 TraceCheckUtils]: 29: Hoare triple {7082#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7082#(= main_~j~0 0)} is VALID [2018-11-23 13:03:32,487 INFO L273 TraceCheckUtils]: 30: Hoare triple {7082#(= main_~j~0 0)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {7082#(= main_~j~0 0)} is VALID [2018-11-23 13:03:32,487 INFO L273 TraceCheckUtils]: 31: Hoare triple {7082#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {7092#(= main_~j~0 1)} is VALID [2018-11-23 13:03:32,488 INFO L273 TraceCheckUtils]: 32: Hoare triple {7092#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7092#(= main_~j~0 1)} is VALID [2018-11-23 13:03:32,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {7092#(= main_~j~0 1)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {7092#(= main_~j~0 1)} is VALID [2018-11-23 13:03:32,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {7092#(= main_~j~0 1)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {7102#(= main_~j~0 2)} is VALID [2018-11-23 13:03:32,494 INFO L273 TraceCheckUtils]: 35: Hoare triple {7102#(= main_~j~0 2)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7102#(= main_~j~0 2)} is VALID [2018-11-23 13:03:32,494 INFO L273 TraceCheckUtils]: 36: Hoare triple {7102#(= main_~j~0 2)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {7102#(= main_~j~0 2)} is VALID [2018-11-23 13:03:32,495 INFO L273 TraceCheckUtils]: 37: Hoare triple {7102#(= main_~j~0 2)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {7112#(= main_~j~0 3)} is VALID [2018-11-23 13:03:32,495 INFO L273 TraceCheckUtils]: 38: Hoare triple {7112#(= main_~j~0 3)} assume !(~j~0 % 4294967296 < 10); {6987#false} is VALID [2018-11-23 13:03:32,495 INFO L273 TraceCheckUtils]: 39: Hoare triple {6987#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {6987#false} is VALID [2018-11-23 13:03:32,495 INFO L273 TraceCheckUtils]: 40: Hoare triple {6987#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {6987#false} is VALID [2018-11-23 13:03:32,495 INFO L273 TraceCheckUtils]: 41: Hoare triple {6987#false} assume !(0 != #t~mem9);havoc #t~mem9; {6987#false} is VALID [2018-11-23 13:03:32,496 INFO L256 TraceCheckUtils]: 42: Hoare triple {6987#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {6987#false} is VALID [2018-11-23 13:03:32,496 INFO L273 TraceCheckUtils]: 43: Hoare triple {6987#false} ~cond := #in~cond; {6987#false} is VALID [2018-11-23 13:03:32,496 INFO L273 TraceCheckUtils]: 44: Hoare triple {6987#false} assume 0 == ~cond; {6987#false} is VALID [2018-11-23 13:03:32,496 INFO L273 TraceCheckUtils]: 45: Hoare triple {6987#false} assume !false; {6987#false} is VALID [2018-11-23 13:03:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 42 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 13:03:32,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:32,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10] total 13 [2018-11-23 13:03:32,517 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-11-23 13:03:32,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:32,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:03:32,574 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-23 13:03:32,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:03:32,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:03:32,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:32,575 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 13 states. [2018-11-23 13:03:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:41,464 INFO L93 Difference]: Finished difference Result 810 states and 1134 transitions. [2018-11-23 13:03:41,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 13:03:41,464 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-11-23 13:03:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:41,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:03:41,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 578 transitions. [2018-11-23 13:03:41,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:03:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 578 transitions. [2018-11-23 13:03:41,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 578 transitions. [2018-11-23 13:03:43,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 578 edges. 578 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:43,599 INFO L225 Difference]: With dead ends: 810 [2018-11-23 13:03:43,599 INFO L226 Difference]: Without dead ends: 751 [2018-11-23 13:03:43,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=245, Invalid=2407, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 13:03:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-11-23 13:03:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 100. [2018-11-23 13:03:44,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:44,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 751 states. Second operand 100 states. [2018-11-23 13:03:44,249 INFO L74 IsIncluded]: Start isIncluded. First operand 751 states. Second operand 100 states. [2018-11-23 13:03:44,249 INFO L87 Difference]: Start difference. First operand 751 states. Second operand 100 states. [2018-11-23 13:03:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:44,281 INFO L93 Difference]: Finished difference Result 751 states and 1016 transitions. [2018-11-23 13:03:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1016 transitions. [2018-11-23 13:03:44,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:44,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:44,283 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 751 states. [2018-11-23 13:03:44,283 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 751 states. [2018-11-23 13:03:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:44,318 INFO L93 Difference]: Finished difference Result 751 states and 1016 transitions. [2018-11-23 13:03:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1016 transitions. [2018-11-23 13:03:44,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:44,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:44,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:44,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 13:03:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2018-11-23 13:03:44,323 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 46 [2018-11-23 13:03:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:44,323 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2018-11-23 13:03:44,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:03:44,324 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2018-11-23 13:03:44,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:03:44,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:44,325 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:44,325 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:44,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:44,325 INFO L82 PathProgramCache]: Analyzing trace with hash 45416428, now seen corresponding path program 2 times [2018-11-23 13:03:44,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:44,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:44,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:44,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:45,238 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-23 13:03:45,645 INFO L256 TraceCheckUtils]: 0: Hoare triple {9953#true} call ULTIMATE.init(); {9953#true} is VALID [2018-11-23 13:03:45,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {9953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9953#true} is VALID [2018-11-23 13:03:45,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {9953#true} assume true; {9953#true} is VALID [2018-11-23 13:03:45,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9953#true} {9953#true} #112#return; {9953#true} is VALID [2018-11-23 13:03:45,646 INFO L256 TraceCheckUtils]: 4: Hoare triple {9953#true} call #t~ret15 := main(); {9953#true} is VALID [2018-11-23 13:03:45,646 INFO L273 TraceCheckUtils]: 5: Hoare triple {9953#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {9953#true} is VALID [2018-11-23 13:03:45,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {9953#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9953#true} is VALID [2018-11-23 13:03:45,647 INFO L273 TraceCheckUtils]: 7: Hoare triple {9953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9953#true} is VALID [2018-11-23 13:03:45,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {9953#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9953#true} is VALID [2018-11-23 13:03:45,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {9953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9953#true} is VALID [2018-11-23 13:03:45,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {9953#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9953#true} is VALID [2018-11-23 13:03:45,648 INFO L273 TraceCheckUtils]: 11: Hoare triple {9953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9953#true} is VALID [2018-11-23 13:03:45,648 INFO L273 TraceCheckUtils]: 12: Hoare triple {9953#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9953#true} is VALID [2018-11-23 13:03:45,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {9953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9953#true} is VALID [2018-11-23 13:03:45,648 INFO L273 TraceCheckUtils]: 14: Hoare triple {9953#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9953#true} is VALID [2018-11-23 13:03:45,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {9953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9953#true} is VALID [2018-11-23 13:03:45,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {9953#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9953#true} is VALID [2018-11-23 13:03:45,649 INFO L273 TraceCheckUtils]: 17: Hoare triple {9953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9953#true} is VALID [2018-11-23 13:03:45,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {9953#true} assume !(~i~0 % 4294967296 < 10); {9953#true} is VALID [2018-11-23 13:03:45,657 INFO L273 TraceCheckUtils]: 19: Hoare triple {9953#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {9955#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:03:45,663 INFO L273 TraceCheckUtils]: 20: Hoare triple {9955#(= main_~n_caracter~0 0)} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9955#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:03:45,663 INFO L273 TraceCheckUtils]: 21: Hoare triple {9955#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {9956#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2018-11-23 13:03:45,664 INFO L273 TraceCheckUtils]: 22: Hoare triple {9956#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9956#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2018-11-23 13:03:45,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {9956#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {9957#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:03:45,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {9957#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9957#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:03:45,665 INFO L273 TraceCheckUtils]: 25: Hoare triple {9957#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} assume !(0 != #t~mem2);havoc #t~mem2; {9957#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:03:45,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {9957#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} ~cont~0 := 0;~i~0 := 0; {9958#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2018-11-23 13:03:45,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {9958#(and (<= 2 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {9954#false} is VALID [2018-11-23 13:03:45,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {9954#false} ~i~0 := 0;~cont_aux~0 := 0; {9954#false} is VALID [2018-11-23 13:03:45,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {9954#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9954#false} is VALID [2018-11-23 13:03:45,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {9954#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {9954#false} is VALID [2018-11-23 13:03:45,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {9954#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9954#false} is VALID [2018-11-23 13:03:45,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {9954#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {9954#false} is VALID [2018-11-23 13:03:45,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {9954#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {9954#false} is VALID [2018-11-23 13:03:45,668 INFO L273 TraceCheckUtils]: 34: Hoare triple {9954#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9954#false} is VALID [2018-11-23 13:03:45,668 INFO L273 TraceCheckUtils]: 35: Hoare triple {9954#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {9954#false} is VALID [2018-11-23 13:03:45,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {9954#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {9954#false} is VALID [2018-11-23 13:03:45,668 INFO L273 TraceCheckUtils]: 37: Hoare triple {9954#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9954#false} is VALID [2018-11-23 13:03:45,669 INFO L273 TraceCheckUtils]: 38: Hoare triple {9954#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {9954#false} is VALID [2018-11-23 13:03:45,669 INFO L273 TraceCheckUtils]: 39: Hoare triple {9954#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {9954#false} is VALID [2018-11-23 13:03:45,669 INFO L273 TraceCheckUtils]: 40: Hoare triple {9954#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9954#false} is VALID [2018-11-23 13:03:45,669 INFO L273 TraceCheckUtils]: 41: Hoare triple {9954#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {9954#false} is VALID [2018-11-23 13:03:45,669 INFO L273 TraceCheckUtils]: 42: Hoare triple {9954#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {9954#false} is VALID [2018-11-23 13:03:45,669 INFO L273 TraceCheckUtils]: 43: Hoare triple {9954#false} assume !(~j~0 % 4294967296 < 10); {9954#false} is VALID [2018-11-23 13:03:45,669 INFO L273 TraceCheckUtils]: 44: Hoare triple {9954#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9954#false} is VALID [2018-11-23 13:03:45,669 INFO L273 TraceCheckUtils]: 45: Hoare triple {9954#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9954#false} is VALID [2018-11-23 13:03:45,670 INFO L273 TraceCheckUtils]: 46: Hoare triple {9954#false} assume !(0 != #t~mem9);havoc #t~mem9; {9954#false} is VALID [2018-11-23 13:03:45,670 INFO L256 TraceCheckUtils]: 47: Hoare triple {9954#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {9954#false} is VALID [2018-11-23 13:03:45,670 INFO L273 TraceCheckUtils]: 48: Hoare triple {9954#false} ~cond := #in~cond; {9954#false} is VALID [2018-11-23 13:03:45,670 INFO L273 TraceCheckUtils]: 49: Hoare triple {9954#false} assume 0 == ~cond; {9954#false} is VALID [2018-11-23 13:03:45,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {9954#false} assume !false; {9954#false} is VALID [2018-11-23 13:03:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 13:03:45,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:45,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:45,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:45,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:45,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:45,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:45,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:45,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {9953#true} call ULTIMATE.init(); {9953#true} is VALID [2018-11-23 13:03:45,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {9953#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9953#true} is VALID [2018-11-23 13:03:45,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {9953#true} assume true; {9953#true} is VALID [2018-11-23 13:03:45,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9953#true} {9953#true} #112#return; {9953#true} is VALID [2018-11-23 13:03:45,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {9953#true} call #t~ret15 := main(); {9953#true} is VALID [2018-11-23 13:03:45,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {9953#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {9977#(= main_~i~0 0)} is VALID [2018-11-23 13:03:45,869 INFO L273 TraceCheckUtils]: 6: Hoare triple {9977#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9977#(= main_~i~0 0)} is VALID [2018-11-23 13:03:45,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {9977#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9984#(= main_~i~0 1)} is VALID [2018-11-23 13:03:45,870 INFO L273 TraceCheckUtils]: 8: Hoare triple {9984#(= main_~i~0 1)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9984#(= main_~i~0 1)} is VALID [2018-11-23 13:03:45,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {9984#(= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9991#(= main_~i~0 2)} is VALID [2018-11-23 13:03:45,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {9991#(= main_~i~0 2)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9991#(= main_~i~0 2)} is VALID [2018-11-23 13:03:45,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {9991#(= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9998#(= main_~i~0 3)} is VALID [2018-11-23 13:03:45,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {9998#(= main_~i~0 3)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9998#(= main_~i~0 3)} is VALID [2018-11-23 13:03:45,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {9998#(= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {10005#(= main_~i~0 4)} is VALID [2018-11-23 13:03:45,872 INFO L273 TraceCheckUtils]: 14: Hoare triple {10005#(= main_~i~0 4)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9953#true} is VALID [2018-11-23 13:03:45,872 INFO L273 TraceCheckUtils]: 15: Hoare triple {9953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9953#true} is VALID [2018-11-23 13:03:45,873 INFO L273 TraceCheckUtils]: 16: Hoare triple {9953#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {9953#true} is VALID [2018-11-23 13:03:45,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {9953#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {9953#true} is VALID [2018-11-23 13:03:45,873 INFO L273 TraceCheckUtils]: 18: Hoare triple {9953#true} assume !(~i~0 % 4294967296 < 10); {9953#true} is VALID [2018-11-23 13:03:45,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {9953#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {9953#true} is VALID [2018-11-23 13:03:45,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {9953#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9953#true} is VALID [2018-11-23 13:03:45,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {9953#true} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {9953#true} is VALID [2018-11-23 13:03:45,874 INFO L273 TraceCheckUtils]: 22: Hoare triple {9953#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9953#true} is VALID [2018-11-23 13:03:45,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {9953#true} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {9953#true} is VALID [2018-11-23 13:03:45,874 INFO L273 TraceCheckUtils]: 24: Hoare triple {9953#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9953#true} is VALID [2018-11-23 13:03:45,875 INFO L273 TraceCheckUtils]: 25: Hoare triple {9953#true} assume !(0 != #t~mem2);havoc #t~mem2; {9953#true} is VALID [2018-11-23 13:03:45,875 INFO L273 TraceCheckUtils]: 26: Hoare triple {9953#true} ~cont~0 := 0;~i~0 := 0; {9953#true} is VALID [2018-11-23 13:03:45,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {9953#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {9953#true} is VALID [2018-11-23 13:03:45,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {9953#true} ~i~0 := 0;~cont_aux~0 := 0; {9953#true} is VALID [2018-11-23 13:03:45,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {9953#true} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9953#true} is VALID [2018-11-23 13:03:45,875 INFO L273 TraceCheckUtils]: 30: Hoare triple {9953#true} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {10057#(= main_~j~0 0)} is VALID [2018-11-23 13:03:45,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {10057#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {10057#(= main_~j~0 0)} is VALID [2018-11-23 13:03:45,876 INFO L273 TraceCheckUtils]: 32: Hoare triple {10057#(= main_~j~0 0)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {10057#(= main_~j~0 0)} is VALID [2018-11-23 13:03:45,876 INFO L273 TraceCheckUtils]: 33: Hoare triple {10057#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {10067#(= main_~j~0 1)} is VALID [2018-11-23 13:03:45,877 INFO L273 TraceCheckUtils]: 34: Hoare triple {10067#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {10067#(= main_~j~0 1)} is VALID [2018-11-23 13:03:45,877 INFO L273 TraceCheckUtils]: 35: Hoare triple {10067#(= main_~j~0 1)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {10067#(= main_~j~0 1)} is VALID [2018-11-23 13:03:45,877 INFO L273 TraceCheckUtils]: 36: Hoare triple {10067#(= main_~j~0 1)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {10077#(= main_~j~0 2)} is VALID [2018-11-23 13:03:45,878 INFO L273 TraceCheckUtils]: 37: Hoare triple {10077#(= main_~j~0 2)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {10077#(= main_~j~0 2)} is VALID [2018-11-23 13:03:45,878 INFO L273 TraceCheckUtils]: 38: Hoare triple {10077#(= main_~j~0 2)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {10077#(= main_~j~0 2)} is VALID [2018-11-23 13:03:45,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {10077#(= main_~j~0 2)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {10087#(= main_~j~0 3)} is VALID [2018-11-23 13:03:45,879 INFO L273 TraceCheckUtils]: 40: Hoare triple {10087#(= main_~j~0 3)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {10087#(= main_~j~0 3)} is VALID [2018-11-23 13:03:45,879 INFO L273 TraceCheckUtils]: 41: Hoare triple {10087#(= main_~j~0 3)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {10087#(= main_~j~0 3)} is VALID [2018-11-23 13:03:45,879 INFO L273 TraceCheckUtils]: 42: Hoare triple {10087#(= main_~j~0 3)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {10097#(= main_~j~0 4)} is VALID [2018-11-23 13:03:45,880 INFO L273 TraceCheckUtils]: 43: Hoare triple {10097#(= main_~j~0 4)} assume !(~j~0 % 4294967296 < 10); {9954#false} is VALID [2018-11-23 13:03:45,880 INFO L273 TraceCheckUtils]: 44: Hoare triple {9954#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {9954#false} is VALID [2018-11-23 13:03:45,880 INFO L273 TraceCheckUtils]: 45: Hoare triple {9954#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9954#false} is VALID [2018-11-23 13:03:45,881 INFO L273 TraceCheckUtils]: 46: Hoare triple {9954#false} assume !(0 != #t~mem9);havoc #t~mem9; {9954#false} is VALID [2018-11-23 13:03:45,881 INFO L256 TraceCheckUtils]: 47: Hoare triple {9954#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {9954#false} is VALID [2018-11-23 13:03:45,881 INFO L273 TraceCheckUtils]: 48: Hoare triple {9954#false} ~cond := #in~cond; {9954#false} is VALID [2018-11-23 13:03:45,881 INFO L273 TraceCheckUtils]: 49: Hoare triple {9954#false} assume 0 == ~cond; {9954#false} is VALID [2018-11-23 13:03:45,881 INFO L273 TraceCheckUtils]: 50: Hoare triple {9954#false} assume !false; {9954#false} is VALID [2018-11-23 13:03:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 13:03:45,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:45,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12] total 16 [2018-11-23 13:03:45,903 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-11-23 13:03:45,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:45,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:03:45,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:45,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:03:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:03:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:03:45,996 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand 16 states. [2018-11-23 13:04:06,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:06,614 INFO L93 Difference]: Finished difference Result 1411 states and 1968 transitions. [2018-11-23 13:04:06,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-11-23 13:04:06,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-11-23 13:04:06,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:06,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:04:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 1000 transitions. [2018-11-23 13:04:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:04:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 1000 transitions. [2018-11-23 13:04:06,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 110 states and 1000 transitions. [2018-11-23 13:04:08,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 1000 edges. 1000 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:08,280 INFO L225 Difference]: With dead ends: 1411 [2018-11-23 13:04:08,280 INFO L226 Difference]: Without dead ends: 1340 [2018-11-23 13:04:08,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4385 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=607, Invalid=11383, Unknown=0, NotChecked=0, Total=11990 [2018-11-23 13:04:08,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2018-11-23 13:04:09,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 184. [2018-11-23 13:04:09,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:09,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1340 states. Second operand 184 states. [2018-11-23 13:04:09,283 INFO L74 IsIncluded]: Start isIncluded. First operand 1340 states. Second operand 184 states. [2018-11-23 13:04:09,283 INFO L87 Difference]: Start difference. First operand 1340 states. Second operand 184 states. [2018-11-23 13:04:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:09,377 INFO L93 Difference]: Finished difference Result 1340 states and 1808 transitions. [2018-11-23 13:04:09,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1808 transitions. [2018-11-23 13:04:09,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:09,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:09,380 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 1340 states. [2018-11-23 13:04:09,380 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 1340 states. [2018-11-23 13:04:09,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:09,476 INFO L93 Difference]: Finished difference Result 1340 states and 1808 transitions. [2018-11-23 13:04:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1808 transitions. [2018-11-23 13:04:09,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:09,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:09,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:09,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 13:04:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 236 transitions. [2018-11-23 13:04:09,484 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 236 transitions. Word has length 51 [2018-11-23 13:04:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:09,484 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 236 transitions. [2018-11-23 13:04:09,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:04:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 236 transitions. [2018-11-23 13:04:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 13:04:09,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:09,486 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:09,486 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:09,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:09,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1817229259, now seen corresponding path program 3 times [2018-11-23 13:04:09,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:09,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:09,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:09,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:09,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:09,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:10,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {15155#true} call ULTIMATE.init(); {15155#true} is VALID [2018-11-23 13:04:10,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {15155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15155#true} is VALID [2018-11-23 13:04:10,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {15155#true} assume true; {15155#true} is VALID [2018-11-23 13:04:10,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15155#true} {15155#true} #112#return; {15155#true} is VALID [2018-11-23 13:04:10,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {15155#true} call #t~ret15 := main(); {15155#true} is VALID [2018-11-23 13:04:10,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {15155#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {15155#true} is VALID [2018-11-23 13:04:10,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {15155#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15155#true} is VALID [2018-11-23 13:04:10,218 INFO L273 TraceCheckUtils]: 7: Hoare triple {15155#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15155#true} is VALID [2018-11-23 13:04:10,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {15155#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15155#true} is VALID [2018-11-23 13:04:10,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {15155#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15155#true} is VALID [2018-11-23 13:04:10,218 INFO L273 TraceCheckUtils]: 10: Hoare triple {15155#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15155#true} is VALID [2018-11-23 13:04:10,218 INFO L273 TraceCheckUtils]: 11: Hoare triple {15155#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15155#true} is VALID [2018-11-23 13:04:10,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {15155#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15155#true} is VALID [2018-11-23 13:04:10,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {15155#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15155#true} is VALID [2018-11-23 13:04:10,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {15155#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15155#true} is VALID [2018-11-23 13:04:10,219 INFO L273 TraceCheckUtils]: 15: Hoare triple {15155#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15155#true} is VALID [2018-11-23 13:04:10,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {15155#true} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15155#true} is VALID [2018-11-23 13:04:10,219 INFO L273 TraceCheckUtils]: 17: Hoare triple {15155#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15155#true} is VALID [2018-11-23 13:04:10,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {15155#true} assume !(~i~0 % 4294967296 < 10); {15155#true} is VALID [2018-11-23 13:04:10,219 INFO L273 TraceCheckUtils]: 19: Hoare triple {15155#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {15157#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:04:10,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {15157#(= main_~n_caracter~0 0)} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {15157#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:04:10,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {15157#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {15158#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2018-11-23 13:04:10,221 INFO L273 TraceCheckUtils]: 22: Hoare triple {15158#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {15158#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2018-11-23 13:04:10,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {15158#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {15159#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2018-11-23 13:04:10,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {15159#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {15159#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2018-11-23 13:04:10,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {15159#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {15160#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:04:10,223 INFO L273 TraceCheckUtils]: 26: Hoare triple {15160#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {15160#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:04:10,223 INFO L273 TraceCheckUtils]: 27: Hoare triple {15160#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} assume !(0 != #t~mem2);havoc #t~mem2; {15160#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:04:10,224 INFO L273 TraceCheckUtils]: 28: Hoare triple {15160#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} ~cont~0 := 0;~i~0 := 0; {15161#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2018-11-23 13:04:10,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {15161#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {15156#false} is VALID [2018-11-23 13:04:10,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {15156#false} ~i~0 := 0;~cont_aux~0 := 0; {15156#false} is VALID [2018-11-23 13:04:10,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {15156#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,226 INFO L273 TraceCheckUtils]: 32: Hoare triple {15156#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {15156#false} is VALID [2018-11-23 13:04:10,226 INFO L273 TraceCheckUtils]: 33: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,226 INFO L273 TraceCheckUtils]: 34: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,226 INFO L273 TraceCheckUtils]: 35: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,227 INFO L273 TraceCheckUtils]: 38: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,227 INFO L273 TraceCheckUtils]: 39: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,227 INFO L273 TraceCheckUtils]: 40: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,228 INFO L273 TraceCheckUtils]: 41: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,228 INFO L273 TraceCheckUtils]: 42: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,228 INFO L273 TraceCheckUtils]: 43: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,228 INFO L273 TraceCheckUtils]: 44: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,229 INFO L273 TraceCheckUtils]: 45: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,229 INFO L273 TraceCheckUtils]: 46: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,229 INFO L273 TraceCheckUtils]: 47: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,229 INFO L273 TraceCheckUtils]: 48: Hoare triple {15156#false} assume !(~j~0 % 4294967296 < 10); {15156#false} is VALID [2018-11-23 13:04:10,229 INFO L273 TraceCheckUtils]: 49: Hoare triple {15156#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15156#false} is VALID [2018-11-23 13:04:10,230 INFO L273 TraceCheckUtils]: 50: Hoare triple {15156#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,230 INFO L273 TraceCheckUtils]: 51: Hoare triple {15156#false} assume !(0 != #t~mem9);havoc #t~mem9; {15156#false} is VALID [2018-11-23 13:04:10,230 INFO L256 TraceCheckUtils]: 52: Hoare triple {15156#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {15156#false} is VALID [2018-11-23 13:04:10,230 INFO L273 TraceCheckUtils]: 53: Hoare triple {15156#false} ~cond := #in~cond; {15156#false} is VALID [2018-11-23 13:04:10,230 INFO L273 TraceCheckUtils]: 54: Hoare triple {15156#false} assume 0 == ~cond; {15156#false} is VALID [2018-11-23 13:04:10,230 INFO L273 TraceCheckUtils]: 55: Hoare triple {15156#false} assume !false; {15156#false} is VALID [2018-11-23 13:04:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-23 13:04:10,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:10,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:10,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:04:10,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:04:10,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:10,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:10,637 INFO L478 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 17 treesize of output 13 [2018-11-23 13:04:10,642 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:04:10,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-11-23 13:04:10,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:10,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:10,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:04:10,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:11 [2018-11-23 13:04:10,662 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:10,662 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#string_entrada~0.base|, main_~n_caracter~0]. (let ((.cse0 (select |#memory_int| |main_~#string_entrada~0.base|)) (.cse1 (mod main_~n_caracter~0 4294967296))) (and (= 0 (select .cse0 .cse1)) (= (select .cse0 0) |main_#t~mem9|) (<= .cse1 2147483647) (<= .cse1 0))) [2018-11-23 13:04:10,662 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~n_caracter~0]. (let ((.cse0 (mod main_~n_caracter~0 4294967296))) (and (= |main_#t~mem9| .cse0) (<= .cse0 0))) [2018-11-23 13:04:10,769 INFO L256 TraceCheckUtils]: 0: Hoare triple {15155#true} call ULTIMATE.init(); {15155#true} is VALID [2018-11-23 13:04:10,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {15155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15155#true} is VALID [2018-11-23 13:04:10,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {15155#true} assume true; {15155#true} is VALID [2018-11-23 13:04:10,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15155#true} {15155#true} #112#return; {15155#true} is VALID [2018-11-23 13:04:10,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {15155#true} call #t~ret15 := main(); {15155#true} is VALID [2018-11-23 13:04:10,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {15155#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {15180#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:04:10,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {15180#(and (= 0 |main_~#string_entrada~0.offset|) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,772 INFO L273 TraceCheckUtils]: 9: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,796 INFO L273 TraceCheckUtils]: 12: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,798 INFO L273 TraceCheckUtils]: 18: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} assume !(~i~0 % 4294967296 < 10); {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,798 INFO L273 TraceCheckUtils]: 19: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {15184#(= 0 |main_~#string_entrada~0.offset|)} is VALID [2018-11-23 13:04:10,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {15184#(= 0 |main_~#string_entrada~0.offset|)} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {15245#(and (= 0 |main_~#string_entrada~0.offset|) (or (and (= |main_#t~mem2| (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 2147483647)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296))) |main_#t~mem2|) (< 2147483647 (mod main_~n_caracter~0 4294967296)))))} is VALID [2018-11-23 13:04:10,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {15245#(and (= 0 |main_~#string_entrada~0.offset|) (or (and (= |main_#t~mem2| (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 2147483647)) (and (= (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296))) |main_#t~mem2|) (< 2147483647 (mod main_~n_caracter~0 4294967296)))))} assume !(0 != #t~mem2);havoc #t~mem2; {15249#(and (= 0 |main_~#string_entrada~0.offset|) (or (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|)))) (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~n_caracter~0 4294967296)))))} is VALID [2018-11-23 13:04:10,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {15249#(and (= 0 |main_~#string_entrada~0.offset|) (or (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|)))) (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~n_caracter~0 4294967296)))))} ~cont~0 := 0;~i~0 := 0; {15253#(and (= 0 |main_~#string_entrada~0.offset|) (or (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|)))) (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~n_caracter~0 4294967296)))) (= main_~i~0 0))} is VALID [2018-11-23 13:04:10,806 INFO L273 TraceCheckUtils]: 29: Hoare triple {15253#(and (= 0 |main_~#string_entrada~0.offset|) (or (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|)))) (and (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~n_caracter~0 4294967296)))) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {15257#(and (= 0 |main_~#string_entrada~0.offset|) (exists ((main_~n_caracter~0 Int)) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 0))))} is VALID [2018-11-23 13:04:10,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {15257#(and (= 0 |main_~#string_entrada~0.offset|) (exists ((main_~n_caracter~0 Int)) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 0))))} ~i~0 := 0;~cont_aux~0 := 0; {15261#(and (= 0 |main_~#string_entrada~0.offset|) (exists ((main_~n_caracter~0 Int)) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 0))) (= main_~i~0 0))} is VALID [2018-11-23 13:04:10,808 INFO L273 TraceCheckUtils]: 31: Hoare triple {15261#(and (= 0 |main_~#string_entrada~0.offset|) (exists ((main_~n_caracter~0 Int)) (and (<= (mod main_~n_caracter~0 4294967296) 2147483647) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) (+ (mod main_~n_caracter~0 4294967296) |main_~#string_entrada~0.offset|))) (<= (mod main_~n_caracter~0 4294967296) 0))) (= main_~i~0 0))} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {15265#(exists ((main_~n_caracter~0 Int)) (and (= |main_#t~mem9| (mod main_~n_caracter~0 4294967296)) (<= (mod main_~n_caracter~0 4294967296) 0)))} is VALID [2018-11-23 13:04:10,809 INFO L273 TraceCheckUtils]: 32: Hoare triple {15265#(exists ((main_~n_caracter~0 Int)) (and (= |main_#t~mem9| (mod main_~n_caracter~0 4294967296)) (<= (mod main_~n_caracter~0 4294967296) 0)))} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {15156#false} is VALID [2018-11-23 13:04:10,810 INFO L273 TraceCheckUtils]: 33: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,810 INFO L273 TraceCheckUtils]: 34: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,810 INFO L273 TraceCheckUtils]: 35: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,810 INFO L273 TraceCheckUtils]: 36: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,810 INFO L273 TraceCheckUtils]: 37: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,811 INFO L273 TraceCheckUtils]: 38: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,811 INFO L273 TraceCheckUtils]: 41: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,811 INFO L273 TraceCheckUtils]: 42: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,812 INFO L273 TraceCheckUtils]: 43: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,812 INFO L273 TraceCheckUtils]: 44: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,812 INFO L273 TraceCheckUtils]: 45: Hoare triple {15156#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,812 INFO L273 TraceCheckUtils]: 46: Hoare triple {15156#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {15156#false} is VALID [2018-11-23 13:04:10,812 INFO L273 TraceCheckUtils]: 47: Hoare triple {15156#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {15156#false} is VALID [2018-11-23 13:04:10,812 INFO L273 TraceCheckUtils]: 48: Hoare triple {15156#false} assume !(~j~0 % 4294967296 < 10); {15156#false} is VALID [2018-11-23 13:04:10,812 INFO L273 TraceCheckUtils]: 49: Hoare triple {15156#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {15156#false} is VALID [2018-11-23 13:04:10,813 INFO L273 TraceCheckUtils]: 50: Hoare triple {15156#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {15156#false} is VALID [2018-11-23 13:04:10,813 INFO L273 TraceCheckUtils]: 51: Hoare triple {15156#false} assume !(0 != #t~mem9);havoc #t~mem9; {15156#false} is VALID [2018-11-23 13:04:10,813 INFO L256 TraceCheckUtils]: 52: Hoare triple {15156#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {15156#false} is VALID [2018-11-23 13:04:10,813 INFO L273 TraceCheckUtils]: 53: Hoare triple {15156#false} ~cond := #in~cond; {15156#false} is VALID [2018-11-23 13:04:10,813 INFO L273 TraceCheckUtils]: 54: Hoare triple {15156#false} assume 0 == ~cond; {15156#false} is VALID [2018-11-23 13:04:10,813 INFO L273 TraceCheckUtils]: 55: Hoare triple {15156#false} assume !false; {15156#false} is VALID [2018-11-23 13:04:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2018-11-23 13:04:10,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:10,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-23 13:04:10,837 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-11-23 13:04:10,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:10,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:04:10,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:10,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:04:10,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:04:10,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:04:10,978 INFO L87 Difference]: Start difference. First operand 184 states and 236 transitions. Second operand 15 states. [2018-11-23 13:04:11,950 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2018-11-23 13:04:18,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:18,511 INFO L93 Difference]: Finished difference Result 645 states and 849 transitions. [2018-11-23 13:04:18,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:04:18,511 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2018-11-23 13:04:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:04:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 181 transitions. [2018-11-23 13:04:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:04:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 181 transitions. [2018-11-23 13:04:18,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 181 transitions. [2018-11-23 13:04:18,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:18,817 INFO L225 Difference]: With dead ends: 645 [2018-11-23 13:04:18,817 INFO L226 Difference]: Without dead ends: 598 [2018-11-23 13:04:18,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:04:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-11-23 13:04:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 184. [2018-11-23 13:04:20,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:20,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 598 states. Second operand 184 states. [2018-11-23 13:04:20,691 INFO L74 IsIncluded]: Start isIncluded. First operand 598 states. Second operand 184 states. [2018-11-23 13:04:20,691 INFO L87 Difference]: Start difference. First operand 598 states. Second operand 184 states. [2018-11-23 13:04:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:20,708 INFO L93 Difference]: Finished difference Result 598 states and 788 transitions. [2018-11-23 13:04:20,708 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 788 transitions. [2018-11-23 13:04:20,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:20,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:20,710 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand 598 states. [2018-11-23 13:04:20,710 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 598 states. [2018-11-23 13:04:20,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:20,730 INFO L93 Difference]: Finished difference Result 598 states and 788 transitions. [2018-11-23 13:04:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 788 transitions. [2018-11-23 13:04:20,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:20,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:20,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:20,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:20,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-23 13:04:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 236 transitions. [2018-11-23 13:04:20,735 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 236 transitions. Word has length 56 [2018-11-23 13:04:20,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:20,735 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 236 transitions. [2018-11-23 13:04:20,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:04:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 236 transitions. [2018-11-23 13:04:20,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 13:04:20,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:20,737 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:20,737 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:20,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:20,737 INFO L82 PathProgramCache]: Analyzing trace with hash -572357134, now seen corresponding path program 1 times [2018-11-23 13:04:20,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:20,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:20,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:20,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:04:20,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:23,600 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-11-23 13:04:23,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {17712#true} call ULTIMATE.init(); {17712#true} is VALID [2018-11-23 13:04:23,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {17712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17712#true} is VALID [2018-11-23 13:04:23,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {17712#true} assume true; {17712#true} is VALID [2018-11-23 13:04:23,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17712#true} {17712#true} #112#return; {17712#true} is VALID [2018-11-23 13:04:23,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {17712#true} call #t~ret15 := main(); {17712#true} is VALID [2018-11-23 13:04:23,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {17712#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {17714#(= main_~i~0 0)} is VALID [2018-11-23 13:04:23,631 INFO L273 TraceCheckUtils]: 6: Hoare triple {17714#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17714#(= main_~i~0 0)} is VALID [2018-11-23 13:04:23,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {17714#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17715#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:04:23,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {17715#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17715#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:04:23,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {17715#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17716#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:04:23,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {17716#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17716#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:04:23,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {17716#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17717#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:04:23,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {17717#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17717#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:04:23,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {17717#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17718#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:04:23,638 INFO L273 TraceCheckUtils]: 14: Hoare triple {17718#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17718#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:04:23,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {17718#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17719#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} is VALID [2018-11-23 13:04:23,640 INFO L273 TraceCheckUtils]: 16: Hoare triple {17719#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17719#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} is VALID [2018-11-23 13:04:23,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {17719#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17720#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 6))} is VALID [2018-11-23 13:04:23,644 INFO L273 TraceCheckUtils]: 18: Hoare triple {17720#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 6))} assume !(~i~0 % 4294967296 < 10); {17713#false} is VALID [2018-11-23 13:04:23,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {17713#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {17713#false} is VALID [2018-11-23 13:04:23,644 INFO L273 TraceCheckUtils]: 20: Hoare triple {17713#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,645 INFO L273 TraceCheckUtils]: 21: Hoare triple {17713#false} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {17713#false} is VALID [2018-11-23 13:04:23,645 INFO L273 TraceCheckUtils]: 22: Hoare triple {17713#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {17713#false} assume !(0 != #t~mem2);havoc #t~mem2; {17713#false} is VALID [2018-11-23 13:04:23,645 INFO L273 TraceCheckUtils]: 24: Hoare triple {17713#false} ~cont~0 := 0;~i~0 := 0; {17713#false} is VALID [2018-11-23 13:04:23,645 INFO L273 TraceCheckUtils]: 25: Hoare triple {17713#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {17713#false} is VALID [2018-11-23 13:04:23,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,646 INFO L273 TraceCheckUtils]: 27: Hoare triple {17713#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17713#false} is VALID [2018-11-23 13:04:23,646 INFO L273 TraceCheckUtils]: 28: Hoare triple {17713#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17713#false} is VALID [2018-11-23 13:04:23,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,646 INFO L273 TraceCheckUtils]: 30: Hoare triple {17713#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17713#false} is VALID [2018-11-23 13:04:23,646 INFO L273 TraceCheckUtils]: 31: Hoare triple {17713#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17713#false} is VALID [2018-11-23 13:04:23,646 INFO L273 TraceCheckUtils]: 32: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,646 INFO L273 TraceCheckUtils]: 33: Hoare triple {17713#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17713#false} is VALID [2018-11-23 13:04:23,647 INFO L273 TraceCheckUtils]: 34: Hoare triple {17713#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17713#false} is VALID [2018-11-23 13:04:23,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,647 INFO L273 TraceCheckUtils]: 36: Hoare triple {17713#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17713#false} is VALID [2018-11-23 13:04:23,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {17713#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17713#false} is VALID [2018-11-23 13:04:23,647 INFO L273 TraceCheckUtils]: 38: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,647 INFO L273 TraceCheckUtils]: 39: Hoare triple {17713#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17713#false} is VALID [2018-11-23 13:04:23,647 INFO L273 TraceCheckUtils]: 40: Hoare triple {17713#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17713#false} is VALID [2018-11-23 13:04:23,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {17713#false} assume !(~j~0 % 4294967296 < 8); {17713#false} is VALID [2018-11-23 13:04:23,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {17713#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17713#false} is VALID [2018-11-23 13:04:23,648 INFO L273 TraceCheckUtils]: 43: Hoare triple {17713#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {17713#false} is VALID [2018-11-23 13:04:23,648 INFO L273 TraceCheckUtils]: 44: Hoare triple {17713#false} ~i~0 := 0;~cont_aux~0 := 0; {17713#false} is VALID [2018-11-23 13:04:23,648 INFO L273 TraceCheckUtils]: 45: Hoare triple {17713#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,648 INFO L273 TraceCheckUtils]: 46: Hoare triple {17713#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {17713#false} is VALID [2018-11-23 13:04:23,648 INFO L273 TraceCheckUtils]: 47: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,648 INFO L273 TraceCheckUtils]: 48: Hoare triple {17713#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17713#false} is VALID [2018-11-23 13:04:23,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {17713#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17713#false} is VALID [2018-11-23 13:04:23,648 INFO L273 TraceCheckUtils]: 50: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,649 INFO L273 TraceCheckUtils]: 51: Hoare triple {17713#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17713#false} is VALID [2018-11-23 13:04:23,649 INFO L273 TraceCheckUtils]: 52: Hoare triple {17713#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17713#false} is VALID [2018-11-23 13:04:23,649 INFO L273 TraceCheckUtils]: 53: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,649 INFO L273 TraceCheckUtils]: 54: Hoare triple {17713#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17713#false} is VALID [2018-11-23 13:04:23,649 INFO L273 TraceCheckUtils]: 55: Hoare triple {17713#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17713#false} is VALID [2018-11-23 13:04:23,649 INFO L273 TraceCheckUtils]: 56: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,649 INFO L273 TraceCheckUtils]: 57: Hoare triple {17713#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17713#false} is VALID [2018-11-23 13:04:23,649 INFO L273 TraceCheckUtils]: 58: Hoare triple {17713#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17713#false} is VALID [2018-11-23 13:04:23,650 INFO L273 TraceCheckUtils]: 59: Hoare triple {17713#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,650 INFO L273 TraceCheckUtils]: 60: Hoare triple {17713#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17713#false} is VALID [2018-11-23 13:04:23,650 INFO L273 TraceCheckUtils]: 61: Hoare triple {17713#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17713#false} is VALID [2018-11-23 13:04:23,650 INFO L273 TraceCheckUtils]: 62: Hoare triple {17713#false} assume !(~j~0 % 4294967296 < 10); {17713#false} is VALID [2018-11-23 13:04:23,650 INFO L273 TraceCheckUtils]: 63: Hoare triple {17713#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17713#false} is VALID [2018-11-23 13:04:23,650 INFO L273 TraceCheckUtils]: 64: Hoare triple {17713#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:23,650 INFO L273 TraceCheckUtils]: 65: Hoare triple {17713#false} assume !(0 != #t~mem9);havoc #t~mem9; {17713#false} is VALID [2018-11-23 13:04:23,650 INFO L256 TraceCheckUtils]: 66: Hoare triple {17713#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {17713#false} is VALID [2018-11-23 13:04:23,651 INFO L273 TraceCheckUtils]: 67: Hoare triple {17713#false} ~cond := #in~cond; {17713#false} is VALID [2018-11-23 13:04:23,651 INFO L273 TraceCheckUtils]: 68: Hoare triple {17713#false} assume 0 == ~cond; {17713#false} is VALID [2018-11-23 13:04:23,651 INFO L273 TraceCheckUtils]: 69: Hoare triple {17713#false} assume !false; {17713#false} is VALID [2018-11-23 13:04:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-23 13:04:23,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:23,656 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:23,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:23,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:24,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {17712#true} call ULTIMATE.init(); {17712#true} is VALID [2018-11-23 13:04:24,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {17712#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17712#true} is VALID [2018-11-23 13:04:24,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {17712#true} assume true; {17712#true} is VALID [2018-11-23 13:04:24,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17712#true} {17712#true} #112#return; {17712#true} is VALID [2018-11-23 13:04:24,067 INFO L256 TraceCheckUtils]: 4: Hoare triple {17712#true} call #t~ret15 := main(); {17712#true} is VALID [2018-11-23 13:04:24,070 INFO L273 TraceCheckUtils]: 5: Hoare triple {17712#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {17714#(= main_~i~0 0)} is VALID [2018-11-23 13:04:24,071 INFO L273 TraceCheckUtils]: 6: Hoare triple {17714#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17714#(= main_~i~0 0)} is VALID [2018-11-23 13:04:24,071 INFO L273 TraceCheckUtils]: 7: Hoare triple {17714#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17745#(= main_~i~0 1)} is VALID [2018-11-23 13:04:24,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {17745#(= main_~i~0 1)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17745#(= main_~i~0 1)} is VALID [2018-11-23 13:04:24,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {17745#(= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17752#(= main_~i~0 2)} is VALID [2018-11-23 13:04:24,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {17752#(= main_~i~0 2)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17752#(= main_~i~0 2)} is VALID [2018-11-23 13:04:24,073 INFO L273 TraceCheckUtils]: 11: Hoare triple {17752#(= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17759#(= main_~i~0 3)} is VALID [2018-11-23 13:04:24,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {17759#(= main_~i~0 3)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17759#(= main_~i~0 3)} is VALID [2018-11-23 13:04:24,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {17759#(= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17766#(= main_~i~0 4)} is VALID [2018-11-23 13:04:24,074 INFO L273 TraceCheckUtils]: 14: Hoare triple {17766#(= main_~i~0 4)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17766#(= main_~i~0 4)} is VALID [2018-11-23 13:04:24,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {17766#(= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17773#(= main_~i~0 5)} is VALID [2018-11-23 13:04:24,075 INFO L273 TraceCheckUtils]: 16: Hoare triple {17773#(= main_~i~0 5)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {17712#true} is VALID [2018-11-23 13:04:24,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {17712#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {17712#true} is VALID [2018-11-23 13:04:24,075 INFO L273 TraceCheckUtils]: 18: Hoare triple {17712#true} assume !(~i~0 % 4294967296 < 10); {17712#true} is VALID [2018-11-23 13:04:24,076 INFO L273 TraceCheckUtils]: 19: Hoare triple {17712#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {17712#true} is VALID [2018-11-23 13:04:24,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {17712#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {17712#true} is VALID [2018-11-23 13:04:24,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {17712#true} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {17712#true} is VALID [2018-11-23 13:04:24,076 INFO L273 TraceCheckUtils]: 22: Hoare triple {17712#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {17712#true} is VALID [2018-11-23 13:04:24,076 INFO L273 TraceCheckUtils]: 23: Hoare triple {17712#true} assume !(0 != #t~mem2);havoc #t~mem2; {17712#true} is VALID [2018-11-23 13:04:24,077 INFO L273 TraceCheckUtils]: 24: Hoare triple {17712#true} ~cont~0 := 0;~i~0 := 0; {17712#true} is VALID [2018-11-23 13:04:24,077 INFO L273 TraceCheckUtils]: 25: Hoare triple {17712#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {17712#true} is VALID [2018-11-23 13:04:24,077 INFO L273 TraceCheckUtils]: 26: Hoare triple {17712#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17712#true} is VALID [2018-11-23 13:04:24,077 INFO L273 TraceCheckUtils]: 27: Hoare triple {17712#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17712#true} is VALID [2018-11-23 13:04:24,078 INFO L273 TraceCheckUtils]: 28: Hoare triple {17712#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17712#true} is VALID [2018-11-23 13:04:24,078 INFO L273 TraceCheckUtils]: 29: Hoare triple {17712#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17712#true} is VALID [2018-11-23 13:04:24,078 INFO L273 TraceCheckUtils]: 30: Hoare triple {17712#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17712#true} is VALID [2018-11-23 13:04:24,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {17712#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17712#true} is VALID [2018-11-23 13:04:24,078 INFO L273 TraceCheckUtils]: 32: Hoare triple {17712#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17712#true} is VALID [2018-11-23 13:04:24,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {17712#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17712#true} is VALID [2018-11-23 13:04:24,078 INFO L273 TraceCheckUtils]: 34: Hoare triple {17712#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17712#true} is VALID [2018-11-23 13:04:24,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {17712#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17712#true} is VALID [2018-11-23 13:04:24,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {17712#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17712#true} is VALID [2018-11-23 13:04:24,079 INFO L273 TraceCheckUtils]: 37: Hoare triple {17712#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17712#true} is VALID [2018-11-23 13:04:24,079 INFO L273 TraceCheckUtils]: 38: Hoare triple {17712#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17712#true} is VALID [2018-11-23 13:04:24,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {17712#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {17712#true} is VALID [2018-11-23 13:04:24,079 INFO L273 TraceCheckUtils]: 40: Hoare triple {17712#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {17712#true} is VALID [2018-11-23 13:04:24,079 INFO L273 TraceCheckUtils]: 41: Hoare triple {17712#true} assume !(~j~0 % 4294967296 < 8); {17712#true} is VALID [2018-11-23 13:04:24,079 INFO L273 TraceCheckUtils]: 42: Hoare triple {17712#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17712#true} is VALID [2018-11-23 13:04:24,079 INFO L273 TraceCheckUtils]: 43: Hoare triple {17712#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {17712#true} is VALID [2018-11-23 13:04:24,080 INFO L273 TraceCheckUtils]: 44: Hoare triple {17712#true} ~i~0 := 0;~cont_aux~0 := 0; {17712#true} is VALID [2018-11-23 13:04:24,080 INFO L273 TraceCheckUtils]: 45: Hoare triple {17712#true} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {17712#true} is VALID [2018-11-23 13:04:24,080 INFO L273 TraceCheckUtils]: 46: Hoare triple {17712#true} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {17867#(= main_~j~0 0)} is VALID [2018-11-23 13:04:24,080 INFO L273 TraceCheckUtils]: 47: Hoare triple {17867#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17867#(= main_~j~0 0)} is VALID [2018-11-23 13:04:24,098 INFO L273 TraceCheckUtils]: 48: Hoare triple {17867#(= main_~j~0 0)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17867#(= main_~j~0 0)} is VALID [2018-11-23 13:04:24,112 INFO L273 TraceCheckUtils]: 49: Hoare triple {17867#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17877#(= main_~j~0 1)} is VALID [2018-11-23 13:04:24,120 INFO L273 TraceCheckUtils]: 50: Hoare triple {17877#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17877#(= main_~j~0 1)} is VALID [2018-11-23 13:04:24,121 INFO L273 TraceCheckUtils]: 51: Hoare triple {17877#(= main_~j~0 1)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17877#(= main_~j~0 1)} is VALID [2018-11-23 13:04:24,122 INFO L273 TraceCheckUtils]: 52: Hoare triple {17877#(= main_~j~0 1)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17887#(= main_~j~0 2)} is VALID [2018-11-23 13:04:24,122 INFO L273 TraceCheckUtils]: 53: Hoare triple {17887#(= main_~j~0 2)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17887#(= main_~j~0 2)} is VALID [2018-11-23 13:04:24,124 INFO L273 TraceCheckUtils]: 54: Hoare triple {17887#(= main_~j~0 2)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17887#(= main_~j~0 2)} is VALID [2018-11-23 13:04:24,124 INFO L273 TraceCheckUtils]: 55: Hoare triple {17887#(= main_~j~0 2)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17897#(= main_~j~0 3)} is VALID [2018-11-23 13:04:24,124 INFO L273 TraceCheckUtils]: 56: Hoare triple {17897#(= main_~j~0 3)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17897#(= main_~j~0 3)} is VALID [2018-11-23 13:04:24,125 INFO L273 TraceCheckUtils]: 57: Hoare triple {17897#(= main_~j~0 3)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17897#(= main_~j~0 3)} is VALID [2018-11-23 13:04:24,125 INFO L273 TraceCheckUtils]: 58: Hoare triple {17897#(= main_~j~0 3)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17907#(= main_~j~0 4)} is VALID [2018-11-23 13:04:24,125 INFO L273 TraceCheckUtils]: 59: Hoare triple {17907#(= main_~j~0 4)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {17907#(= main_~j~0 4)} is VALID [2018-11-23 13:04:24,126 INFO L273 TraceCheckUtils]: 60: Hoare triple {17907#(= main_~j~0 4)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {17907#(= main_~j~0 4)} is VALID [2018-11-23 13:04:24,126 INFO L273 TraceCheckUtils]: 61: Hoare triple {17907#(= main_~j~0 4)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {17917#(= main_~j~0 5)} is VALID [2018-11-23 13:04:24,126 INFO L273 TraceCheckUtils]: 62: Hoare triple {17917#(= main_~j~0 5)} assume !(~j~0 % 4294967296 < 10); {17713#false} is VALID [2018-11-23 13:04:24,127 INFO L273 TraceCheckUtils]: 63: Hoare triple {17713#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {17713#false} is VALID [2018-11-23 13:04:24,127 INFO L273 TraceCheckUtils]: 64: Hoare triple {17713#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {17713#false} is VALID [2018-11-23 13:04:24,127 INFO L273 TraceCheckUtils]: 65: Hoare triple {17713#false} assume !(0 != #t~mem9);havoc #t~mem9; {17713#false} is VALID [2018-11-23 13:04:24,127 INFO L256 TraceCheckUtils]: 66: Hoare triple {17713#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {17713#false} is VALID [2018-11-23 13:04:24,127 INFO L273 TraceCheckUtils]: 67: Hoare triple {17713#false} ~cond := #in~cond; {17713#false} is VALID [2018-11-23 13:04:24,127 INFO L273 TraceCheckUtils]: 68: Hoare triple {17713#false} assume 0 == ~cond; {17713#false} is VALID [2018-11-23 13:04:24,128 INFO L273 TraceCheckUtils]: 69: Hoare triple {17713#false} assume !false; {17713#false} is VALID [2018-11-23 13:04:24,131 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-23 13:04:24,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:24,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 20 [2018-11-23 13:04:24,154 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-11-23 13:04:24,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:24,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 13:04:24,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:24,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 13:04:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:04:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:04:24,256 INFO L87 Difference]: Start difference. First operand 184 states and 236 transitions. Second operand 20 states. [2018-11-23 13:04:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:39,127 INFO L93 Difference]: Finished difference Result 1063 states and 1460 transitions. [2018-11-23 13:04:39,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-23 13:04:39,127 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2018-11-23 13:04:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:04:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 607 transitions. [2018-11-23 13:04:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:04:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 607 transitions. [2018-11-23 13:04:39,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 607 transitions. [2018-11-23 13:04:39,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 607 edges. 607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:39,943 INFO L225 Difference]: With dead ends: 1063 [2018-11-23 13:04:39,943 INFO L226 Difference]: Without dead ends: 898 [2018-11-23 13:04:39,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=323, Invalid=3459, Unknown=0, NotChecked=0, Total=3782 [2018-11-23 13:04:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-11-23 13:04:41,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 210. [2018-11-23 13:04:41,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:41,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 898 states. Second operand 210 states. [2018-11-23 13:04:41,257 INFO L74 IsIncluded]: Start isIncluded. First operand 898 states. Second operand 210 states. [2018-11-23 13:04:41,257 INFO L87 Difference]: Start difference. First operand 898 states. Second operand 210 states. [2018-11-23 13:04:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:41,287 INFO L93 Difference]: Finished difference Result 898 states and 1207 transitions. [2018-11-23 13:04:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1207 transitions. [2018-11-23 13:04:41,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:41,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:41,289 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 898 states. [2018-11-23 13:04:41,289 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 898 states. [2018-11-23 13:04:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:41,331 INFO L93 Difference]: Finished difference Result 898 states and 1207 transitions. [2018-11-23 13:04:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1207 transitions. [2018-11-23 13:04:41,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:41,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:41,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:41,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 13:04:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 270 transitions. [2018-11-23 13:04:41,338 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 270 transitions. Word has length 70 [2018-11-23 13:04:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:41,338 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 270 transitions. [2018-11-23 13:04:41,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 13:04:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 270 transitions. [2018-11-23 13:04:41,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 13:04:41,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:41,340 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:41,340 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:41,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:41,340 INFO L82 PathProgramCache]: Analyzing trace with hash -296197303, now seen corresponding path program 2 times [2018-11-23 13:04:41,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:41,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:41,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:41,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:42,016 INFO L256 TraceCheckUtils]: 0: Hoare triple {21592#true} call ULTIMATE.init(); {21592#true} is VALID [2018-11-23 13:04:42,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {21592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21592#true} is VALID [2018-11-23 13:04:42,017 INFO L273 TraceCheckUtils]: 2: Hoare triple {21592#true} assume true; {21592#true} is VALID [2018-11-23 13:04:42,017 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21592#true} {21592#true} #112#return; {21592#true} is VALID [2018-11-23 13:04:42,018 INFO L256 TraceCheckUtils]: 4: Hoare triple {21592#true} call #t~ret15 := main(); {21592#true} is VALID [2018-11-23 13:04:42,018 INFO L273 TraceCheckUtils]: 5: Hoare triple {21592#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {21594#(= main_~i~0 0)} is VALID [2018-11-23 13:04:42,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {21594#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21594#(= main_~i~0 0)} is VALID [2018-11-23 13:04:42,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {21594#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21595#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:04:42,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {21595#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21595#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:04:42,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {21595#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21596#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:04:42,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {21596#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21596#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:04:42,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {21596#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21597#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:04:42,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {21597#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21597#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:04:42,026 INFO L273 TraceCheckUtils]: 13: Hoare triple {21597#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21598#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:04:42,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {21598#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21598#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:04:42,028 INFO L273 TraceCheckUtils]: 15: Hoare triple {21598#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21599#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} is VALID [2018-11-23 13:04:42,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {21599#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21599#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} is VALID [2018-11-23 13:04:42,030 INFO L273 TraceCheckUtils]: 17: Hoare triple {21599#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21600#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} is VALID [2018-11-23 13:04:42,030 INFO L273 TraceCheckUtils]: 18: Hoare triple {21600#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21600#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} is VALID [2018-11-23 13:04:42,033 INFO L273 TraceCheckUtils]: 19: Hoare triple {21600#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21601#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 7))} is VALID [2018-11-23 13:04:42,034 INFO L273 TraceCheckUtils]: 20: Hoare triple {21601#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 7))} assume !(~i~0 % 4294967296 < 10); {21593#false} is VALID [2018-11-23 13:04:42,034 INFO L273 TraceCheckUtils]: 21: Hoare triple {21593#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {21593#false} is VALID [2018-11-23 13:04:42,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {21593#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {21593#false} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {21593#false} is VALID [2018-11-23 13:04:42,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {21593#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,035 INFO L273 TraceCheckUtils]: 25: Hoare triple {21593#false} assume !(0 != #t~mem2);havoc #t~mem2; {21593#false} is VALID [2018-11-23 13:04:42,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {21593#false} ~cont~0 := 0;~i~0 := 0; {21593#false} is VALID [2018-11-23 13:04:42,035 INFO L273 TraceCheckUtils]: 27: Hoare triple {21593#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {21593#false} is VALID [2018-11-23 13:04:42,035 INFO L273 TraceCheckUtils]: 28: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,036 INFO L273 TraceCheckUtils]: 29: Hoare triple {21593#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21593#false} is VALID [2018-11-23 13:04:42,036 INFO L273 TraceCheckUtils]: 30: Hoare triple {21593#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21593#false} is VALID [2018-11-23 13:04:42,036 INFO L273 TraceCheckUtils]: 31: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {21593#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21593#false} is VALID [2018-11-23 13:04:42,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {21593#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21593#false} is VALID [2018-11-23 13:04:42,036 INFO L273 TraceCheckUtils]: 34: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,036 INFO L273 TraceCheckUtils]: 35: Hoare triple {21593#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21593#false} is VALID [2018-11-23 13:04:42,036 INFO L273 TraceCheckUtils]: 36: Hoare triple {21593#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21593#false} is VALID [2018-11-23 13:04:42,037 INFO L273 TraceCheckUtils]: 37: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,037 INFO L273 TraceCheckUtils]: 38: Hoare triple {21593#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21593#false} is VALID [2018-11-23 13:04:42,037 INFO L273 TraceCheckUtils]: 39: Hoare triple {21593#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21593#false} is VALID [2018-11-23 13:04:42,037 INFO L273 TraceCheckUtils]: 40: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,037 INFO L273 TraceCheckUtils]: 41: Hoare triple {21593#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21593#false} is VALID [2018-11-23 13:04:42,037 INFO L273 TraceCheckUtils]: 42: Hoare triple {21593#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21593#false} is VALID [2018-11-23 13:04:42,037 INFO L273 TraceCheckUtils]: 43: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,037 INFO L273 TraceCheckUtils]: 44: Hoare triple {21593#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21593#false} is VALID [2018-11-23 13:04:42,038 INFO L273 TraceCheckUtils]: 45: Hoare triple {21593#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21593#false} is VALID [2018-11-23 13:04:42,038 INFO L273 TraceCheckUtils]: 46: Hoare triple {21593#false} assume !(~j~0 % 4294967296 < 8); {21593#false} is VALID [2018-11-23 13:04:42,038 INFO L273 TraceCheckUtils]: 47: Hoare triple {21593#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21593#false} is VALID [2018-11-23 13:04:42,038 INFO L273 TraceCheckUtils]: 48: Hoare triple {21593#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {21593#false} is VALID [2018-11-23 13:04:42,038 INFO L273 TraceCheckUtils]: 49: Hoare triple {21593#false} ~i~0 := 0;~cont_aux~0 := 0; {21593#false} is VALID [2018-11-23 13:04:42,039 INFO L273 TraceCheckUtils]: 50: Hoare triple {21593#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,039 INFO L273 TraceCheckUtils]: 51: Hoare triple {21593#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {21593#false} is VALID [2018-11-23 13:04:42,039 INFO L273 TraceCheckUtils]: 52: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,039 INFO L273 TraceCheckUtils]: 53: Hoare triple {21593#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21593#false} is VALID [2018-11-23 13:04:42,039 INFO L273 TraceCheckUtils]: 54: Hoare triple {21593#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21593#false} is VALID [2018-11-23 13:04:42,039 INFO L273 TraceCheckUtils]: 55: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,039 INFO L273 TraceCheckUtils]: 56: Hoare triple {21593#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21593#false} is VALID [2018-11-23 13:04:42,039 INFO L273 TraceCheckUtils]: 57: Hoare triple {21593#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21593#false} is VALID [2018-11-23 13:04:42,040 INFO L273 TraceCheckUtils]: 58: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,040 INFO L273 TraceCheckUtils]: 59: Hoare triple {21593#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21593#false} is VALID [2018-11-23 13:04:42,040 INFO L273 TraceCheckUtils]: 60: Hoare triple {21593#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21593#false} is VALID [2018-11-23 13:04:42,040 INFO L273 TraceCheckUtils]: 61: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,040 INFO L273 TraceCheckUtils]: 62: Hoare triple {21593#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21593#false} is VALID [2018-11-23 13:04:42,040 INFO L273 TraceCheckUtils]: 63: Hoare triple {21593#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21593#false} is VALID [2018-11-23 13:04:42,040 INFO L273 TraceCheckUtils]: 64: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,040 INFO L273 TraceCheckUtils]: 65: Hoare triple {21593#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21593#false} is VALID [2018-11-23 13:04:42,041 INFO L273 TraceCheckUtils]: 66: Hoare triple {21593#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21593#false} is VALID [2018-11-23 13:04:42,041 INFO L273 TraceCheckUtils]: 67: Hoare triple {21593#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,041 INFO L273 TraceCheckUtils]: 68: Hoare triple {21593#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21593#false} is VALID [2018-11-23 13:04:42,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {21593#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21593#false} is VALID [2018-11-23 13:04:42,041 INFO L273 TraceCheckUtils]: 70: Hoare triple {21593#false} assume !(~j~0 % 4294967296 < 10); {21593#false} is VALID [2018-11-23 13:04:42,041 INFO L273 TraceCheckUtils]: 71: Hoare triple {21593#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21593#false} is VALID [2018-11-23 13:04:42,041 INFO L273 TraceCheckUtils]: 72: Hoare triple {21593#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,041 INFO L273 TraceCheckUtils]: 73: Hoare triple {21593#false} assume !(0 != #t~mem9);havoc #t~mem9; {21593#false} is VALID [2018-11-23 13:04:42,042 INFO L256 TraceCheckUtils]: 74: Hoare triple {21593#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {21593#false} is VALID [2018-11-23 13:04:42,042 INFO L273 TraceCheckUtils]: 75: Hoare triple {21593#false} ~cond := #in~cond; {21593#false} is VALID [2018-11-23 13:04:42,042 INFO L273 TraceCheckUtils]: 76: Hoare triple {21593#false} assume 0 == ~cond; {21593#false} is VALID [2018-11-23 13:04:42,042 INFO L273 TraceCheckUtils]: 77: Hoare triple {21593#false} assume !false; {21593#false} is VALID [2018-11-23 13:04:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-23 13:04:42,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:42,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:42,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:42,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:42,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:42,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:42,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {21592#true} call ULTIMATE.init(); {21592#true} is VALID [2018-11-23 13:04:42,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {21592#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21592#true} is VALID [2018-11-23 13:04:42,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {21592#true} assume true; {21592#true} is VALID [2018-11-23 13:04:42,407 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21592#true} {21592#true} #112#return; {21592#true} is VALID [2018-11-23 13:04:42,407 INFO L256 TraceCheckUtils]: 4: Hoare triple {21592#true} call #t~ret15 := main(); {21592#true} is VALID [2018-11-23 13:04:42,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {21592#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {21594#(= main_~i~0 0)} is VALID [2018-11-23 13:04:42,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {21594#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21594#(= main_~i~0 0)} is VALID [2018-11-23 13:04:42,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {21594#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21626#(= main_~i~0 1)} is VALID [2018-11-23 13:04:42,409 INFO L273 TraceCheckUtils]: 8: Hoare triple {21626#(= main_~i~0 1)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21626#(= main_~i~0 1)} is VALID [2018-11-23 13:04:42,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {21626#(= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21633#(= main_~i~0 2)} is VALID [2018-11-23 13:04:42,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {21633#(= main_~i~0 2)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21633#(= main_~i~0 2)} is VALID [2018-11-23 13:04:42,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {21633#(= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21640#(= main_~i~0 3)} is VALID [2018-11-23 13:04:42,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {21640#(= main_~i~0 3)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21640#(= main_~i~0 3)} is VALID [2018-11-23 13:04:42,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {21640#(= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21647#(= main_~i~0 4)} is VALID [2018-11-23 13:04:42,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {21647#(= main_~i~0 4)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21647#(= main_~i~0 4)} is VALID [2018-11-23 13:04:42,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {21647#(= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21654#(= main_~i~0 5)} is VALID [2018-11-23 13:04:42,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {21654#(= main_~i~0 5)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21654#(= main_~i~0 5)} is VALID [2018-11-23 13:04:42,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {21654#(= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21661#(= main_~i~0 6)} is VALID [2018-11-23 13:04:42,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {21661#(= main_~i~0 6)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {21592#true} is VALID [2018-11-23 13:04:42,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {21592#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {21592#true} is VALID [2018-11-23 13:04:42,416 INFO L273 TraceCheckUtils]: 20: Hoare triple {21592#true} assume !(~i~0 % 4294967296 < 10); {21592#true} is VALID [2018-11-23 13:04:42,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {21592#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {21592#true} is VALID [2018-11-23 13:04:42,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {21592#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {21592#true} is VALID [2018-11-23 13:04:42,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {21592#true} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {21592#true} is VALID [2018-11-23 13:04:42,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {21592#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {21592#true} is VALID [2018-11-23 13:04:42,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {21592#true} assume !(0 != #t~mem2);havoc #t~mem2; {21592#true} is VALID [2018-11-23 13:04:42,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {21592#true} ~cont~0 := 0;~i~0 := 0; {21592#true} is VALID [2018-11-23 13:04:42,418 INFO L273 TraceCheckUtils]: 27: Hoare triple {21592#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {21592#true} is VALID [2018-11-23 13:04:42,418 INFO L273 TraceCheckUtils]: 28: Hoare triple {21592#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21592#true} is VALID [2018-11-23 13:04:42,418 INFO L273 TraceCheckUtils]: 29: Hoare triple {21592#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21592#true} is VALID [2018-11-23 13:04:42,418 INFO L273 TraceCheckUtils]: 30: Hoare triple {21592#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21592#true} is VALID [2018-11-23 13:04:42,419 INFO L273 TraceCheckUtils]: 31: Hoare triple {21592#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21592#true} is VALID [2018-11-23 13:04:42,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {21592#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21592#true} is VALID [2018-11-23 13:04:42,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {21592#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21592#true} is VALID [2018-11-23 13:04:42,419 INFO L273 TraceCheckUtils]: 34: Hoare triple {21592#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21592#true} is VALID [2018-11-23 13:04:42,419 INFO L273 TraceCheckUtils]: 35: Hoare triple {21592#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21592#true} is VALID [2018-11-23 13:04:42,420 INFO L273 TraceCheckUtils]: 36: Hoare triple {21592#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21592#true} is VALID [2018-11-23 13:04:42,420 INFO L273 TraceCheckUtils]: 37: Hoare triple {21592#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21592#true} is VALID [2018-11-23 13:04:42,420 INFO L273 TraceCheckUtils]: 38: Hoare triple {21592#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21592#true} is VALID [2018-11-23 13:04:42,420 INFO L273 TraceCheckUtils]: 39: Hoare triple {21592#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21592#true} is VALID [2018-11-23 13:04:42,420 INFO L273 TraceCheckUtils]: 40: Hoare triple {21592#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21592#true} is VALID [2018-11-23 13:04:42,420 INFO L273 TraceCheckUtils]: 41: Hoare triple {21592#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21592#true} is VALID [2018-11-23 13:04:42,420 INFO L273 TraceCheckUtils]: 42: Hoare triple {21592#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21592#true} is VALID [2018-11-23 13:04:42,420 INFO L273 TraceCheckUtils]: 43: Hoare triple {21592#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21592#true} is VALID [2018-11-23 13:04:42,421 INFO L273 TraceCheckUtils]: 44: Hoare triple {21592#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {21592#true} is VALID [2018-11-23 13:04:42,421 INFO L273 TraceCheckUtils]: 45: Hoare triple {21592#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {21592#true} is VALID [2018-11-23 13:04:42,421 INFO L273 TraceCheckUtils]: 46: Hoare triple {21592#true} assume !(~j~0 % 4294967296 < 8); {21592#true} is VALID [2018-11-23 13:04:42,421 INFO L273 TraceCheckUtils]: 47: Hoare triple {21592#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21592#true} is VALID [2018-11-23 13:04:42,421 INFO L273 TraceCheckUtils]: 48: Hoare triple {21592#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {21592#true} is VALID [2018-11-23 13:04:42,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {21592#true} ~i~0 := 0;~cont_aux~0 := 0; {21592#true} is VALID [2018-11-23 13:04:42,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {21592#true} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {21592#true} is VALID [2018-11-23 13:04:42,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {21592#true} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {21764#(= main_~j~0 0)} is VALID [2018-11-23 13:04:42,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {21764#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21764#(= main_~j~0 0)} is VALID [2018-11-23 13:04:42,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {21764#(= main_~j~0 0)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21764#(= main_~j~0 0)} is VALID [2018-11-23 13:04:42,423 INFO L273 TraceCheckUtils]: 54: Hoare triple {21764#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21774#(= main_~j~0 1)} is VALID [2018-11-23 13:04:42,423 INFO L273 TraceCheckUtils]: 55: Hoare triple {21774#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21774#(= main_~j~0 1)} is VALID [2018-11-23 13:04:42,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {21774#(= main_~j~0 1)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21774#(= main_~j~0 1)} is VALID [2018-11-23 13:04:42,424 INFO L273 TraceCheckUtils]: 57: Hoare triple {21774#(= main_~j~0 1)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21784#(= main_~j~0 2)} is VALID [2018-11-23 13:04:42,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {21784#(= main_~j~0 2)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21784#(= main_~j~0 2)} is VALID [2018-11-23 13:04:42,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {21784#(= main_~j~0 2)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21784#(= main_~j~0 2)} is VALID [2018-11-23 13:04:42,425 INFO L273 TraceCheckUtils]: 60: Hoare triple {21784#(= main_~j~0 2)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21794#(= main_~j~0 3)} is VALID [2018-11-23 13:04:42,426 INFO L273 TraceCheckUtils]: 61: Hoare triple {21794#(= main_~j~0 3)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21794#(= main_~j~0 3)} is VALID [2018-11-23 13:04:42,426 INFO L273 TraceCheckUtils]: 62: Hoare triple {21794#(= main_~j~0 3)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21794#(= main_~j~0 3)} is VALID [2018-11-23 13:04:42,427 INFO L273 TraceCheckUtils]: 63: Hoare triple {21794#(= main_~j~0 3)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21804#(= main_~j~0 4)} is VALID [2018-11-23 13:04:42,427 INFO L273 TraceCheckUtils]: 64: Hoare triple {21804#(= main_~j~0 4)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21804#(= main_~j~0 4)} is VALID [2018-11-23 13:04:42,428 INFO L273 TraceCheckUtils]: 65: Hoare triple {21804#(= main_~j~0 4)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21804#(= main_~j~0 4)} is VALID [2018-11-23 13:04:42,429 INFO L273 TraceCheckUtils]: 66: Hoare triple {21804#(= main_~j~0 4)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21814#(= main_~j~0 5)} is VALID [2018-11-23 13:04:42,429 INFO L273 TraceCheckUtils]: 67: Hoare triple {21814#(= main_~j~0 5)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {21814#(= main_~j~0 5)} is VALID [2018-11-23 13:04:42,430 INFO L273 TraceCheckUtils]: 68: Hoare triple {21814#(= main_~j~0 5)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {21814#(= main_~j~0 5)} is VALID [2018-11-23 13:04:42,430 INFO L273 TraceCheckUtils]: 69: Hoare triple {21814#(= main_~j~0 5)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {21824#(= main_~j~0 6)} is VALID [2018-11-23 13:04:42,431 INFO L273 TraceCheckUtils]: 70: Hoare triple {21824#(= main_~j~0 6)} assume !(~j~0 % 4294967296 < 10); {21593#false} is VALID [2018-11-23 13:04:42,431 INFO L273 TraceCheckUtils]: 71: Hoare triple {21593#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {21593#false} is VALID [2018-11-23 13:04:42,431 INFO L273 TraceCheckUtils]: 72: Hoare triple {21593#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {21593#false} is VALID [2018-11-23 13:04:42,432 INFO L273 TraceCheckUtils]: 73: Hoare triple {21593#false} assume !(0 != #t~mem9);havoc #t~mem9; {21593#false} is VALID [2018-11-23 13:04:42,432 INFO L256 TraceCheckUtils]: 74: Hoare triple {21593#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {21593#false} is VALID [2018-11-23 13:04:42,432 INFO L273 TraceCheckUtils]: 75: Hoare triple {21593#false} ~cond := #in~cond; {21593#false} is VALID [2018-11-23 13:04:42,432 INFO L273 TraceCheckUtils]: 76: Hoare triple {21593#false} assume 0 == ~cond; {21593#false} is VALID [2018-11-23 13:04:42,433 INFO L273 TraceCheckUtils]: 77: Hoare triple {21593#false} assume !false; {21593#false} is VALID [2018-11-23 13:04:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-23 13:04:42,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:42,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16] total 23 [2018-11-23 13:04:42,457 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-11-23 13:04:42,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:42,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 13:04:42,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:42,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 13:04:42,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 13:04:42,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:04:42,560 INFO L87 Difference]: Start difference. First operand 210 states and 270 transitions. Second operand 23 states. [2018-11-23 13:05:05,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,015 INFO L93 Difference]: Finished difference Result 1306 states and 1790 transitions. [2018-11-23 13:05:05,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-11-23 13:05:05,015 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 78 [2018-11-23 13:05:05,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:05,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 750 transitions. [2018-11-23 13:05:05,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:05:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 750 transitions. [2018-11-23 13:05:05,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 73 states and 750 transitions. [2018-11-23 13:05:06,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 750 edges. 750 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:06,077 INFO L225 Difference]: With dead ends: 1306 [2018-11-23 13:05:06,077 INFO L226 Difference]: Without dead ends: 1117 [2018-11-23 13:05:06,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1910 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=426, Invalid=5736, Unknown=0, NotChecked=0, Total=6162 [2018-11-23 13:05:06,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2018-11-23 13:05:07,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 236. [2018-11-23 13:05:07,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:07,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1117 states. Second operand 236 states. [2018-11-23 13:05:07,565 INFO L74 IsIncluded]: Start isIncluded. First operand 1117 states. Second operand 236 states. [2018-11-23 13:05:07,565 INFO L87 Difference]: Start difference. First operand 1117 states. Second operand 236 states. [2018-11-23 13:05:07,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,612 INFO L93 Difference]: Finished difference Result 1117 states and 1501 transitions. [2018-11-23 13:05:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1501 transitions. [2018-11-23 13:05:07,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:07,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:07,614 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand 1117 states. [2018-11-23 13:05:07,614 INFO L87 Difference]: Start difference. First operand 236 states. Second operand 1117 states. [2018-11-23 13:05:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:07,664 INFO L93 Difference]: Finished difference Result 1117 states and 1501 transitions. [2018-11-23 13:05:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1501 transitions. [2018-11-23 13:05:07,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:07,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:07,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:07,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-23 13:05:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2018-11-23 13:05:07,670 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 78 [2018-11-23 13:05:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:07,670 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2018-11-23 13:05:07,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 13:05:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2018-11-23 13:05:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 13:05:07,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:07,671 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:07,671 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:07,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2141584982, now seen corresponding path program 3 times [2018-11-23 13:05:07,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:07,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:07,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:10,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {26339#true} call ULTIMATE.init(); {26339#true} is VALID [2018-11-23 13:05:10,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {26339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26339#true} is VALID [2018-11-23 13:05:10,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {26339#true} assume true; {26339#true} is VALID [2018-11-23 13:05:10,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26339#true} {26339#true} #112#return; {26339#true} is VALID [2018-11-23 13:05:10,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {26339#true} call #t~ret15 := main(); {26339#true} is VALID [2018-11-23 13:05:10,833 INFO L273 TraceCheckUtils]: 5: Hoare triple {26339#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {26341#(= main_~i~0 0)} is VALID [2018-11-23 13:05:10,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {26341#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26341#(= main_~i~0 0)} is VALID [2018-11-23 13:05:10,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {26341#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26342#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:05:10,834 INFO L273 TraceCheckUtils]: 8: Hoare triple {26342#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26342#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:05:10,836 INFO L273 TraceCheckUtils]: 9: Hoare triple {26342#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26343#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:05:10,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {26343#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26343#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:05:10,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {26343#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26344#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:05:10,838 INFO L273 TraceCheckUtils]: 12: Hoare triple {26344#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26344#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:05:10,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {26344#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26345#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:05:10,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {26345#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26345#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:05:10,850 INFO L273 TraceCheckUtils]: 15: Hoare triple {26345#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26346#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} is VALID [2018-11-23 13:05:10,850 INFO L273 TraceCheckUtils]: 16: Hoare triple {26346#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26346#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} is VALID [2018-11-23 13:05:10,852 INFO L273 TraceCheckUtils]: 17: Hoare triple {26346#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26347#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} is VALID [2018-11-23 13:05:10,852 INFO L273 TraceCheckUtils]: 18: Hoare triple {26347#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26347#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} is VALID [2018-11-23 13:05:10,854 INFO L273 TraceCheckUtils]: 19: Hoare triple {26347#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26348#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967288) 4294967296)) 7) main_~i~0)} is VALID [2018-11-23 13:05:10,854 INFO L273 TraceCheckUtils]: 20: Hoare triple {26348#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967288) 4294967296)) 7) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26348#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967288) 4294967296)) 7) main_~i~0)} is VALID [2018-11-23 13:05:10,856 INFO L273 TraceCheckUtils]: 21: Hoare triple {26348#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967288) 4294967296)) 7) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26349#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 8))} is VALID [2018-11-23 13:05:10,856 INFO L273 TraceCheckUtils]: 22: Hoare triple {26349#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 8))} assume !(~i~0 % 4294967296 < 10); {26340#false} is VALID [2018-11-23 13:05:10,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {26340#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {26340#false} is VALID [2018-11-23 13:05:10,856 INFO L273 TraceCheckUtils]: 24: Hoare triple {26340#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,857 INFO L273 TraceCheckUtils]: 25: Hoare triple {26340#false} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {26340#false} is VALID [2018-11-23 13:05:10,857 INFO L273 TraceCheckUtils]: 26: Hoare triple {26340#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {26340#false} assume !(0 != #t~mem2);havoc #t~mem2; {26340#false} is VALID [2018-11-23 13:05:10,857 INFO L273 TraceCheckUtils]: 28: Hoare triple {26340#false} ~cont~0 := 0;~i~0 := 0; {26340#false} is VALID [2018-11-23 13:05:10,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {26340#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {26340#false} is VALID [2018-11-23 13:05:10,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,857 INFO L273 TraceCheckUtils]: 31: Hoare triple {26340#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26340#false} is VALID [2018-11-23 13:05:10,857 INFO L273 TraceCheckUtils]: 32: Hoare triple {26340#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26340#false} is VALID [2018-11-23 13:05:10,858 INFO L273 TraceCheckUtils]: 33: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,858 INFO L273 TraceCheckUtils]: 34: Hoare triple {26340#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26340#false} is VALID [2018-11-23 13:05:10,858 INFO L273 TraceCheckUtils]: 35: Hoare triple {26340#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26340#false} is VALID [2018-11-23 13:05:10,858 INFO L273 TraceCheckUtils]: 36: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,858 INFO L273 TraceCheckUtils]: 37: Hoare triple {26340#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26340#false} is VALID [2018-11-23 13:05:10,858 INFO L273 TraceCheckUtils]: 38: Hoare triple {26340#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26340#false} is VALID [2018-11-23 13:05:10,858 INFO L273 TraceCheckUtils]: 39: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,858 INFO L273 TraceCheckUtils]: 40: Hoare triple {26340#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26340#false} is VALID [2018-11-23 13:05:10,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {26340#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26340#false} is VALID [2018-11-23 13:05:10,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,859 INFO L273 TraceCheckUtils]: 43: Hoare triple {26340#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26340#false} is VALID [2018-11-23 13:05:10,859 INFO L273 TraceCheckUtils]: 44: Hoare triple {26340#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26340#false} is VALID [2018-11-23 13:05:10,859 INFO L273 TraceCheckUtils]: 45: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,859 INFO L273 TraceCheckUtils]: 46: Hoare triple {26340#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26340#false} is VALID [2018-11-23 13:05:10,859 INFO L273 TraceCheckUtils]: 47: Hoare triple {26340#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26340#false} is VALID [2018-11-23 13:05:10,859 INFO L273 TraceCheckUtils]: 48: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,860 INFO L273 TraceCheckUtils]: 49: Hoare triple {26340#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26340#false} is VALID [2018-11-23 13:05:10,860 INFO L273 TraceCheckUtils]: 50: Hoare triple {26340#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26340#false} is VALID [2018-11-23 13:05:10,860 INFO L273 TraceCheckUtils]: 51: Hoare triple {26340#false} assume !(~j~0 % 4294967296 < 8); {26340#false} is VALID [2018-11-23 13:05:10,860 INFO L273 TraceCheckUtils]: 52: Hoare triple {26340#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26340#false} is VALID [2018-11-23 13:05:10,860 INFO L273 TraceCheckUtils]: 53: Hoare triple {26340#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {26340#false} is VALID [2018-11-23 13:05:10,860 INFO L273 TraceCheckUtils]: 54: Hoare triple {26340#false} ~i~0 := 0;~cont_aux~0 := 0; {26340#false} is VALID [2018-11-23 13:05:10,860 INFO L273 TraceCheckUtils]: 55: Hoare triple {26340#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,860 INFO L273 TraceCheckUtils]: 56: Hoare triple {26340#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {26340#false} is VALID [2018-11-23 13:05:10,860 INFO L273 TraceCheckUtils]: 57: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,861 INFO L273 TraceCheckUtils]: 58: Hoare triple {26340#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26340#false} is VALID [2018-11-23 13:05:10,861 INFO L273 TraceCheckUtils]: 59: Hoare triple {26340#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26340#false} is VALID [2018-11-23 13:05:10,861 INFO L273 TraceCheckUtils]: 60: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,861 INFO L273 TraceCheckUtils]: 61: Hoare triple {26340#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26340#false} is VALID [2018-11-23 13:05:10,861 INFO L273 TraceCheckUtils]: 62: Hoare triple {26340#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26340#false} is VALID [2018-11-23 13:05:10,861 INFO L273 TraceCheckUtils]: 63: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,861 INFO L273 TraceCheckUtils]: 64: Hoare triple {26340#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26340#false} is VALID [2018-11-23 13:05:10,861 INFO L273 TraceCheckUtils]: 65: Hoare triple {26340#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26340#false} is VALID [2018-11-23 13:05:10,862 INFO L273 TraceCheckUtils]: 66: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,862 INFO L273 TraceCheckUtils]: 67: Hoare triple {26340#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26340#false} is VALID [2018-11-23 13:05:10,862 INFO L273 TraceCheckUtils]: 68: Hoare triple {26340#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26340#false} is VALID [2018-11-23 13:05:10,862 INFO L273 TraceCheckUtils]: 69: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,862 INFO L273 TraceCheckUtils]: 70: Hoare triple {26340#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26340#false} is VALID [2018-11-23 13:05:10,862 INFO L273 TraceCheckUtils]: 71: Hoare triple {26340#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26340#false} is VALID [2018-11-23 13:05:10,862 INFO L273 TraceCheckUtils]: 72: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,862 INFO L273 TraceCheckUtils]: 73: Hoare triple {26340#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26340#false} is VALID [2018-11-23 13:05:10,862 INFO L273 TraceCheckUtils]: 74: Hoare triple {26340#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26340#false} is VALID [2018-11-23 13:05:10,863 INFO L273 TraceCheckUtils]: 75: Hoare triple {26340#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,863 INFO L273 TraceCheckUtils]: 76: Hoare triple {26340#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26340#false} is VALID [2018-11-23 13:05:10,863 INFO L273 TraceCheckUtils]: 77: Hoare triple {26340#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26340#false} is VALID [2018-11-23 13:05:10,863 INFO L273 TraceCheckUtils]: 78: Hoare triple {26340#false} assume !(~j~0 % 4294967296 < 10); {26340#false} is VALID [2018-11-23 13:05:10,863 INFO L273 TraceCheckUtils]: 79: Hoare triple {26340#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {26340#false} is VALID [2018-11-23 13:05:10,863 INFO L273 TraceCheckUtils]: 80: Hoare triple {26340#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:10,863 INFO L273 TraceCheckUtils]: 81: Hoare triple {26340#false} assume !(0 != #t~mem9);havoc #t~mem9; {26340#false} is VALID [2018-11-23 13:05:10,863 INFO L256 TraceCheckUtils]: 82: Hoare triple {26340#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {26340#false} is VALID [2018-11-23 13:05:10,864 INFO L273 TraceCheckUtils]: 83: Hoare triple {26340#false} ~cond := #in~cond; {26340#false} is VALID [2018-11-23 13:05:10,864 INFO L273 TraceCheckUtils]: 84: Hoare triple {26340#false} assume 0 == ~cond; {26340#false} is VALID [2018-11-23 13:05:10,864 INFO L273 TraceCheckUtils]: 85: Hoare triple {26340#false} assume !false; {26340#false} is VALID [2018-11-23 13:05:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 13:05:10,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:10,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:10,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:05:11,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 13:05:11,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:11,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:11,801 INFO L256 TraceCheckUtils]: 0: Hoare triple {26339#true} call ULTIMATE.init(); {26339#true} is VALID [2018-11-23 13:05:11,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {26339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26339#true} is VALID [2018-11-23 13:05:11,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {26339#true} assume true; {26339#true} is VALID [2018-11-23 13:05:11,802 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26339#true} {26339#true} #112#return; {26339#true} is VALID [2018-11-23 13:05:11,802 INFO L256 TraceCheckUtils]: 4: Hoare triple {26339#true} call #t~ret15 := main(); {26339#true} is VALID [2018-11-23 13:05:11,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {26339#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {26341#(= main_~i~0 0)} is VALID [2018-11-23 13:05:11,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {26341#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26341#(= main_~i~0 0)} is VALID [2018-11-23 13:05:11,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {26341#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26374#(= main_~i~0 1)} is VALID [2018-11-23 13:05:11,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {26374#(= main_~i~0 1)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26374#(= main_~i~0 1)} is VALID [2018-11-23 13:05:11,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {26374#(= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26381#(= main_~i~0 2)} is VALID [2018-11-23 13:05:11,805 INFO L273 TraceCheckUtils]: 10: Hoare triple {26381#(= main_~i~0 2)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26381#(= main_~i~0 2)} is VALID [2018-11-23 13:05:11,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {26381#(= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26388#(= main_~i~0 3)} is VALID [2018-11-23 13:05:11,805 INFO L273 TraceCheckUtils]: 12: Hoare triple {26388#(= main_~i~0 3)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26388#(= main_~i~0 3)} is VALID [2018-11-23 13:05:11,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {26388#(= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26395#(= main_~i~0 4)} is VALID [2018-11-23 13:05:11,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {26395#(= main_~i~0 4)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26395#(= main_~i~0 4)} is VALID [2018-11-23 13:05:11,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {26395#(= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26402#(= main_~i~0 5)} is VALID [2018-11-23 13:05:11,807 INFO L273 TraceCheckUtils]: 16: Hoare triple {26402#(= main_~i~0 5)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26402#(= main_~i~0 5)} is VALID [2018-11-23 13:05:11,808 INFO L273 TraceCheckUtils]: 17: Hoare triple {26402#(= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26409#(= main_~i~0 6)} is VALID [2018-11-23 13:05:11,809 INFO L273 TraceCheckUtils]: 18: Hoare triple {26409#(= main_~i~0 6)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26409#(= main_~i~0 6)} is VALID [2018-11-23 13:05:11,809 INFO L273 TraceCheckUtils]: 19: Hoare triple {26409#(= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26416#(= main_~i~0 7)} is VALID [2018-11-23 13:05:11,810 INFO L273 TraceCheckUtils]: 20: Hoare triple {26416#(= main_~i~0 7)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {26339#true} is VALID [2018-11-23 13:05:11,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {26339#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {26339#true} is VALID [2018-11-23 13:05:11,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {26339#true} assume !(~i~0 % 4294967296 < 10); {26339#true} is VALID [2018-11-23 13:05:11,810 INFO L273 TraceCheckUtils]: 23: Hoare triple {26339#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {26339#true} is VALID [2018-11-23 13:05:11,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {26339#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {26339#true} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {26339#true} is VALID [2018-11-23 13:05:11,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {26339#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,811 INFO L273 TraceCheckUtils]: 27: Hoare triple {26339#true} assume !(0 != #t~mem2);havoc #t~mem2; {26339#true} is VALID [2018-11-23 13:05:11,811 INFO L273 TraceCheckUtils]: 28: Hoare triple {26339#true} ~cont~0 := 0;~i~0 := 0; {26339#true} is VALID [2018-11-23 13:05:11,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {26339#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {26339#true} is VALID [2018-11-23 13:05:11,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {26339#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {26339#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26339#true} is VALID [2018-11-23 13:05:11,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {26339#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26339#true} is VALID [2018-11-23 13:05:11,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {26339#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,812 INFO L273 TraceCheckUtils]: 34: Hoare triple {26339#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26339#true} is VALID [2018-11-23 13:05:11,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {26339#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26339#true} is VALID [2018-11-23 13:05:11,813 INFO L273 TraceCheckUtils]: 36: Hoare triple {26339#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,813 INFO L273 TraceCheckUtils]: 37: Hoare triple {26339#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26339#true} is VALID [2018-11-23 13:05:11,813 INFO L273 TraceCheckUtils]: 38: Hoare triple {26339#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26339#true} is VALID [2018-11-23 13:05:11,814 INFO L273 TraceCheckUtils]: 39: Hoare triple {26339#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,814 INFO L273 TraceCheckUtils]: 40: Hoare triple {26339#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26339#true} is VALID [2018-11-23 13:05:11,814 INFO L273 TraceCheckUtils]: 41: Hoare triple {26339#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26339#true} is VALID [2018-11-23 13:05:11,814 INFO L273 TraceCheckUtils]: 42: Hoare triple {26339#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,814 INFO L273 TraceCheckUtils]: 43: Hoare triple {26339#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26339#true} is VALID [2018-11-23 13:05:11,814 INFO L273 TraceCheckUtils]: 44: Hoare triple {26339#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26339#true} is VALID [2018-11-23 13:05:11,814 INFO L273 TraceCheckUtils]: 45: Hoare triple {26339#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,815 INFO L273 TraceCheckUtils]: 46: Hoare triple {26339#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26339#true} is VALID [2018-11-23 13:05:11,815 INFO L273 TraceCheckUtils]: 47: Hoare triple {26339#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26339#true} is VALID [2018-11-23 13:05:11,815 INFO L273 TraceCheckUtils]: 48: Hoare triple {26339#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,815 INFO L273 TraceCheckUtils]: 49: Hoare triple {26339#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {26339#true} is VALID [2018-11-23 13:05:11,815 INFO L273 TraceCheckUtils]: 50: Hoare triple {26339#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {26339#true} is VALID [2018-11-23 13:05:11,815 INFO L273 TraceCheckUtils]: 51: Hoare triple {26339#true} assume !(~j~0 % 4294967296 < 8); {26339#true} is VALID [2018-11-23 13:05:11,815 INFO L273 TraceCheckUtils]: 52: Hoare triple {26339#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26339#true} is VALID [2018-11-23 13:05:11,815 INFO L273 TraceCheckUtils]: 53: Hoare triple {26339#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {26339#true} is VALID [2018-11-23 13:05:11,816 INFO L273 TraceCheckUtils]: 54: Hoare triple {26339#true} ~i~0 := 0;~cont_aux~0 := 0; {26339#true} is VALID [2018-11-23 13:05:11,816 INFO L273 TraceCheckUtils]: 55: Hoare triple {26339#true} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {26339#true} is VALID [2018-11-23 13:05:11,816 INFO L273 TraceCheckUtils]: 56: Hoare triple {26339#true} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {26528#(= main_~j~0 0)} is VALID [2018-11-23 13:05:11,816 INFO L273 TraceCheckUtils]: 57: Hoare triple {26528#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26528#(= main_~j~0 0)} is VALID [2018-11-23 13:05:11,817 INFO L273 TraceCheckUtils]: 58: Hoare triple {26528#(= main_~j~0 0)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26528#(= main_~j~0 0)} is VALID [2018-11-23 13:05:11,817 INFO L273 TraceCheckUtils]: 59: Hoare triple {26528#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26538#(= main_~j~0 1)} is VALID [2018-11-23 13:05:11,817 INFO L273 TraceCheckUtils]: 60: Hoare triple {26538#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26538#(= main_~j~0 1)} is VALID [2018-11-23 13:05:11,818 INFO L273 TraceCheckUtils]: 61: Hoare triple {26538#(= main_~j~0 1)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26538#(= main_~j~0 1)} is VALID [2018-11-23 13:05:11,818 INFO L273 TraceCheckUtils]: 62: Hoare triple {26538#(= main_~j~0 1)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26548#(= main_~j~0 2)} is VALID [2018-11-23 13:05:11,818 INFO L273 TraceCheckUtils]: 63: Hoare triple {26548#(= main_~j~0 2)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26548#(= main_~j~0 2)} is VALID [2018-11-23 13:05:11,819 INFO L273 TraceCheckUtils]: 64: Hoare triple {26548#(= main_~j~0 2)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26548#(= main_~j~0 2)} is VALID [2018-11-23 13:05:11,819 INFO L273 TraceCheckUtils]: 65: Hoare triple {26548#(= main_~j~0 2)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26558#(= main_~j~0 3)} is VALID [2018-11-23 13:05:11,820 INFO L273 TraceCheckUtils]: 66: Hoare triple {26558#(= main_~j~0 3)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26558#(= main_~j~0 3)} is VALID [2018-11-23 13:05:11,820 INFO L273 TraceCheckUtils]: 67: Hoare triple {26558#(= main_~j~0 3)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26558#(= main_~j~0 3)} is VALID [2018-11-23 13:05:11,821 INFO L273 TraceCheckUtils]: 68: Hoare triple {26558#(= main_~j~0 3)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26568#(= main_~j~0 4)} is VALID [2018-11-23 13:05:11,821 INFO L273 TraceCheckUtils]: 69: Hoare triple {26568#(= main_~j~0 4)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26568#(= main_~j~0 4)} is VALID [2018-11-23 13:05:11,822 INFO L273 TraceCheckUtils]: 70: Hoare triple {26568#(= main_~j~0 4)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26568#(= main_~j~0 4)} is VALID [2018-11-23 13:05:11,822 INFO L273 TraceCheckUtils]: 71: Hoare triple {26568#(= main_~j~0 4)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26578#(= main_~j~0 5)} is VALID [2018-11-23 13:05:11,823 INFO L273 TraceCheckUtils]: 72: Hoare triple {26578#(= main_~j~0 5)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26578#(= main_~j~0 5)} is VALID [2018-11-23 13:05:11,823 INFO L273 TraceCheckUtils]: 73: Hoare triple {26578#(= main_~j~0 5)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26578#(= main_~j~0 5)} is VALID [2018-11-23 13:05:11,824 INFO L273 TraceCheckUtils]: 74: Hoare triple {26578#(= main_~j~0 5)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26588#(= main_~j~0 6)} is VALID [2018-11-23 13:05:11,825 INFO L273 TraceCheckUtils]: 75: Hoare triple {26588#(= main_~j~0 6)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {26588#(= main_~j~0 6)} is VALID [2018-11-23 13:05:11,825 INFO L273 TraceCheckUtils]: 76: Hoare triple {26588#(= main_~j~0 6)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {26588#(= main_~j~0 6)} is VALID [2018-11-23 13:05:11,826 INFO L273 TraceCheckUtils]: 77: Hoare triple {26588#(= main_~j~0 6)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {26598#(= main_~j~0 7)} is VALID [2018-11-23 13:05:11,826 INFO L273 TraceCheckUtils]: 78: Hoare triple {26598#(= main_~j~0 7)} assume !(~j~0 % 4294967296 < 10); {26340#false} is VALID [2018-11-23 13:05:11,827 INFO L273 TraceCheckUtils]: 79: Hoare triple {26340#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {26340#false} is VALID [2018-11-23 13:05:11,827 INFO L273 TraceCheckUtils]: 80: Hoare triple {26340#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {26340#false} is VALID [2018-11-23 13:05:11,827 INFO L273 TraceCheckUtils]: 81: Hoare triple {26340#false} assume !(0 != #t~mem9);havoc #t~mem9; {26340#false} is VALID [2018-11-23 13:05:11,827 INFO L256 TraceCheckUtils]: 82: Hoare triple {26340#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {26340#false} is VALID [2018-11-23 13:05:11,827 INFO L273 TraceCheckUtils]: 83: Hoare triple {26340#false} ~cond := #in~cond; {26340#false} is VALID [2018-11-23 13:05:11,828 INFO L273 TraceCheckUtils]: 84: Hoare triple {26340#false} assume 0 == ~cond; {26340#false} is VALID [2018-11-23 13:05:11,828 INFO L273 TraceCheckUtils]: 85: Hoare triple {26340#false} assume !false; {26340#false} is VALID [2018-11-23 13:05:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 2 proven. 134 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-23 13:05:11,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:11,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 26 [2018-11-23 13:05:11,852 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2018-11-23 13:05:11,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:11,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 13:05:11,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:11,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 13:05:11,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 13:05:11,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=578, Unknown=1, NotChecked=0, Total=650 [2018-11-23 13:05:11,967 INFO L87 Difference]: Start difference. First operand 236 states and 304 transitions. Second operand 26 states. [2018-11-23 13:05:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:40,783 INFO L93 Difference]: Finished difference Result 1573 states and 2152 transitions. [2018-11-23 13:05:40,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-11-23 13:05:40,783 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 86 [2018-11-23 13:05:40,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:05:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 909 transitions. [2018-11-23 13:05:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:05:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 909 transitions. [2018-11-23 13:05:40,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 91 states and 909 transitions. [2018-11-23 13:05:41,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 909 edges. 909 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:41,995 INFO L225 Difference]: With dead ends: 1573 [2018-11-23 13:05:41,995 INFO L226 Difference]: Without dead ends: 1360 [2018-11-23 13:05:41,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3103 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=543, Invalid=8962, Unknown=1, NotChecked=0, Total=9506 [2018-11-23 13:05:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2018-11-23 13:05:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 262. [2018-11-23 13:05:43,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:43,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1360 states. Second operand 262 states. [2018-11-23 13:05:43,550 INFO L74 IsIncluded]: Start isIncluded. First operand 1360 states. Second operand 262 states. [2018-11-23 13:05:43,550 INFO L87 Difference]: Start difference. First operand 1360 states. Second operand 262 states. [2018-11-23 13:05:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:43,619 INFO L93 Difference]: Finished difference Result 1360 states and 1827 transitions. [2018-11-23 13:05:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1827 transitions. [2018-11-23 13:05:43,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:43,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:43,621 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand 1360 states. [2018-11-23 13:05:43,621 INFO L87 Difference]: Start difference. First operand 262 states. Second operand 1360 states. [2018-11-23 13:05:43,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:43,699 INFO L93 Difference]: Finished difference Result 1360 states and 1827 transitions. [2018-11-23 13:05:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1827 transitions. [2018-11-23 13:05:43,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:43,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:43,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:43,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-23 13:05:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 338 transitions. [2018-11-23 13:05:43,707 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 338 transitions. Word has length 86 [2018-11-23 13:05:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:43,707 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 338 transitions. [2018-11-23 13:05:43,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 13:05:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 338 transitions. [2018-11-23 13:05:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 13:05:43,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:43,708 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:43,709 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:43,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1457696531, now seen corresponding path program 4 times [2018-11-23 13:05:43,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:43,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:43,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:43,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:43,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:44,690 INFO L256 TraceCheckUtils]: 0: Hoare triple {32039#true} call ULTIMATE.init(); {32039#true} is VALID [2018-11-23 13:05:44,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {32039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32039#true} is VALID [2018-11-23 13:05:44,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {32039#true} assume true; {32039#true} is VALID [2018-11-23 13:05:44,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32039#true} {32039#true} #112#return; {32039#true} is VALID [2018-11-23 13:05:44,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {32039#true} call #t~ret15 := main(); {32039#true} is VALID [2018-11-23 13:05:44,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {32039#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {32041#(= main_~i~0 0)} is VALID [2018-11-23 13:05:44,693 INFO L273 TraceCheckUtils]: 6: Hoare triple {32041#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32041#(= main_~i~0 0)} is VALID [2018-11-23 13:05:44,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {32041#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32042#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:05:44,694 INFO L273 TraceCheckUtils]: 8: Hoare triple {32042#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32042#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:05:44,696 INFO L273 TraceCheckUtils]: 9: Hoare triple {32042#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32043#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:05:44,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {32043#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32043#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:05:44,697 INFO L273 TraceCheckUtils]: 11: Hoare triple {32043#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32044#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:05:44,698 INFO L273 TraceCheckUtils]: 12: Hoare triple {32044#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32044#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:05:44,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {32044#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32045#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:05:44,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {32045#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32045#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} is VALID [2018-11-23 13:05:44,700 INFO L273 TraceCheckUtils]: 15: Hoare triple {32045#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967291) 4294967296)) 4) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32046#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} is VALID [2018-11-23 13:05:44,700 INFO L273 TraceCheckUtils]: 16: Hoare triple {32046#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32046#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} is VALID [2018-11-23 13:05:44,701 INFO L273 TraceCheckUtils]: 17: Hoare triple {32046#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967290) 4294967296)) 5) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32047#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} is VALID [2018-11-23 13:05:44,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {32047#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32047#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} is VALID [2018-11-23 13:05:44,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {32047#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967289) 4294967296)) 6) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32048#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967288) 4294967296)) 7) main_~i~0)} is VALID [2018-11-23 13:05:44,704 INFO L273 TraceCheckUtils]: 20: Hoare triple {32048#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967288) 4294967296)) 7) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32048#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967288) 4294967296)) 7) main_~i~0)} is VALID [2018-11-23 13:05:44,705 INFO L273 TraceCheckUtils]: 21: Hoare triple {32048#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967288) 4294967296)) 7) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32049#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967287) 4294967296)) 8) main_~i~0)} is VALID [2018-11-23 13:05:44,706 INFO L273 TraceCheckUtils]: 22: Hoare triple {32049#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967287) 4294967296)) 8) main_~i~0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32049#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967287) 4294967296)) 8) main_~i~0)} is VALID [2018-11-23 13:05:44,709 INFO L273 TraceCheckUtils]: 23: Hoare triple {32049#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967287) 4294967296)) 8) main_~i~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32050#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 9))} is VALID [2018-11-23 13:05:44,709 INFO L273 TraceCheckUtils]: 24: Hoare triple {32050#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 9))} assume !(~i~0 % 4294967296 < 10); {32040#false} is VALID [2018-11-23 13:05:44,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {32040#false} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {32040#false} is VALID [2018-11-23 13:05:44,709 INFO L273 TraceCheckUtils]: 26: Hoare triple {32040#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {32040#false} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {32040#false} is VALID [2018-11-23 13:05:44,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {32040#false} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {32040#false} assume !(0 != #t~mem2);havoc #t~mem2; {32040#false} is VALID [2018-11-23 13:05:44,710 INFO L273 TraceCheckUtils]: 30: Hoare triple {32040#false} ~cont~0 := 0;~i~0 := 0; {32040#false} is VALID [2018-11-23 13:05:44,710 INFO L273 TraceCheckUtils]: 31: Hoare triple {32040#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {32040#false} is VALID [2018-11-23 13:05:44,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,710 INFO L273 TraceCheckUtils]: 33: Hoare triple {32040#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32040#false} is VALID [2018-11-23 13:05:44,710 INFO L273 TraceCheckUtils]: 34: Hoare triple {32040#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32040#false} is VALID [2018-11-23 13:05:44,711 INFO L273 TraceCheckUtils]: 35: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,711 INFO L273 TraceCheckUtils]: 36: Hoare triple {32040#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32040#false} is VALID [2018-11-23 13:05:44,711 INFO L273 TraceCheckUtils]: 37: Hoare triple {32040#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32040#false} is VALID [2018-11-23 13:05:44,711 INFO L273 TraceCheckUtils]: 38: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,711 INFO L273 TraceCheckUtils]: 39: Hoare triple {32040#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32040#false} is VALID [2018-11-23 13:05:44,711 INFO L273 TraceCheckUtils]: 40: Hoare triple {32040#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32040#false} is VALID [2018-11-23 13:05:44,712 INFO L273 TraceCheckUtils]: 41: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,712 INFO L273 TraceCheckUtils]: 42: Hoare triple {32040#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32040#false} is VALID [2018-11-23 13:05:44,712 INFO L273 TraceCheckUtils]: 43: Hoare triple {32040#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32040#false} is VALID [2018-11-23 13:05:44,712 INFO L273 TraceCheckUtils]: 44: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,712 INFO L273 TraceCheckUtils]: 45: Hoare triple {32040#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32040#false} is VALID [2018-11-23 13:05:44,712 INFO L273 TraceCheckUtils]: 46: Hoare triple {32040#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32040#false} is VALID [2018-11-23 13:05:44,712 INFO L273 TraceCheckUtils]: 47: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,712 INFO L273 TraceCheckUtils]: 48: Hoare triple {32040#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32040#false} is VALID [2018-11-23 13:05:44,712 INFO L273 TraceCheckUtils]: 49: Hoare triple {32040#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32040#false} is VALID [2018-11-23 13:05:44,713 INFO L273 TraceCheckUtils]: 50: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,713 INFO L273 TraceCheckUtils]: 51: Hoare triple {32040#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32040#false} is VALID [2018-11-23 13:05:44,713 INFO L273 TraceCheckUtils]: 52: Hoare triple {32040#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32040#false} is VALID [2018-11-23 13:05:44,713 INFO L273 TraceCheckUtils]: 53: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,713 INFO L273 TraceCheckUtils]: 54: Hoare triple {32040#false} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32040#false} is VALID [2018-11-23 13:05:44,713 INFO L273 TraceCheckUtils]: 55: Hoare triple {32040#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32040#false} is VALID [2018-11-23 13:05:44,713 INFO L273 TraceCheckUtils]: 56: Hoare triple {32040#false} assume !(~j~0 % 4294967296 < 8); {32040#false} is VALID [2018-11-23 13:05:44,713 INFO L273 TraceCheckUtils]: 57: Hoare triple {32040#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32040#false} is VALID [2018-11-23 13:05:44,714 INFO L273 TraceCheckUtils]: 58: Hoare triple {32040#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {32040#false} is VALID [2018-11-23 13:05:44,714 INFO L273 TraceCheckUtils]: 59: Hoare triple {32040#false} ~i~0 := 0;~cont_aux~0 := 0; {32040#false} is VALID [2018-11-23 13:05:44,714 INFO L273 TraceCheckUtils]: 60: Hoare triple {32040#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,714 INFO L273 TraceCheckUtils]: 61: Hoare triple {32040#false} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {32040#false} is VALID [2018-11-23 13:05:44,714 INFO L273 TraceCheckUtils]: 62: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,714 INFO L273 TraceCheckUtils]: 63: Hoare triple {32040#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32040#false} is VALID [2018-11-23 13:05:44,714 INFO L273 TraceCheckUtils]: 64: Hoare triple {32040#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32040#false} is VALID [2018-11-23 13:05:44,714 INFO L273 TraceCheckUtils]: 65: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,715 INFO L273 TraceCheckUtils]: 66: Hoare triple {32040#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32040#false} is VALID [2018-11-23 13:05:44,715 INFO L273 TraceCheckUtils]: 67: Hoare triple {32040#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32040#false} is VALID [2018-11-23 13:05:44,715 INFO L273 TraceCheckUtils]: 68: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,715 INFO L273 TraceCheckUtils]: 69: Hoare triple {32040#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32040#false} is VALID [2018-11-23 13:05:44,715 INFO L273 TraceCheckUtils]: 70: Hoare triple {32040#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32040#false} is VALID [2018-11-23 13:05:44,715 INFO L273 TraceCheckUtils]: 71: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,715 INFO L273 TraceCheckUtils]: 72: Hoare triple {32040#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32040#false} is VALID [2018-11-23 13:05:44,715 INFO L273 TraceCheckUtils]: 73: Hoare triple {32040#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32040#false} is VALID [2018-11-23 13:05:44,716 INFO L273 TraceCheckUtils]: 74: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,716 INFO L273 TraceCheckUtils]: 75: Hoare triple {32040#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32040#false} is VALID [2018-11-23 13:05:44,716 INFO L273 TraceCheckUtils]: 76: Hoare triple {32040#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32040#false} is VALID [2018-11-23 13:05:44,716 INFO L273 TraceCheckUtils]: 77: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,716 INFO L273 TraceCheckUtils]: 78: Hoare triple {32040#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32040#false} is VALID [2018-11-23 13:05:44,716 INFO L273 TraceCheckUtils]: 79: Hoare triple {32040#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32040#false} is VALID [2018-11-23 13:05:44,716 INFO L273 TraceCheckUtils]: 80: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,716 INFO L273 TraceCheckUtils]: 81: Hoare triple {32040#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32040#false} is VALID [2018-11-23 13:05:44,716 INFO L273 TraceCheckUtils]: 82: Hoare triple {32040#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32040#false} is VALID [2018-11-23 13:05:44,717 INFO L273 TraceCheckUtils]: 83: Hoare triple {32040#false} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,717 INFO L273 TraceCheckUtils]: 84: Hoare triple {32040#false} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32040#false} is VALID [2018-11-23 13:05:44,717 INFO L273 TraceCheckUtils]: 85: Hoare triple {32040#false} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32040#false} is VALID [2018-11-23 13:05:44,717 INFO L273 TraceCheckUtils]: 86: Hoare triple {32040#false} assume !(~j~0 % 4294967296 < 10); {32040#false} is VALID [2018-11-23 13:05:44,717 INFO L273 TraceCheckUtils]: 87: Hoare triple {32040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32040#false} is VALID [2018-11-23 13:05:44,717 INFO L273 TraceCheckUtils]: 88: Hoare triple {32040#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:44,717 INFO L273 TraceCheckUtils]: 89: Hoare triple {32040#false} assume !(0 != #t~mem9);havoc #t~mem9; {32040#false} is VALID [2018-11-23 13:05:44,717 INFO L256 TraceCheckUtils]: 90: Hoare triple {32040#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {32040#false} is VALID [2018-11-23 13:05:44,718 INFO L273 TraceCheckUtils]: 91: Hoare triple {32040#false} ~cond := #in~cond; {32040#false} is VALID [2018-11-23 13:05:44,718 INFO L273 TraceCheckUtils]: 92: Hoare triple {32040#false} assume 0 == ~cond; {32040#false} is VALID [2018-11-23 13:05:44,718 INFO L273 TraceCheckUtils]: 93: Hoare triple {32040#false} assume !false; {32040#false} is VALID [2018-11-23 13:05:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2018-11-23 13:05:44,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:44,724 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:05:44,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:05:44,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:05:44,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:44,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:45,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {32039#true} call ULTIMATE.init(); {32039#true} is VALID [2018-11-23 13:05:45,170 INFO L273 TraceCheckUtils]: 1: Hoare triple {32039#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32039#true} is VALID [2018-11-23 13:05:45,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {32039#true} assume true; {32039#true} is VALID [2018-11-23 13:05:45,170 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32039#true} {32039#true} #112#return; {32039#true} is VALID [2018-11-23 13:05:45,170 INFO L256 TraceCheckUtils]: 4: Hoare triple {32039#true} call #t~ret15 := main(); {32039#true} is VALID [2018-11-23 13:05:45,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {32039#true} call ~#string_entrada~0.base, ~#string_entrada~0.offset := #Ultimate.alloc(10);call ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vetor_vogais~0.base, ~#vetor_vogais~0.offset, 1);call write~init~int(65, ~#vetor_vogais~0.base, 1 + ~#vetor_vogais~0.offset, 1);call write~init~int(101, ~#vetor_vogais~0.base, 2 + ~#vetor_vogais~0.offset, 1);call write~init~int(69, ~#vetor_vogais~0.base, 3 + ~#vetor_vogais~0.offset, 1);call write~init~int(105, ~#vetor_vogais~0.base, 4 + ~#vetor_vogais~0.offset, 1);call write~init~int(73, ~#vetor_vogais~0.base, 5 + ~#vetor_vogais~0.offset, 1);call write~init~int(111, ~#vetor_vogais~0.base, 6 + ~#vetor_vogais~0.offset, 1);call write~init~int(79, ~#vetor_vogais~0.base, 7 + ~#vetor_vogais~0.offset, 1);call write~init~int(117, ~#vetor_vogais~0.base, 8 + ~#vetor_vogais~0.offset, 1);call write~init~int(85, ~#vetor_vogais~0.base, 9 + ~#vetor_vogais~0.offset, 1);call write~init~int(0, ~#vetor_vogais~0.base, 10 + ~#vetor_vogais~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {32041#(= main_~i~0 0)} is VALID [2018-11-23 13:05:45,171 INFO L273 TraceCheckUtils]: 6: Hoare triple {32041#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32041#(= main_~i~0 0)} is VALID [2018-11-23 13:05:45,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {32041#(= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32075#(= main_~i~0 1)} is VALID [2018-11-23 13:05:45,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {32075#(= main_~i~0 1)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32075#(= main_~i~0 1)} is VALID [2018-11-23 13:05:45,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {32075#(= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32082#(= main_~i~0 2)} is VALID [2018-11-23 13:05:45,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {32082#(= main_~i~0 2)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32082#(= main_~i~0 2)} is VALID [2018-11-23 13:05:45,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {32082#(= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32089#(= main_~i~0 3)} is VALID [2018-11-23 13:05:45,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {32089#(= main_~i~0 3)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32089#(= main_~i~0 3)} is VALID [2018-11-23 13:05:45,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {32089#(= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32096#(= main_~i~0 4)} is VALID [2018-11-23 13:05:45,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {32096#(= main_~i~0 4)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32096#(= main_~i~0 4)} is VALID [2018-11-23 13:05:45,175 INFO L273 TraceCheckUtils]: 15: Hoare triple {32096#(= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32103#(= main_~i~0 5)} is VALID [2018-11-23 13:05:45,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {32103#(= main_~i~0 5)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32103#(= main_~i~0 5)} is VALID [2018-11-23 13:05:45,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {32103#(= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32110#(= main_~i~0 6)} is VALID [2018-11-23 13:05:45,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {32110#(= main_~i~0 6)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32110#(= main_~i~0 6)} is VALID [2018-11-23 13:05:45,178 INFO L273 TraceCheckUtils]: 19: Hoare triple {32110#(= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32117#(= main_~i~0 7)} is VALID [2018-11-23 13:05:45,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {32117#(= main_~i~0 7)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32117#(= main_~i~0 7)} is VALID [2018-11-23 13:05:45,179 INFO L273 TraceCheckUtils]: 21: Hoare triple {32117#(= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32124#(= main_~i~0 8)} is VALID [2018-11-23 13:05:45,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {32124#(= main_~i~0 8)} assume !!(~i~0 % 4294967296 < 10);assume -128 <= #t~nondet1 && #t~nondet1 <= 127;call write~int(#t~nondet1, ~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet1; {32039#true} is VALID [2018-11-23 13:05:45,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {32039#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {32039#true} is VALID [2018-11-23 13:05:45,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {32039#true} assume !(~i~0 % 4294967296 < 10); {32039#true} is VALID [2018-11-23 13:05:45,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {32039#true} call write~int(0, ~#string_entrada~0.base, 9 + ~#string_entrada~0.offset, 1);~n_caracter~0 := 0; {32039#true} is VALID [2018-11-23 13:05:45,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {32039#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {32039#true} assume !!(0 != #t~mem2);havoc #t~mem2;#t~post3 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post3;havoc #t~post3; {32039#true} is VALID [2018-11-23 13:05:45,180 INFO L273 TraceCheckUtils]: 28: Hoare triple {32039#true} call #t~mem2 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,180 INFO L273 TraceCheckUtils]: 29: Hoare triple {32039#true} assume !(0 != #t~mem2);havoc #t~mem2; {32039#true} is VALID [2018-11-23 13:05:45,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {32039#true} ~cont~0 := 0;~i~0 := 0; {32039#true} is VALID [2018-11-23 13:05:45,181 INFO L273 TraceCheckUtils]: 31: Hoare triple {32039#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {32039#true} is VALID [2018-11-23 13:05:45,181 INFO L273 TraceCheckUtils]: 32: Hoare triple {32039#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,181 INFO L273 TraceCheckUtils]: 33: Hoare triple {32039#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32039#true} is VALID [2018-11-23 13:05:45,182 INFO L273 TraceCheckUtils]: 34: Hoare triple {32039#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32039#true} is VALID [2018-11-23 13:05:45,182 INFO L273 TraceCheckUtils]: 35: Hoare triple {32039#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,182 INFO L273 TraceCheckUtils]: 36: Hoare triple {32039#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32039#true} is VALID [2018-11-23 13:05:45,182 INFO L273 TraceCheckUtils]: 37: Hoare triple {32039#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32039#true} is VALID [2018-11-23 13:05:45,182 INFO L273 TraceCheckUtils]: 38: Hoare triple {32039#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {32039#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32039#true} is VALID [2018-11-23 13:05:45,183 INFO L273 TraceCheckUtils]: 40: Hoare triple {32039#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32039#true} is VALID [2018-11-23 13:05:45,183 INFO L273 TraceCheckUtils]: 41: Hoare triple {32039#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {32039#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32039#true} is VALID [2018-11-23 13:05:45,183 INFO L273 TraceCheckUtils]: 43: Hoare triple {32039#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32039#true} is VALID [2018-11-23 13:05:45,183 INFO L273 TraceCheckUtils]: 44: Hoare triple {32039#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,184 INFO L273 TraceCheckUtils]: 45: Hoare triple {32039#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32039#true} is VALID [2018-11-23 13:05:45,184 INFO L273 TraceCheckUtils]: 46: Hoare triple {32039#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32039#true} is VALID [2018-11-23 13:05:45,184 INFO L273 TraceCheckUtils]: 47: Hoare triple {32039#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,184 INFO L273 TraceCheckUtils]: 48: Hoare triple {32039#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32039#true} is VALID [2018-11-23 13:05:45,184 INFO L273 TraceCheckUtils]: 49: Hoare triple {32039#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32039#true} is VALID [2018-11-23 13:05:45,184 INFO L273 TraceCheckUtils]: 50: Hoare triple {32039#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,184 INFO L273 TraceCheckUtils]: 51: Hoare triple {32039#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32039#true} is VALID [2018-11-23 13:05:45,184 INFO L273 TraceCheckUtils]: 52: Hoare triple {32039#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32039#true} is VALID [2018-11-23 13:05:45,184 INFO L273 TraceCheckUtils]: 53: Hoare triple {32039#true} assume !!(~j~0 % 4294967296 < 8);call #t~mem6 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem7 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,185 INFO L273 TraceCheckUtils]: 54: Hoare triple {32039#true} assume #t~mem6 == #t~mem7;havoc #t~mem7;havoc #t~mem6;#t~post8 := ~cont~0;~cont~0 := 1 + #t~post8;havoc #t~post8; {32039#true} is VALID [2018-11-23 13:05:45,185 INFO L273 TraceCheckUtils]: 55: Hoare triple {32039#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {32039#true} is VALID [2018-11-23 13:05:45,185 INFO L273 TraceCheckUtils]: 56: Hoare triple {32039#true} assume !(~j~0 % 4294967296 < 8); {32039#true} is VALID [2018-11-23 13:05:45,185 INFO L273 TraceCheckUtils]: 57: Hoare triple {32039#true} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {32039#true} is VALID [2018-11-23 13:05:45,185 INFO L273 TraceCheckUtils]: 58: Hoare triple {32039#true} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {32039#true} is VALID [2018-11-23 13:05:45,185 INFO L273 TraceCheckUtils]: 59: Hoare triple {32039#true} ~i~0 := 0;~cont_aux~0 := 0; {32039#true} is VALID [2018-11-23 13:05:45,185 INFO L273 TraceCheckUtils]: 60: Hoare triple {32039#true} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {32039#true} is VALID [2018-11-23 13:05:45,186 INFO L273 TraceCheckUtils]: 61: Hoare triple {32039#true} assume !!(0 != #t~mem9);havoc #t~mem9;~j~0 := 0; {32245#(= main_~j~0 0)} is VALID [2018-11-23 13:05:45,186 INFO L273 TraceCheckUtils]: 62: Hoare triple {32245#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32245#(= main_~j~0 0)} is VALID [2018-11-23 13:05:45,186 INFO L273 TraceCheckUtils]: 63: Hoare triple {32245#(= main_~j~0 0)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32245#(= main_~j~0 0)} is VALID [2018-11-23 13:05:45,187 INFO L273 TraceCheckUtils]: 64: Hoare triple {32245#(= main_~j~0 0)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32255#(= main_~j~0 1)} is VALID [2018-11-23 13:05:45,187 INFO L273 TraceCheckUtils]: 65: Hoare triple {32255#(= main_~j~0 1)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32255#(= main_~j~0 1)} is VALID [2018-11-23 13:05:45,187 INFO L273 TraceCheckUtils]: 66: Hoare triple {32255#(= main_~j~0 1)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32255#(= main_~j~0 1)} is VALID [2018-11-23 13:05:45,188 INFO L273 TraceCheckUtils]: 67: Hoare triple {32255#(= main_~j~0 1)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32265#(= main_~j~0 2)} is VALID [2018-11-23 13:05:45,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {32265#(= main_~j~0 2)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32265#(= main_~j~0 2)} is VALID [2018-11-23 13:05:45,188 INFO L273 TraceCheckUtils]: 69: Hoare triple {32265#(= main_~j~0 2)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32265#(= main_~j~0 2)} is VALID [2018-11-23 13:05:45,189 INFO L273 TraceCheckUtils]: 70: Hoare triple {32265#(= main_~j~0 2)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32275#(= main_~j~0 3)} is VALID [2018-11-23 13:05:45,206 INFO L273 TraceCheckUtils]: 71: Hoare triple {32275#(= main_~j~0 3)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32275#(= main_~j~0 3)} is VALID [2018-11-23 13:05:45,209 INFO L273 TraceCheckUtils]: 72: Hoare triple {32275#(= main_~j~0 3)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32275#(= main_~j~0 3)} is VALID [2018-11-23 13:05:45,209 INFO L273 TraceCheckUtils]: 73: Hoare triple {32275#(= main_~j~0 3)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32285#(= main_~j~0 4)} is VALID [2018-11-23 13:05:45,209 INFO L273 TraceCheckUtils]: 74: Hoare triple {32285#(= main_~j~0 4)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32285#(= main_~j~0 4)} is VALID [2018-11-23 13:05:45,210 INFO L273 TraceCheckUtils]: 75: Hoare triple {32285#(= main_~j~0 4)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32285#(= main_~j~0 4)} is VALID [2018-11-23 13:05:45,210 INFO L273 TraceCheckUtils]: 76: Hoare triple {32285#(= main_~j~0 4)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32295#(= main_~j~0 5)} is VALID [2018-11-23 13:05:45,210 INFO L273 TraceCheckUtils]: 77: Hoare triple {32295#(= main_~j~0 5)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32295#(= main_~j~0 5)} is VALID [2018-11-23 13:05:45,211 INFO L273 TraceCheckUtils]: 78: Hoare triple {32295#(= main_~j~0 5)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32295#(= main_~j~0 5)} is VALID [2018-11-23 13:05:45,211 INFO L273 TraceCheckUtils]: 79: Hoare triple {32295#(= main_~j~0 5)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32305#(= main_~j~0 6)} is VALID [2018-11-23 13:05:45,211 INFO L273 TraceCheckUtils]: 80: Hoare triple {32305#(= main_~j~0 6)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32305#(= main_~j~0 6)} is VALID [2018-11-23 13:05:45,212 INFO L273 TraceCheckUtils]: 81: Hoare triple {32305#(= main_~j~0 6)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32305#(= main_~j~0 6)} is VALID [2018-11-23 13:05:45,212 INFO L273 TraceCheckUtils]: 82: Hoare triple {32305#(= main_~j~0 6)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32315#(= main_~j~0 7)} is VALID [2018-11-23 13:05:45,213 INFO L273 TraceCheckUtils]: 83: Hoare triple {32315#(= main_~j~0 7)} assume !!(~j~0 % 4294967296 < 10);call #t~mem11 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem12 := read~int(~#vetor_vogais~0.base, ~#vetor_vogais~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {32315#(= main_~j~0 7)} is VALID [2018-11-23 13:05:45,213 INFO L273 TraceCheckUtils]: 84: Hoare triple {32315#(= main_~j~0 7)} assume #t~mem11 == #t~mem12;havoc #t~mem11;havoc #t~mem12;#t~post13 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post13;havoc #t~post13; {32315#(= main_~j~0 7)} is VALID [2018-11-23 13:05:45,213 INFO L273 TraceCheckUtils]: 85: Hoare triple {32315#(= main_~j~0 7)} #t~post10 := ~j~0;~j~0 := 1 + #t~post10;havoc #t~post10; {32325#(= main_~j~0 8)} is VALID [2018-11-23 13:05:45,214 INFO L273 TraceCheckUtils]: 86: Hoare triple {32325#(= main_~j~0 8)} assume !(~j~0 % 4294967296 < 10); {32040#false} is VALID [2018-11-23 13:05:45,214 INFO L273 TraceCheckUtils]: 87: Hoare triple {32040#false} #t~post14 := ~i~0;~i~0 := 1 + #t~post14;havoc #t~post14; {32040#false} is VALID [2018-11-23 13:05:45,214 INFO L273 TraceCheckUtils]: 88: Hoare triple {32040#false} call #t~mem9 := read~int(~#string_entrada~0.base, ~#string_entrada~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {32040#false} is VALID [2018-11-23 13:05:45,215 INFO L273 TraceCheckUtils]: 89: Hoare triple {32040#false} assume !(0 != #t~mem9);havoc #t~mem9; {32040#false} is VALID [2018-11-23 13:05:45,215 INFO L256 TraceCheckUtils]: 90: Hoare triple {32040#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {32040#false} is VALID [2018-11-23 13:05:45,215 INFO L273 TraceCheckUtils]: 91: Hoare triple {32040#false} ~cond := #in~cond; {32040#false} is VALID [2018-11-23 13:05:45,215 INFO L273 TraceCheckUtils]: 92: Hoare triple {32040#false} assume 0 == ~cond; {32040#false} is VALID [2018-11-23 13:05:45,215 INFO L273 TraceCheckUtils]: 93: Hoare triple {32040#false} assume !false; {32040#false} is VALID [2018-11-23 13:05:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 2 proven. 173 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-23 13:05:45,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:45,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20] total 29 [2018-11-23 13:05:45,240 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 94 [2018-11-23 13:05:45,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:45,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:05:45,365 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-23 13:05:45,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:05:45,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:05:45,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:05:45,367 INFO L87 Difference]: Start difference. First operand 262 states and 338 transitions. Second operand 29 states.