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_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:46,133 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:46,136 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:46,149 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:46,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:46,150 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:46,152 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:46,153 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:46,155 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:46,156 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:46,157 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:46,157 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:46,158 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:46,159 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:46,160 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:46,161 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:46,162 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:46,164 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:46,166 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:46,168 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:46,169 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:46,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:46,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:46,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:46,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:46,174 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:46,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:46,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:46,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:46,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:46,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:46,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:46,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:46,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:46,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:46,181 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:46,182 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:04:46,212 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:46,212 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:46,213 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:46,214 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:46,214 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:46,214 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:46,215 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:46,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:46,215 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:46,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:46,216 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:46,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:46,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:46,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:46,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:46,217 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:46,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:46,217 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:46,217 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:46,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:46,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:46,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:46,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:46,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:46,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:46,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:46,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:46,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:46,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:46,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:46,219 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:46,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:46,297 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:46,302 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:46,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:46,304 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:46,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-11-23 13:04:46,383 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23704a9a0/d8160dc5d1604c0daf3b1971ea185e64/FLAGf657557a6 [2018-11-23 13:04:46,857 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:46,858 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal_true-unreach-call.i [2018-11-23 13:04:46,867 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23704a9a0/d8160dc5d1604c0daf3b1971ea185e64/FLAGf657557a6 [2018-11-23 13:04:47,216 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23704a9a0/d8160dc5d1604c0daf3b1971ea185e64 [2018-11-23 13:04:47,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:47,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:47,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:47,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:47,233 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:47,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e0b0fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47, skipping insertion in model container [2018-11-23 13:04:47,239 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:47,274 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:47,573 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:47,583 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:47,645 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:47,671 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:47,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47 WrapperNode [2018-11-23 13:04:47,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:47,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:47,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:47,673 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:47,683 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:04:47" (1/1) ... [2018-11-23 13:04:47,693 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:04:47" (1/1) ... [2018-11-23 13:04:47,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:47,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:47,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:47,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:47,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (1/1) ... [2018-11-23 13:04:47,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:47,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:47,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:47,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:47,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (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:04:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:04:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:47,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:04:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:47,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:04:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 13:04:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:04:48,981 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:48,982 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:04:48,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:48 BoogieIcfgContainer [2018-11-23 13:04:48,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:48,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:48,983 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:48,987 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:48,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:47" (1/3) ... [2018-11-23 13:04:48,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ed7de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:48, skipping insertion in model container [2018-11-23 13:04:48,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:47" (2/3) ... [2018-11-23 13:04:48,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33ed7de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:48, skipping insertion in model container [2018-11-23 13:04:48,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:48" (3/3) ... [2018-11-23 13:04:48,991 INFO L112 eAbstractionObserver]: Analyzing ICFG vogal_true-unreach-call.i [2018-11-23 13:04:48,999 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:49,006 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:49,024 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:49,063 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:49,064 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:49,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:49,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:49,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:49,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:49,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:49,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:49,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 13:04:49,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:04:49,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:49,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:49,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:49,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:49,108 INFO L82 PathProgramCache]: Analyzing trace with hash 2138170830, now seen corresponding path program 1 times [2018-11-23 13:04:49,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:49,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:49,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:49,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:49,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2018-11-23 13:04:49,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40#true} is VALID [2018-11-23 13:04:49,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2018-11-23 13:04:49,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #116#return; {40#true} is VALID [2018-11-23 13:04:49,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret17 := main(); {40#true} is VALID [2018-11-23 13:04:49,275 INFO L273 TraceCheckUtils]: 5: Hoare triple {40#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {40#true} is VALID [2018-11-23 13:04:49,278 INFO L273 TraceCheckUtils]: 6: Hoare triple {40#true} assume !true; {41#false} is VALID [2018-11-23 13:04:49,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {41#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {41#false} is VALID [2018-11-23 13:04:49,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {41#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {41#false} is VALID [2018-11-23 13:04:49,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 13:04:49,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {41#false} ~cont~0 := 0;~i~0 := 0; {41#false} is VALID [2018-11-23 13:04:49,279 INFO L273 TraceCheckUtils]: 11: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 13:04:49,280 INFO L273 TraceCheckUtils]: 12: Hoare triple {41#false} ~i~0 := 0;~cont_aux~0 := 0; {41#false} is VALID [2018-11-23 13:04:49,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2018-11-23 13:04:49,280 INFO L256 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {41#false} is VALID [2018-11-23 13:04:49,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2018-11-23 13:04:49,281 INFO L273 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2018-11-23 13:04:49,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2018-11-23 13:04:49,285 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:04:49,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:49,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:49,293 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 13:04:49,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:49,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:49,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:49,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:49,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:49,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:49,434 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 13:04:49,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:49,598 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2018-11-23 13:04:49,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:49,598 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 13:04:49,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:49,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-23 13:04:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-23 13:04:49,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 95 transitions. [2018-11-23 13:04:49,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:49,928 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:04:49,928 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 13:04:49,932 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:04:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 13:04:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 13:04:49,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:49,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 13:04:49,986 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:04:49,986 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:04:49,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:49,991 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 13:04:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 13:04:49,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:49,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:49,992 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 13:04:49,993 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 13:04:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:49,997 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 13:04:49,998 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 13:04:49,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:49,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:49,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:49,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:04:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 13:04:50,004 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2018-11-23 13:04:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:50,005 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 13:04:50,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 13:04:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:04:50,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:50,007 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] [2018-11-23 13:04:50,007 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:50,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1430244045, now seen corresponding path program 1 times [2018-11-23 13:04:50,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:50,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:50,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:50,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID [2018-11-23 13:04:50,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {231#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {231#true} is VALID [2018-11-23 13:04:50,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2018-11-23 13:04:50,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #116#return; {231#true} is VALID [2018-11-23 13:04:50,140 INFO L256 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret17 := main(); {231#true} is VALID [2018-11-23 13:04:50,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {231#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {233#(= main_~i~0 0)} is VALID [2018-11-23 13:04:50,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < 5); {232#false} is VALID [2018-11-23 13:04:50,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {232#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {232#false} is VALID [2018-11-23 13:04:50,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {232#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {232#false} is VALID [2018-11-23 13:04:50,147 INFO L273 TraceCheckUtils]: 9: Hoare triple {232#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {232#false} is VALID [2018-11-23 13:04:50,147 INFO L273 TraceCheckUtils]: 10: Hoare triple {232#false} assume !(0 != #t~mem4);havoc #t~mem4; {232#false} is VALID [2018-11-23 13:04:50,148 INFO L273 TraceCheckUtils]: 11: Hoare triple {232#false} ~cont~0 := 0;~i~0 := 0; {232#false} is VALID [2018-11-23 13:04:50,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {232#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {232#false} is VALID [2018-11-23 13:04:50,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {232#false} ~i~0 := 0;~cont_aux~0 := 0; {232#false} is VALID [2018-11-23 13:04:50,149 INFO L273 TraceCheckUtils]: 14: Hoare triple {232#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {232#false} is VALID [2018-11-23 13:04:50,150 INFO L273 TraceCheckUtils]: 15: Hoare triple {232#false} assume !(0 != #t~mem11);havoc #t~mem11; {232#false} is VALID [2018-11-23 13:04:50,150 INFO L256 TraceCheckUtils]: 16: Hoare triple {232#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {232#false} is VALID [2018-11-23 13:04:50,150 INFO L273 TraceCheckUtils]: 17: Hoare triple {232#false} ~cond := #in~cond; {232#false} is VALID [2018-11-23 13:04:50,151 INFO L273 TraceCheckUtils]: 18: Hoare triple {232#false} assume 0 == ~cond; {232#false} is VALID [2018-11-23 13:04:50,151 INFO L273 TraceCheckUtils]: 19: Hoare triple {232#false} assume !false; {232#false} is VALID [2018-11-23 13:04:50,153 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:04:50,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:50,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:50,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 13:04:50,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:50,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:50,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:50,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:50,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:50,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:50,446 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2018-11-23 13:04:50,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:50,917 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2018-11-23 13:04:50,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:50,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 13:04:50,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 13:04:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2018-11-23 13:04:50,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2018-11-23 13:04:51,096 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:51,100 INFO L225 Difference]: With dead ends: 67 [2018-11-23 13:04:51,100 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 13:04:51,101 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:04:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 13:04:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-11-23 13:04:51,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:51,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 31 states. [2018-11-23 13:04:51,120 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 31 states. [2018-11-23 13:04:51,120 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 31 states. [2018-11-23 13:04:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,124 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-11-23 13:04:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2018-11-23 13:04:51,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:51,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:51,125 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 45 states. [2018-11-23 13:04:51,125 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 45 states. [2018-11-23 13:04:51,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:51,129 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2018-11-23 13:04:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2018-11-23 13:04:51,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:51,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:51,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:51,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 13:04:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-23 13:04:51,133 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 20 [2018-11-23 13:04:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:51,134 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 13:04:51,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2018-11-23 13:04:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:04:51,135 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:51,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:51,135 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:51,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:51,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1498528533, now seen corresponding path program 1 times [2018-11-23 13:04:51,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:51,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:51,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:51,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:51,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:51,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2018-11-23 13:04:51,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {462#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {462#true} is VALID [2018-11-23 13:04:51,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2018-11-23 13:04:51,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #116#return; {462#true} is VALID [2018-11-23 13:04:51,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret17 := main(); {462#true} is VALID [2018-11-23 13:04:51,383 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {464#(= main_~i~0 0)} is VALID [2018-11-23 13:04:51,385 INFO L273 TraceCheckUtils]: 6: Hoare triple {464#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {464#(= main_~i~0 0)} is VALID [2018-11-23 13:04:51,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {464#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {465#(and (<= main_~i~0 1) (< 0 (+ (div main_~i~0 4294967296) 1)))} is VALID [2018-11-23 13:04:51,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {465#(and (<= main_~i~0 1) (< 0 (+ (div main_~i~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < 5); {463#false} is VALID [2018-11-23 13:04:51,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {463#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {463#false} is VALID [2018-11-23 13:04:51,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {463#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {463#false} is VALID [2018-11-23 13:04:51,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {463#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {463#false} is VALID [2018-11-23 13:04:51,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {463#false} assume !(0 != #t~mem4);havoc #t~mem4; {463#false} is VALID [2018-11-23 13:04:51,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {463#false} ~cont~0 := 0;~i~0 := 0; {463#false} is VALID [2018-11-23 13:04:51,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {463#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {463#false} is VALID [2018-11-23 13:04:51,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {463#false} ~i~0 := 0;~cont_aux~0 := 0; {463#false} is VALID [2018-11-23 13:04:51,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {463#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {463#false} is VALID [2018-11-23 13:04:51,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {463#false} assume !(0 != #t~mem11);havoc #t~mem11; {463#false} is VALID [2018-11-23 13:04:51,391 INFO L256 TraceCheckUtils]: 18: Hoare triple {463#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {463#false} is VALID [2018-11-23 13:04:51,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {463#false} ~cond := #in~cond; {463#false} is VALID [2018-11-23 13:04:51,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {463#false} assume 0 == ~cond; {463#false} is VALID [2018-11-23 13:04:51,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {463#false} assume !false; {463#false} is VALID [2018-11-23 13:04:51,393 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:04:51,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:51,394 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:04:51,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:51,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:51,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2018-11-23 13:04:51,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {462#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {462#true} is VALID [2018-11-23 13:04:51,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2018-11-23 13:04:51,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #116#return; {462#true} is VALID [2018-11-23 13:04:51,863 INFO L256 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret17 := main(); {462#true} is VALID [2018-11-23 13:04:51,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {462#true} is VALID [2018-11-23 13:04:51,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {462#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {462#true} is VALID [2018-11-23 13:04:51,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {462#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {462#true} is VALID [2018-11-23 13:04:51,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {462#true} assume !(~i~0 % 4294967296 < 5); {462#true} is VALID [2018-11-23 13:04:51,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {462#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {462#true} is VALID [2018-11-23 13:04:51,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {462#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {462#true} is VALID [2018-11-23 13:04:51,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {462#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {462#true} is VALID [2018-11-23 13:04:51,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {462#true} assume !(0 != #t~mem4);havoc #t~mem4; {462#true} is VALID [2018-11-23 13:04:51,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {462#true} ~cont~0 := 0;~i~0 := 0; {508#(= main_~cont~0 0)} is VALID [2018-11-23 13:04:51,881 INFO L273 TraceCheckUtils]: 14: Hoare triple {508#(= main_~cont~0 0)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {508#(= main_~cont~0 0)} is VALID [2018-11-23 13:04:51,882 INFO L273 TraceCheckUtils]: 15: Hoare triple {508#(= main_~cont~0 0)} ~i~0 := 0;~cont_aux~0 := 0; {515#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:04:51,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {515#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {515#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:04:51,890 INFO L273 TraceCheckUtils]: 17: Hoare triple {515#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} assume !(0 != #t~mem11);havoc #t~mem11; {515#(and (= main_~cont~0 0) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:04:51,891 INFO L256 TraceCheckUtils]: 18: Hoare triple {515#(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)); {525#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:51,894 INFO L273 TraceCheckUtils]: 19: Hoare triple {525#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {529#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:51,894 INFO L273 TraceCheckUtils]: 20: Hoare triple {529#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {463#false} is VALID [2018-11-23 13:04:51,895 INFO L273 TraceCheckUtils]: 21: Hoare triple {463#false} assume !false; {463#false} is VALID [2018-11-23 13:04:51,896 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:04:51,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:04:51,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2018-11-23 13:04:51,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 13:04:51,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:51,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:04:52,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:52,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:04:52,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:04:52,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:04:52,038 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 8 states. [2018-11-23 13:04:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:52,937 INFO L93 Difference]: Finished difference Result 139 states and 190 transitions. [2018-11-23 13:04:52,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:04:52,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 13:04:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:04:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2018-11-23 13:04:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:04:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 190 transitions. [2018-11-23 13:04:52,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 190 transitions. [2018-11-23 13:04:53,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:53,449 INFO L225 Difference]: With dead ends: 139 [2018-11-23 13:04:53,449 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 13:04:53,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 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:04:53,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 13:04:53,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 45. [2018-11-23 13:04:53,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:53,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 45 states. [2018-11-23 13:04:53,505 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 45 states. [2018-11-23 13:04:53,505 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 45 states. [2018-11-23 13:04:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,511 INFO L93 Difference]: Finished difference Result 112 states and 153 transitions. [2018-11-23 13:04:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 153 transitions. [2018-11-23 13:04:53,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:53,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:53,513 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 112 states. [2018-11-23 13:04:53,514 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 112 states. [2018-11-23 13:04:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:53,520 INFO L93 Difference]: Finished difference Result 112 states and 153 transitions. [2018-11-23 13:04:53,520 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 153 transitions. [2018-11-23 13:04:53,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:53,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:53,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:53,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:53,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:04:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2018-11-23 13:04:53,531 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 22 [2018-11-23 13:04:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:53,532 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2018-11-23 13:04:53,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:04:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-23 13:04:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:04:53,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:53,537 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, 1] [2018-11-23 13:04:53,537 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:53,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:53,538 INFO L82 PathProgramCache]: Analyzing trace with hash -688638064, now seen corresponding path program 1 times [2018-11-23 13:04:53,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:53,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:53,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:53,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:53,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2018-11-23 13:04:53,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {1024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1024#true} is VALID [2018-11-23 13:04:53,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2018-11-23 13:04:53,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #116#return; {1024#true} is VALID [2018-11-23 13:04:53,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret17 := main(); {1024#true} is VALID [2018-11-23 13:04:53,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {1024#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1024#true} is VALID [2018-11-23 13:04:53,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {1024#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1024#true} is VALID [2018-11-23 13:04:53,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {1024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1024#true} is VALID [2018-11-23 13:04:53,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1024#true} is VALID [2018-11-23 13:04:53,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {1024#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1024#true} is VALID [2018-11-23 13:04:53,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {1024#true} assume !(~i~0 % 4294967296 < 5); {1024#true} is VALID [2018-11-23 13:04:53,894 INFO L273 TraceCheckUtils]: 11: Hoare triple {1024#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1024#true} is VALID [2018-11-23 13:04:53,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {1024#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1026#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:04:53,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {1026#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1026#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:04:53,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {1026#(= main_~n_caracter~0 0)} assume !(0 != #t~mem4);havoc #t~mem4; {1026#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:04:53,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {1026#(= main_~n_caracter~0 0)} ~cont~0 := 0;~i~0 := 0; {1026#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:04:53,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {1026#(= main_~n_caracter~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {1025#false} is VALID [2018-11-23 13:04:53,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {1025#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1025#false} is VALID [2018-11-23 13:04:53,900 INFO L273 TraceCheckUtils]: 18: Hoare triple {1025#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {1025#false} is VALID [2018-11-23 13:04:53,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {1025#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {1025#false} is VALID [2018-11-23 13:04:53,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {1025#false} assume !(~j~0 % 4294967296 < 2); {1025#false} is VALID [2018-11-23 13:04:53,901 INFO L273 TraceCheckUtils]: 21: Hoare triple {1025#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {1025#false} is VALID [2018-11-23 13:04:53,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {1025#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1025#false} is VALID [2018-11-23 13:04:53,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {1025#false} ~i~0 := 0;~cont_aux~0 := 0; {1025#false} is VALID [2018-11-23 13:04:53,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {1025#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1025#false} is VALID [2018-11-23 13:04:53,903 INFO L273 TraceCheckUtils]: 25: Hoare triple {1025#false} assume !(0 != #t~mem11);havoc #t~mem11; {1025#false} is VALID [2018-11-23 13:04:53,903 INFO L256 TraceCheckUtils]: 26: Hoare triple {1025#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1025#false} is VALID [2018-11-23 13:04:53,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {1025#false} ~cond := #in~cond; {1025#false} is VALID [2018-11-23 13:04:53,904 INFO L273 TraceCheckUtils]: 28: Hoare triple {1025#false} assume 0 == ~cond; {1025#false} is VALID [2018-11-23 13:04:53,904 INFO L273 TraceCheckUtils]: 29: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2018-11-23 13:04:53,906 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:04:53,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:53,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:04:53,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 13:04:53,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:53,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:04:53,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:53,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:04:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:04:53,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:53,948 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 3 states. [2018-11-23 13:04:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:54,104 INFO L93 Difference]: Finished difference Result 92 states and 121 transitions. [2018-11-23 13:04:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:04:54,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-23 13:04:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:54,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-23 13:04:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:04:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2018-11-23 13:04:54,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2018-11-23 13:04:54,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:54,244 INFO L225 Difference]: With dead ends: 92 [2018-11-23 13:04:54,244 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 13:04:54,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:04:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 13:04:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2018-11-23 13:04:54,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:54,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 49 states. [2018-11-23 13:04:54,288 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 49 states. [2018-11-23 13:04:54,288 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 49 states. [2018-11-23 13:04:54,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:54,293 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2018-11-23 13:04:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2018-11-23 13:04:54,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:54,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:54,294 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 63 states. [2018-11-23 13:04:54,295 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 63 states. [2018-11-23 13:04:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:54,298 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2018-11-23 13:04:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2018-11-23 13:04:54,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:54,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:54,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:54,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:04:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2018-11-23 13:04:54,302 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 30 [2018-11-23 13:04:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:54,302 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2018-11-23 13:04:54,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:04:54,302 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2018-11-23 13:04:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:04:54,303 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:54,303 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, 1] [2018-11-23 13:04:54,304 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:54,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:54,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1995663849, now seen corresponding path program 1 times [2018-11-23 13:04:54,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:54,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:54,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:54,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:54,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1351#true} is VALID [2018-11-23 13:04:54,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {1351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1351#true} is VALID [2018-11-23 13:04:54,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2018-11-23 13:04:54,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #116#return; {1351#true} is VALID [2018-11-23 13:04:54,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret17 := main(); {1351#true} is VALID [2018-11-23 13:04:54,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {1351#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1353#(= main_~i~0 0)} is VALID [2018-11-23 13:04:54,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {1353#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1353#(= main_~i~0 0)} is VALID [2018-11-23 13:04:54,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {1353#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1354#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:04:54,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {1354#(and (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1354#(and (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 13:04:54,831 INFO L273 TraceCheckUtils]: 9: Hoare triple {1354#(and (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1355#(and (<= main_~i~0 2) (< 0 (+ (div main_~i~0 4294967296) 1)))} is VALID [2018-11-23 13:04:54,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {1355#(and (<= main_~i~0 2) (< 0 (+ (div main_~i~0 4294967296) 1)))} assume !(~i~0 % 4294967296 < 5); {1352#false} is VALID [2018-11-23 13:04:54,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {1352#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1352#false} is VALID [2018-11-23 13:04:54,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {1352#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1352#false} is VALID [2018-11-23 13:04:54,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {1352#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1352#false} is VALID [2018-11-23 13:04:54,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {1352#false} assume !(0 != #t~mem4);havoc #t~mem4; {1352#false} is VALID [2018-11-23 13:04:54,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {1352#false} ~cont~0 := 0;~i~0 := 0; {1352#false} is VALID [2018-11-23 13:04:54,834 INFO L273 TraceCheckUtils]: 16: Hoare triple {1352#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1352#false} is VALID [2018-11-23 13:04:54,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {1352#false} ~i~0 := 0;~cont_aux~0 := 0; {1352#false} is VALID [2018-11-23 13:04:54,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {1352#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1352#false} is VALID [2018-11-23 13:04:54,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {1352#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {1352#false} is VALID [2018-11-23 13:04:54,836 INFO L273 TraceCheckUtils]: 20: Hoare triple {1352#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1352#false} is VALID [2018-11-23 13:04:54,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {1352#false} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {1352#false} is VALID [2018-11-23 13:04:54,836 INFO L273 TraceCheckUtils]: 22: Hoare triple {1352#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {1352#false} is VALID [2018-11-23 13:04:54,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {1352#false} assume !(~j~0 % 4294967296 < 2); {1352#false} is VALID [2018-11-23 13:04:54,837 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1352#false} is VALID [2018-11-23 13:04:54,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {1352#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1352#false} is VALID [2018-11-23 13:04:54,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#false} assume !(0 != #t~mem11);havoc #t~mem11; {1352#false} is VALID [2018-11-23 13:04:54,838 INFO L256 TraceCheckUtils]: 27: Hoare triple {1352#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1352#false} is VALID [2018-11-23 13:04:54,838 INFO L273 TraceCheckUtils]: 28: Hoare triple {1352#false} ~cond := #in~cond; {1352#false} is VALID [2018-11-23 13:04:54,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {1352#false} assume 0 == ~cond; {1352#false} is VALID [2018-11-23 13:04:54,839 INFO L273 TraceCheckUtils]: 30: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2018-11-23 13:04:54,841 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:04:54,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:54,841 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:04:54,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:54,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:55,166 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:04:55,180 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:04:55,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:55,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:55,189 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:04:55,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 13:04:55,192 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:55,192 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#input_string~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (and (= 0 .cse0) (= |main_#t~mem11| .cse0))) [2018-11-23 13:04:55,193 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem11| 0) [2018-11-23 13:04:55,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {1351#true} call ULTIMATE.init(); {1351#true} is VALID [2018-11-23 13:04:55,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {1351#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1351#true} is VALID [2018-11-23 13:04:55,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {1351#true} assume true; {1351#true} is VALID [2018-11-23 13:04:55,238 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1351#true} {1351#true} #116#return; {1351#true} is VALID [2018-11-23 13:04:55,238 INFO L256 TraceCheckUtils]: 4: Hoare triple {1351#true} call #t~ret17 := main(); {1351#true} is VALID [2018-11-23 13:04:55,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {1351#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {1374#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:04:55,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {1374#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1378#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:55,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {1378#(= 0 |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1378#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:55,241 INFO L273 TraceCheckUtils]: 8: Hoare triple {1378#(= 0 |main_~#input_string~0.offset|)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {1378#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:55,241 INFO L273 TraceCheckUtils]: 9: Hoare triple {1378#(= 0 |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1378#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:55,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {1378#(= 0 |main_~#input_string~0.offset|)} assume !(~i~0 % 4294967296 < 5); {1378#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:55,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {1378#(= 0 |main_~#input_string~0.offset|)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {1378#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:55,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {1378#(= 0 |main_~#input_string~0.offset|)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {1397#(and (= main_~n_caracter~0 0) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:55,244 INFO L273 TraceCheckUtils]: 13: Hoare triple {1397#(and (= main_~n_caracter~0 0) (= 0 |main_~#input_string~0.offset|))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {1401#(and (= 0 |main_~#input_string~0.offset|) (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2018-11-23 13:04:55,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {1401#(and (= 0 |main_~#input_string~0.offset|) (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} assume !(0 != #t~mem4);havoc #t~mem4; {1405#(and (= 0 |main_~#input_string~0.offset|) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2018-11-23 13:04:55,246 INFO L273 TraceCheckUtils]: 15: Hoare triple {1405#(and (= 0 |main_~#input_string~0.offset|) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} ~cont~0 := 0;~i~0 := 0; {1405#(and (= 0 |main_~#input_string~0.offset|) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2018-11-23 13:04:55,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {1405#(and (= 0 |main_~#input_string~0.offset|) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {1405#(and (= 0 |main_~#input_string~0.offset|) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2018-11-23 13:04:55,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {1405#(and (= 0 |main_~#input_string~0.offset|) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} ~i~0 := 0;~cont_aux~0 := 0; {1415#(and (= 0 |main_~#input_string~0.offset|) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= main_~i~0 0))} is VALID [2018-11-23 13:04:55,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {1415#(and (= 0 |main_~#input_string~0.offset|) (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1419#(= |main_#t~mem11| 0)} is VALID [2018-11-23 13:04:55,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {1419#(= |main_#t~mem11| 0)} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {1352#false} is VALID [2018-11-23 13:04:55,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {1352#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {1352#false} is VALID [2018-11-23 13:04:55,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {1352#false} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {1352#false} is VALID [2018-11-23 13:04:55,251 INFO L273 TraceCheckUtils]: 22: Hoare triple {1352#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {1352#false} is VALID [2018-11-23 13:04:55,252 INFO L273 TraceCheckUtils]: 23: Hoare triple {1352#false} assume !(~j~0 % 4294967296 < 2); {1352#false} is VALID [2018-11-23 13:04:55,252 INFO L273 TraceCheckUtils]: 24: Hoare triple {1352#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {1352#false} is VALID [2018-11-23 13:04:55,252 INFO L273 TraceCheckUtils]: 25: Hoare triple {1352#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {1352#false} is VALID [2018-11-23 13:04:55,253 INFO L273 TraceCheckUtils]: 26: Hoare triple {1352#false} assume !(0 != #t~mem11);havoc #t~mem11; {1352#false} is VALID [2018-11-23 13:04:55,253 INFO L256 TraceCheckUtils]: 27: Hoare triple {1352#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {1352#false} is VALID [2018-11-23 13:04:55,253 INFO L273 TraceCheckUtils]: 28: Hoare triple {1352#false} ~cond := #in~cond; {1352#false} is VALID [2018-11-23 13:04:55,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {1352#false} assume 0 == ~cond; {1352#false} is VALID [2018-11-23 13:04:55,254 INFO L273 TraceCheckUtils]: 30: Hoare triple {1352#false} assume !false; {1352#false} is VALID [2018-11-23 13:04:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 13:04:55,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:55,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2018-11-23 13:04:55,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 13:04:55,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:55,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:04:55,455 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:04:55,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:04:55,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:04:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:04:55,456 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand 12 states. [2018-11-23 13:04:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,429 INFO L93 Difference]: Finished difference Result 166 states and 224 transitions. [2018-11-23 13:04:57,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:04:57,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-23 13:04:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:04:57,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2018-11-23 13:04:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:04:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2018-11-23 13:04:57,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 137 transitions. [2018-11-23 13:04:57,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:57,631 INFO L225 Difference]: With dead ends: 166 [2018-11-23 13:04:57,631 INFO L226 Difference]: Without dead ends: 123 [2018-11-23 13:04:57,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:04:57,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-23 13:04:57,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 49. [2018-11-23 13:04:57,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:57,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 49 states. [2018-11-23 13:04:57,791 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 49 states. [2018-11-23 13:04:57,791 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 49 states. [2018-11-23 13:04:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,796 INFO L93 Difference]: Finished difference Result 123 states and 167 transitions. [2018-11-23 13:04:57,796 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2018-11-23 13:04:57,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,797 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 123 states. [2018-11-23 13:04:57,797 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 123 states. [2018-11-23 13:04:57,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:57,802 INFO L93 Difference]: Finished difference Result 123 states and 167 transitions. [2018-11-23 13:04:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 167 transitions. [2018-11-23 13:04:57,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:57,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:57,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:57,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:04:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-23 13:04:57,805 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 31 [2018-11-23 13:04:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:57,806 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2018-11-23 13:04:57,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:04:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 13:04:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:04:57,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:57,807 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-11-23 13:04:57,807 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:57,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1875230733, now seen corresponding path program 1 times [2018-11-23 13:04:57,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:57,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:58,572 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2018-11-23 13:04:58,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {2009#true} call ULTIMATE.init(); {2009#true} is VALID [2018-11-23 13:04:58,977 INFO L273 TraceCheckUtils]: 1: Hoare triple {2009#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2009#true} is VALID [2018-11-23 13:04:58,978 INFO L273 TraceCheckUtils]: 2: Hoare triple {2009#true} assume true; {2009#true} is VALID [2018-11-23 13:04:58,978 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2009#true} {2009#true} #116#return; {2009#true} is VALID [2018-11-23 13:04:58,978 INFO L256 TraceCheckUtils]: 4: Hoare triple {2009#true} call #t~ret17 := main(); {2009#true} is VALID [2018-11-23 13:04:58,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {2009#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {2011#(= main_~i~0 0)} is VALID [2018-11-23 13:04:58,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {2011#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2011#(= main_~i~0 0)} is VALID [2018-11-23 13:04:58,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {2011#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2012#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:04:58,981 INFO L273 TraceCheckUtils]: 8: Hoare triple {2012#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2012#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:04:58,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {2012#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2013#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:04:58,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {2013#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2013#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:04:58,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {2013#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2014#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 3))} is VALID [2018-11-23 13:04:58,986 INFO L273 TraceCheckUtils]: 12: Hoare triple {2014#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 3))} assume !(~i~0 % 4294967296 < 5); {2010#false} is VALID [2018-11-23 13:04:58,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {2010#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2010#false} is VALID [2018-11-23 13:04:58,986 INFO L273 TraceCheckUtils]: 14: Hoare triple {2010#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2010#false} is VALID [2018-11-23 13:04:58,987 INFO L273 TraceCheckUtils]: 15: Hoare triple {2010#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2010#false} is VALID [2018-11-23 13:04:58,987 INFO L273 TraceCheckUtils]: 16: Hoare triple {2010#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2010#false} is VALID [2018-11-23 13:04:58,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {2010#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2010#false} is VALID [2018-11-23 13:04:58,988 INFO L273 TraceCheckUtils]: 18: Hoare triple {2010#false} assume !(0 != #t~mem4);havoc #t~mem4; {2010#false} is VALID [2018-11-23 13:04:58,989 INFO L273 TraceCheckUtils]: 19: Hoare triple {2010#false} ~cont~0 := 0;~i~0 := 0; {2010#false} is VALID [2018-11-23 13:04:58,989 INFO L273 TraceCheckUtils]: 20: Hoare triple {2010#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {2010#false} is VALID [2018-11-23 13:04:58,989 INFO L273 TraceCheckUtils]: 21: Hoare triple {2010#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2010#false} is VALID [2018-11-23 13:04:58,989 INFO L273 TraceCheckUtils]: 22: Hoare triple {2010#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {2010#false} is VALID [2018-11-23 13:04:58,990 INFO L273 TraceCheckUtils]: 23: Hoare triple {2010#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2010#false} is VALID [2018-11-23 13:04:58,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {2010#false} assume !(~j~0 % 4294967296 < 2); {2010#false} is VALID [2018-11-23 13:04:58,990 INFO L273 TraceCheckUtils]: 25: Hoare triple {2010#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2010#false} is VALID [2018-11-23 13:04:58,990 INFO L273 TraceCheckUtils]: 26: Hoare triple {2010#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2010#false} is VALID [2018-11-23 13:04:58,994 INFO L273 TraceCheckUtils]: 27: Hoare triple {2010#false} ~i~0 := 0;~cont_aux~0 := 0; {2010#false} is VALID [2018-11-23 13:04:58,994 INFO L273 TraceCheckUtils]: 28: Hoare triple {2010#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2010#false} is VALID [2018-11-23 13:04:58,994 INFO L273 TraceCheckUtils]: 29: Hoare triple {2010#false} assume !(0 != #t~mem11);havoc #t~mem11; {2010#false} is VALID [2018-11-23 13:04:58,995 INFO L256 TraceCheckUtils]: 30: Hoare triple {2010#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2010#false} is VALID [2018-11-23 13:04:58,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {2010#false} ~cond := #in~cond; {2010#false} is VALID [2018-11-23 13:04:58,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {2010#false} assume 0 == ~cond; {2010#false} is VALID [2018-11-23 13:04:58,995 INFO L273 TraceCheckUtils]: 33: Hoare triple {2010#false} assume !false; {2010#false} is VALID [2018-11-23 13:04:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:04:59,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:59,005 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:04:59,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:59,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:59,307 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:04:59,364 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:04:59,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:59,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:59,398 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:04:59,398 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 13:04:59,400 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:59,400 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#input_string~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (and (not (= 0 .cse0)) (= |main_#t~mem11| .cse0))) [2018-11-23 13:04:59,400 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_#t~mem11| 0)) [2018-11-23 13:04:59,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {2009#true} call ULTIMATE.init(); {2009#true} is VALID [2018-11-23 13:04:59,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {2009#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2009#true} is VALID [2018-11-23 13:04:59,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {2009#true} assume true; {2009#true} is VALID [2018-11-23 13:04:59,414 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2009#true} {2009#true} #116#return; {2009#true} is VALID [2018-11-23 13:04:59,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {2009#true} call #t~ret17 := main(); {2009#true} is VALID [2018-11-23 13:04:59,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {2009#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {2033#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:04:59,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {2033#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2037#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:59,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {2037#(= 0 |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2037#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:59,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {2037#(= 0 |main_~#input_string~0.offset|)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2037#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:59,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {2037#(= 0 |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2037#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:59,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {2037#(= 0 |main_~#input_string~0.offset|)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2037#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:59,419 INFO L273 TraceCheckUtils]: 11: Hoare triple {2037#(= 0 |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2037#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:59,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {2037#(= 0 |main_~#input_string~0.offset|)} assume !(~i~0 % 4294967296 < 5); {2037#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:59,419 INFO L273 TraceCheckUtils]: 13: Hoare triple {2037#(= 0 |main_~#input_string~0.offset|)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2037#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:04:59,420 INFO L273 TraceCheckUtils]: 14: Hoare triple {2037#(= 0 |main_~#input_string~0.offset|)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2062#(and (= main_~n_caracter~0 0) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,421 INFO L273 TraceCheckUtils]: 15: Hoare triple {2062#(and (= main_~n_caracter~0 0) (= 0 |main_~#input_string~0.offset|))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2066#(and (= 0 |main_~#input_string~0.offset|) (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} is VALID [2018-11-23 13:04:59,422 INFO L273 TraceCheckUtils]: 16: Hoare triple {2066#(and (= 0 |main_~#input_string~0.offset|) (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} assume !(0 != #t~mem4);havoc #t~mem4; {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} ~cont~0 := 0;~i~0 := 0; {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,425 INFO L273 TraceCheckUtils]: 20: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,427 INFO L273 TraceCheckUtils]: 22: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,428 INFO L273 TraceCheckUtils]: 23: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,429 INFO L273 TraceCheckUtils]: 24: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} assume !(~j~0 % 4294967296 < 2); {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,430 INFO L273 TraceCheckUtils]: 25: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,431 INFO L273 TraceCheckUtils]: 26: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:04:59,431 INFO L273 TraceCheckUtils]: 27: Hoare triple {2070#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|))} ~i~0 := 0;~cont_aux~0 := 0; {2104#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:04:59,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {2104#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2108#(not (= |main_#t~mem11| 0))} is VALID [2018-11-23 13:04:59,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {2108#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {2010#false} is VALID [2018-11-23 13:04:59,433 INFO L256 TraceCheckUtils]: 30: Hoare triple {2010#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2010#false} is VALID [2018-11-23 13:04:59,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {2010#false} ~cond := #in~cond; {2010#false} is VALID [2018-11-23 13:04:59,434 INFO L273 TraceCheckUtils]: 32: Hoare triple {2010#false} assume 0 == ~cond; {2010#false} is VALID [2018-11-23 13:04:59,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {2010#false} assume !false; {2010#false} is VALID [2018-11-23 13:04:59,438 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 13:04:59,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:59,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2018-11-23 13:04:59,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 13:04:59,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:59,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:04:59,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:59,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:04:59,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:04:59,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:04:59,565 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 13 states. [2018-11-23 13:05:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:01,644 INFO L93 Difference]: Finished difference Result 185 states and 252 transitions. [2018-11-23 13:05:01,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:05:01,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-23 13:05:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 151 transitions. [2018-11-23 13:05:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:01,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 151 transitions. [2018-11-23 13:05:01,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 151 transitions. [2018-11-23 13:05:01,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:01,927 INFO L225 Difference]: With dead ends: 185 [2018-11-23 13:05:01,927 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 13:05:01,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:05:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 13:05:02,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 53. [2018-11-23 13:05:02,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:02,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 53 states. [2018-11-23 13:05:02,070 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 53 states. [2018-11-23 13:05:02,071 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 53 states. [2018-11-23 13:05:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,076 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2018-11-23 13:05:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2018-11-23 13:05:02,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,076 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 149 states. [2018-11-23 13:05:02,077 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 149 states. [2018-11-23 13:05:02,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:02,082 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2018-11-23 13:05:02,082 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2018-11-23 13:05:02,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:02,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:02,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:02,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:05:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-23 13:05:02,085 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 34 [2018-11-23 13:05:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:02,085 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-23 13:05:02,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:05:02,086 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-23 13:05:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:05:02,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:02,087 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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:05:02,087 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:02,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:02,087 INFO L82 PathProgramCache]: Analyzing trace with hash 851826456, now seen corresponding path program 1 times [2018-11-23 13:05:02,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:02,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:02,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:02,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {2764#true} call ULTIMATE.init(); {2764#true} is VALID [2018-11-23 13:05:02,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {2764#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2764#true} is VALID [2018-11-23 13:05:02,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {2764#true} assume true; {2764#true} is VALID [2018-11-23 13:05:02,268 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2764#true} {2764#true} #116#return; {2764#true} is VALID [2018-11-23 13:05:02,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {2764#true} call #t~ret17 := main(); {2764#true} is VALID [2018-11-23 13:05:02,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {2764#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {2764#true} is VALID [2018-11-23 13:05:02,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {2764#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2764#true} is VALID [2018-11-23 13:05:02,270 INFO L273 TraceCheckUtils]: 7: Hoare triple {2764#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2764#true} is VALID [2018-11-23 13:05:02,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {2764#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2764#true} is VALID [2018-11-23 13:05:02,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {2764#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2764#true} is VALID [2018-11-23 13:05:02,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {2764#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2764#true} is VALID [2018-11-23 13:05:02,271 INFO L273 TraceCheckUtils]: 11: Hoare triple {2764#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2764#true} is VALID [2018-11-23 13:05:02,271 INFO L273 TraceCheckUtils]: 12: Hoare triple {2764#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2764#true} is VALID [2018-11-23 13:05:02,271 INFO L273 TraceCheckUtils]: 13: Hoare triple {2764#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2764#true} is VALID [2018-11-23 13:05:02,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {2764#true} assume !(~i~0 % 4294967296 < 5); {2764#true} is VALID [2018-11-23 13:05:02,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {2764#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2764#true} is VALID [2018-11-23 13:05:02,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {2764#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2766#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:05:02,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {2766#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2766#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:05:02,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {2766#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2767#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:05:02,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {2767#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2767#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:05:02,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {2767#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {2767#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:05:02,274 INFO L273 TraceCheckUtils]: 21: Hoare triple {2767#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} ~cont~0 := 0;~i~0 := 0; {2768#(and (<= 1 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2018-11-23 13:05:02,275 INFO L273 TraceCheckUtils]: 22: Hoare triple {2768#(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); {2765#false} is VALID [2018-11-23 13:05:02,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {2765#false} ~i~0 := 0;~cont_aux~0 := 0; {2765#false} is VALID [2018-11-23 13:05:02,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {2765#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2765#false} is VALID [2018-11-23 13:05:02,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {2765#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2765#false} is VALID [2018-11-23 13:05:02,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {2765#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2765#false} is VALID [2018-11-23 13:05:02,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {2765#false} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {2765#false} is VALID [2018-11-23 13:05:02,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {2765#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {2765#false} is VALID [2018-11-23 13:05:02,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {2765#false} assume !(~j~0 % 4294967296 < 2); {2765#false} is VALID [2018-11-23 13:05:02,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {2765#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2765#false} is VALID [2018-11-23 13:05:02,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {2765#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2765#false} is VALID [2018-11-23 13:05:02,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {2765#false} assume !(0 != #t~mem11);havoc #t~mem11; {2765#false} is VALID [2018-11-23 13:05:02,278 INFO L256 TraceCheckUtils]: 33: Hoare triple {2765#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2765#false} is VALID [2018-11-23 13:05:02,278 INFO L273 TraceCheckUtils]: 34: Hoare triple {2765#false} ~cond := #in~cond; {2765#false} is VALID [2018-11-23 13:05:02,278 INFO L273 TraceCheckUtils]: 35: Hoare triple {2765#false} assume 0 == ~cond; {2765#false} is VALID [2018-11-23 13:05:02,279 INFO L273 TraceCheckUtils]: 36: Hoare triple {2765#false} assume !false; {2765#false} is VALID [2018-11-23 13:05:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 13:05:02,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:02,280 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:05:02,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:02,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:02,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {2764#true} call ULTIMATE.init(); {2764#true} is VALID [2018-11-23 13:05:02,746 INFO L273 TraceCheckUtils]: 1: Hoare triple {2764#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2764#true} is VALID [2018-11-23 13:05:02,746 INFO L273 TraceCheckUtils]: 2: Hoare triple {2764#true} assume true; {2764#true} is VALID [2018-11-23 13:05:02,746 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2764#true} {2764#true} #116#return; {2764#true} is VALID [2018-11-23 13:05:02,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {2764#true} call #t~ret17 := main(); {2764#true} is VALID [2018-11-23 13:05:02,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {2764#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {2787#(= main_~i~0 0)} is VALID [2018-11-23 13:05:02,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {2787#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2787#(= main_~i~0 0)} is VALID [2018-11-23 13:05:02,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {2787#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2764#true} is VALID [2018-11-23 13:05:02,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {2764#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2764#true} is VALID [2018-11-23 13:05:02,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {2764#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2764#true} is VALID [2018-11-23 13:05:02,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {2764#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2764#true} is VALID [2018-11-23 13:05:02,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {2764#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2764#true} is VALID [2018-11-23 13:05:02,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {2764#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {2764#true} is VALID [2018-11-23 13:05:02,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {2764#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2764#true} is VALID [2018-11-23 13:05:02,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {2764#true} assume !(~i~0 % 4294967296 < 5); {2764#true} is VALID [2018-11-23 13:05:02,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {2764#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {2764#true} is VALID [2018-11-23 13:05:02,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {2764#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {2766#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:05:02,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {2766#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2766#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:05:02,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {2766#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {2827#(= main_~n_caracter~0 1)} is VALID [2018-11-23 13:05:02,751 INFO L273 TraceCheckUtils]: 19: Hoare triple {2827#(= main_~n_caracter~0 1)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {2827#(= main_~n_caracter~0 1)} is VALID [2018-11-23 13:05:02,753 INFO L273 TraceCheckUtils]: 20: Hoare triple {2827#(= main_~n_caracter~0 1)} assume !(0 != #t~mem4);havoc #t~mem4; {2827#(= main_~n_caracter~0 1)} is VALID [2018-11-23 13:05:02,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {2827#(= main_~n_caracter~0 1)} ~cont~0 := 0;~i~0 := 0; {2837#(and (= main_~n_caracter~0 1) (= main_~i~0 0))} is VALID [2018-11-23 13:05:02,762 INFO L273 TraceCheckUtils]: 22: Hoare triple {2837#(and (= main_~n_caracter~0 1) (= main_~i~0 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {2765#false} is VALID [2018-11-23 13:05:02,762 INFO L273 TraceCheckUtils]: 23: Hoare triple {2765#false} ~i~0 := 0;~cont_aux~0 := 0; {2765#false} is VALID [2018-11-23 13:05:02,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {2765#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2765#false} is VALID [2018-11-23 13:05:02,762 INFO L273 TraceCheckUtils]: 25: Hoare triple {2765#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {2765#false} is VALID [2018-11-23 13:05:02,763 INFO L273 TraceCheckUtils]: 26: Hoare triple {2765#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {2765#false} is VALID [2018-11-23 13:05:02,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {2765#false} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {2765#false} is VALID [2018-11-23 13:05:02,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {2765#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {2765#false} is VALID [2018-11-23 13:05:02,763 INFO L273 TraceCheckUtils]: 29: Hoare triple {2765#false} assume !(~j~0 % 4294967296 < 2); {2765#false} is VALID [2018-11-23 13:05:02,763 INFO L273 TraceCheckUtils]: 30: Hoare triple {2765#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {2765#false} is VALID [2018-11-23 13:05:02,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {2765#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {2765#false} is VALID [2018-11-23 13:05:02,764 INFO L273 TraceCheckUtils]: 32: Hoare triple {2765#false} assume !(0 != #t~mem11);havoc #t~mem11; {2765#false} is VALID [2018-11-23 13:05:02,764 INFO L256 TraceCheckUtils]: 33: Hoare triple {2765#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {2765#false} is VALID [2018-11-23 13:05:02,764 INFO L273 TraceCheckUtils]: 34: Hoare triple {2765#false} ~cond := #in~cond; {2765#false} is VALID [2018-11-23 13:05:02,764 INFO L273 TraceCheckUtils]: 35: Hoare triple {2765#false} assume 0 == ~cond; {2765#false} is VALID [2018-11-23 13:05:02,765 INFO L273 TraceCheckUtils]: 36: Hoare triple {2765#false} assume !false; {2765#false} is VALID [2018-11-23 13:05:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:05:02,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:02,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 13:05:02,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 13:05:02,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:02,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:05:02,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:02,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:05:02,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:05:02,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:02,929 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 8 states. [2018-11-23 13:05:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,246 INFO L93 Difference]: Finished difference Result 189 states and 256 transitions. [2018-11-23 13:05:04,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:05:04,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-11-23 13:05:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-23 13:05:04,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:05:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2018-11-23 13:05:04,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 150 transitions. [2018-11-23 13:05:04,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:04,480 INFO L225 Difference]: With dead ends: 189 [2018-11-23 13:05:04,481 INFO L226 Difference]: Without dead ends: 171 [2018-11-23 13:05:04,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:05:04,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-23 13:05:04,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 59. [2018-11-23 13:05:04,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:04,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 59 states. [2018-11-23 13:05:04,751 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 59 states. [2018-11-23 13:05:04,751 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 59 states. [2018-11-23 13:05:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,756 INFO L93 Difference]: Finished difference Result 171 states and 232 transitions. [2018-11-23 13:05:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2018-11-23 13:05:04,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,757 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 171 states. [2018-11-23 13:05:04,757 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 171 states. [2018-11-23 13:05:04,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:04,763 INFO L93 Difference]: Finished difference Result 171 states and 232 transitions. [2018-11-23 13:05:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2018-11-23 13:05:04,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:04,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:04,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:04,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:04,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 13:05:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2018-11-23 13:05:04,766 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 37 [2018-11-23 13:05:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:04,767 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2018-11-23 13:05:04,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:05:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2018-11-23 13:05:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:05:04,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:04,768 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1] [2018-11-23 13:05:04,768 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:04,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash -806485460, now seen corresponding path program 1 times [2018-11-23 13:05:04,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:04,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:04,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:04,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:04,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {3565#true} call ULTIMATE.init(); {3565#true} is VALID [2018-11-23 13:05:04,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {3565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3565#true} is VALID [2018-11-23 13:05:04,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {3565#true} assume true; {3565#true} is VALID [2018-11-23 13:05:04,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3565#true} {3565#true} #116#return; {3565#true} is VALID [2018-11-23 13:05:04,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {3565#true} call #t~ret17 := main(); {3565#true} is VALID [2018-11-23 13:05:04,868 INFO L273 TraceCheckUtils]: 5: Hoare triple {3565#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {3565#true} is VALID [2018-11-23 13:05:04,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {3565#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3565#true} is VALID [2018-11-23 13:05:04,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {3565#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3565#true} is VALID [2018-11-23 13:05:04,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {3565#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3565#true} is VALID [2018-11-23 13:05:04,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {3565#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3565#true} is VALID [2018-11-23 13:05:04,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {3565#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3565#true} is VALID [2018-11-23 13:05:04,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {3565#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3565#true} is VALID [2018-11-23 13:05:04,869 INFO L273 TraceCheckUtils]: 12: Hoare triple {3565#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3565#true} is VALID [2018-11-23 13:05:04,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {3565#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3565#true} is VALID [2018-11-23 13:05:04,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {3565#true} assume !(~i~0 % 4294967296 < 5); {3565#true} is VALID [2018-11-23 13:05:04,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {3565#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {3565#true} is VALID [2018-11-23 13:05:04,870 INFO L273 TraceCheckUtils]: 16: Hoare triple {3565#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {3565#true} is VALID [2018-11-23 13:05:04,870 INFO L273 TraceCheckUtils]: 17: Hoare triple {3565#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3565#true} is VALID [2018-11-23 13:05:04,871 INFO L273 TraceCheckUtils]: 18: Hoare triple {3565#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3565#true} is VALID [2018-11-23 13:05:04,871 INFO L273 TraceCheckUtils]: 19: Hoare triple {3565#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3565#true} is VALID [2018-11-23 13:05:04,871 INFO L273 TraceCheckUtils]: 20: Hoare triple {3565#true} assume !(0 != #t~mem4);havoc #t~mem4; {3565#true} is VALID [2018-11-23 13:05:04,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {3565#true} ~cont~0 := 0;~i~0 := 0; {3565#true} is VALID [2018-11-23 13:05:04,878 INFO L273 TraceCheckUtils]: 22: Hoare triple {3565#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {3567#(= main_~j~0 0)} is VALID [2018-11-23 13:05:04,879 INFO L273 TraceCheckUtils]: 23: Hoare triple {3567#(= main_~j~0 0)} assume !(~j~0 % 4294967296 < 2); {3566#false} is VALID [2018-11-23 13:05:04,879 INFO L273 TraceCheckUtils]: 24: Hoare triple {3566#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {3566#false} is VALID [2018-11-23 13:05:04,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {3566#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {3566#false} is VALID [2018-11-23 13:05:04,879 INFO L273 TraceCheckUtils]: 26: Hoare triple {3566#false} ~i~0 := 0;~cont_aux~0 := 0; {3566#false} is VALID [2018-11-23 13:05:04,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {3566#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3566#false} is VALID [2018-11-23 13:05:04,879 INFO L273 TraceCheckUtils]: 28: Hoare triple {3566#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3566#false} is VALID [2018-11-23 13:05:04,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {3566#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3566#false} is VALID [2018-11-23 13:05:04,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {3566#false} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {3566#false} is VALID [2018-11-23 13:05:04,880 INFO L273 TraceCheckUtils]: 31: Hoare triple {3566#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {3566#false} is VALID [2018-11-23 13:05:04,880 INFO L273 TraceCheckUtils]: 32: Hoare triple {3566#false} assume !(~j~0 % 4294967296 < 2); {3566#false} is VALID [2018-11-23 13:05:04,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {3566#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3566#false} is VALID [2018-11-23 13:05:04,880 INFO L273 TraceCheckUtils]: 34: Hoare triple {3566#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3566#false} is VALID [2018-11-23 13:05:04,880 INFO L273 TraceCheckUtils]: 35: Hoare triple {3566#false} assume !(0 != #t~mem11);havoc #t~mem11; {3566#false} is VALID [2018-11-23 13:05:04,881 INFO L256 TraceCheckUtils]: 36: Hoare triple {3566#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3566#false} is VALID [2018-11-23 13:05:04,881 INFO L273 TraceCheckUtils]: 37: Hoare triple {3566#false} ~cond := #in~cond; {3566#false} is VALID [2018-11-23 13:05:04,881 INFO L273 TraceCheckUtils]: 38: Hoare triple {3566#false} assume 0 == ~cond; {3566#false} is VALID [2018-11-23 13:05:04,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {3566#false} assume !false; {3566#false} is VALID [2018-11-23 13:05:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 13:05:04,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:05:04,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:05:04,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 13:05:04,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:04,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:05:04,932 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:04,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:05:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:05:04,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:05:04,933 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand 3 states. [2018-11-23 13:05:05,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:05,280 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2018-11-23 13:05:05,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:05:05,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-11-23 13:05:05,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:05:05,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 13:05:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:05:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-23 13:05:05,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-23 13:05:05,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:05,863 INFO L225 Difference]: With dead ends: 102 [2018-11-23 13:05:05,863 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 13:05:05,864 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:05:05,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 13:05:06,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2018-11-23 13:05:06,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:06,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 63 states. [2018-11-23 13:05:06,202 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 63 states. [2018-11-23 13:05:06,202 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 63 states. [2018-11-23 13:05:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,205 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2018-11-23 13:05:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2018-11-23 13:05:06,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:06,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:06,206 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 71 states. [2018-11-23 13:05:06,206 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 71 states. [2018-11-23 13:05:06,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:06,209 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2018-11-23 13:05:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2018-11-23 13:05:06,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:06,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:06,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:06,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:05:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2018-11-23 13:05:06,212 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 40 [2018-11-23 13:05:06,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:06,213 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2018-11-23 13:05:06,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:05:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2018-11-23 13:05:06,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:05:06,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:06,214 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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:06,214 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:06,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1582361826, now seen corresponding path program 2 times [2018-11-23 13:05:06,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:06,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:06,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:06,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:06,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:06,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {3946#true} call ULTIMATE.init(); {3946#true} is VALID [2018-11-23 13:05:06,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {3946#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3946#true} is VALID [2018-11-23 13:05:06,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {3946#true} assume true; {3946#true} is VALID [2018-11-23 13:05:06,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3946#true} {3946#true} #116#return; {3946#true} is VALID [2018-11-23 13:05:06,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {3946#true} call #t~ret17 := main(); {3946#true} is VALID [2018-11-23 13:05:06,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {3946#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {3946#true} is VALID [2018-11-23 13:05:06,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {3946#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3946#true} is VALID [2018-11-23 13:05:06,995 INFO L273 TraceCheckUtils]: 7: Hoare triple {3946#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3946#true} is VALID [2018-11-23 13:05:06,996 INFO L273 TraceCheckUtils]: 8: Hoare triple {3946#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3946#true} is VALID [2018-11-23 13:05:06,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {3946#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3946#true} is VALID [2018-11-23 13:05:06,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {3946#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3946#true} is VALID [2018-11-23 13:05:06,996 INFO L273 TraceCheckUtils]: 11: Hoare triple {3946#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3946#true} is VALID [2018-11-23 13:05:06,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {3946#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3946#true} is VALID [2018-11-23 13:05:06,996 INFO L273 TraceCheckUtils]: 13: Hoare triple {3946#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3946#true} is VALID [2018-11-23 13:05:06,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {3946#true} assume !(~i~0 % 4294967296 < 5); {3946#true} is VALID [2018-11-23 13:05:06,997 INFO L273 TraceCheckUtils]: 15: Hoare triple {3946#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {3946#true} is VALID [2018-11-23 13:05:06,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {3946#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {3948#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:05:06,998 INFO L273 TraceCheckUtils]: 17: Hoare triple {3948#(= main_~n_caracter~0 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3948#(= main_~n_caracter~0 0)} is VALID [2018-11-23 13:05:06,998 INFO L273 TraceCheckUtils]: 18: Hoare triple {3948#(= main_~n_caracter~0 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3949#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2018-11-23 13:05:06,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {3949#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3949#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} is VALID [2018-11-23 13:05:06,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {3949#(and (<= main_~n_caracter~0 1) (<= 1 main_~n_caracter~0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3950#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2018-11-23 13:05:07,002 INFO L273 TraceCheckUtils]: 21: Hoare triple {3950#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3950#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} is VALID [2018-11-23 13:05:07,003 INFO L273 TraceCheckUtils]: 22: Hoare triple {3950#(and (<= 2 main_~n_caracter~0) (<= main_~n_caracter~0 2))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {3951#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:05:07,004 INFO L273 TraceCheckUtils]: 23: Hoare triple {3951#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {3951#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:05:07,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {3951#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} assume !(0 != #t~mem4);havoc #t~mem4; {3951#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} is VALID [2018-11-23 13:05:07,005 INFO L273 TraceCheckUtils]: 25: Hoare triple {3951#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0))} ~cont~0 := 0;~i~0 := 0; {3952#(and (<= 3 main_~n_caracter~0) (<= (div main_~n_caracter~0 4294967296) 0) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,007 INFO L273 TraceCheckUtils]: 26: Hoare triple {3952#(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); {3947#false} is VALID [2018-11-23 13:05:07,008 INFO L273 TraceCheckUtils]: 27: Hoare triple {3947#false} ~i~0 := 0;~cont_aux~0 := 0; {3947#false} is VALID [2018-11-23 13:05:07,008 INFO L273 TraceCheckUtils]: 28: Hoare triple {3947#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3947#false} is VALID [2018-11-23 13:05:07,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {3947#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {3947#false} is VALID [2018-11-23 13:05:07,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {3947#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {3947#false} is VALID [2018-11-23 13:05:07,009 INFO L273 TraceCheckUtils]: 31: Hoare triple {3947#false} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {3947#false} is VALID [2018-11-23 13:05:07,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {3947#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {3947#false} is VALID [2018-11-23 13:05:07,009 INFO L273 TraceCheckUtils]: 33: Hoare triple {3947#false} assume !(~j~0 % 4294967296 < 2); {3947#false} is VALID [2018-11-23 13:05:07,010 INFO L273 TraceCheckUtils]: 34: Hoare triple {3947#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {3947#false} is VALID [2018-11-23 13:05:07,010 INFO L273 TraceCheckUtils]: 35: Hoare triple {3947#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {3947#false} is VALID [2018-11-23 13:05:07,010 INFO L273 TraceCheckUtils]: 36: Hoare triple {3947#false} assume !(0 != #t~mem11);havoc #t~mem11; {3947#false} is VALID [2018-11-23 13:05:07,010 INFO L256 TraceCheckUtils]: 37: Hoare triple {3947#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3947#false} is VALID [2018-11-23 13:05:07,011 INFO L273 TraceCheckUtils]: 38: Hoare triple {3947#false} ~cond := #in~cond; {3947#false} is VALID [2018-11-23 13:05:07,011 INFO L273 TraceCheckUtils]: 39: Hoare triple {3947#false} assume 0 == ~cond; {3947#false} is VALID [2018-11-23 13:05:07,011 INFO L273 TraceCheckUtils]: 40: Hoare triple {3947#false} assume !false; {3947#false} is VALID [2018-11-23 13:05:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 13:05:07,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:07,014 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:05:07,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:07,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:07,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:07,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:07,359 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:05:07,363 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:05:07,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:05:07,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:05:07,367 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:05:07,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 13:05:07,369 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:05:07,370 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#input_string~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#input_string~0.base|) 1))) (and (= |main_#t~mem11| .cse0) (not (= 0 .cse0)))) [2018-11-23 13:05:07,370 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_#t~mem11| 0)) [2018-11-23 13:05:07,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {3946#true} call ULTIMATE.init(); {3946#true} is VALID [2018-11-23 13:05:07,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {3946#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3946#true} is VALID [2018-11-23 13:05:07,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {3946#true} assume true; {3946#true} is VALID [2018-11-23 13:05:07,387 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3946#true} {3946#true} #116#return; {3946#true} is VALID [2018-11-23 13:05:07,387 INFO L256 TraceCheckUtils]: 4: Hoare triple {3946#true} call #t~ret17 := main(); {3946#true} is VALID [2018-11-23 13:05:07,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {3946#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {3971#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {3971#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3971#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {3971#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3978#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 1))} is VALID [2018-11-23 13:05:07,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {3978#(and (= 0 |main_~#input_string~0.offset|) (= main_~i~0 1))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3982#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:05:07,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {3982#(= 0 |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3982#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:05:07,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {3982#(= 0 |main_~#input_string~0.offset|)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3982#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:05:07,391 INFO L273 TraceCheckUtils]: 11: Hoare triple {3982#(= 0 |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3982#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:05:07,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {3982#(= 0 |main_~#input_string~0.offset|)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {3982#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:05:07,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {3982#(= 0 |main_~#input_string~0.offset|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3982#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:05:07,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {3982#(= 0 |main_~#input_string~0.offset|)} assume !(~i~0 % 4294967296 < 5); {3982#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:05:07,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {3982#(= 0 |main_~#input_string~0.offset|)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {3982#(= 0 |main_~#input_string~0.offset|)} is VALID [2018-11-23 13:05:07,393 INFO L273 TraceCheckUtils]: 16: Hoare triple {3982#(= 0 |main_~#input_string~0.offset|)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {4007#(and (= main_~n_caracter~0 0) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {4007#(and (= main_~n_caracter~0 0) (= 0 |main_~#input_string~0.offset|))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {4007#(and (= main_~n_caracter~0 0) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {4007#(and (= main_~n_caracter~0 0) (= 0 |main_~#input_string~0.offset|))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {4014#(and (= 0 |main_~#input_string~0.offset|) (= main_~n_caracter~0 1))} is VALID [2018-11-23 13:05:07,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {4014#(and (= 0 |main_~#input_string~0.offset|) (= main_~n_caracter~0 1))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {4018#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {4018#(and (= |main_#t~mem4| (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1))) (= 0 |main_~#input_string~0.offset|))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,397 INFO L273 TraceCheckUtils]: 22: Hoare triple {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,398 INFO L273 TraceCheckUtils]: 23: Hoare triple {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,399 INFO L273 TraceCheckUtils]: 24: Hoare triple {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} assume !(0 != #t~mem4);havoc #t~mem4; {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,399 INFO L273 TraceCheckUtils]: 25: Hoare triple {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} ~cont~0 := 0;~i~0 := 0; {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} is VALID [2018-11-23 13:05:07,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {4022#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|))} ~i~0 := 0;~cont_aux~0 := 0; {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,402 INFO L273 TraceCheckUtils]: 28: Hoare triple {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,402 INFO L273 TraceCheckUtils]: 29: Hoare triple {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,403 INFO L273 TraceCheckUtils]: 30: Hoare triple {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,406 INFO L273 TraceCheckUtils]: 33: Hoare triple {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} assume !(~j~0 % 4294967296 < 2); {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 13:05:07,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {4044#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {4066#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 1))} is VALID [2018-11-23 13:05:07,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {4066#(and (not (= 0 (select (select |#memory_int| |main_~#input_string~0.base|) (+ |main_~#input_string~0.offset| 1)))) (= 0 |main_~#input_string~0.offset|) (= main_~i~0 1))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {4070#(not (= |main_#t~mem11| 0))} is VALID [2018-11-23 13:05:07,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {4070#(not (= |main_#t~mem11| 0))} assume !(0 != #t~mem11);havoc #t~mem11; {3947#false} is VALID [2018-11-23 13:05:07,409 INFO L256 TraceCheckUtils]: 37: Hoare triple {3947#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {3947#false} is VALID [2018-11-23 13:05:07,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {3947#false} ~cond := #in~cond; {3947#false} is VALID [2018-11-23 13:05:07,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {3947#false} assume 0 == ~cond; {3947#false} is VALID [2018-11-23 13:05:07,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {3947#false} assume !false; {3947#false} is VALID [2018-11-23 13:05:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 13:05:07,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:07,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 17 [2018-11-23 13:05:07,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 13:05:07,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:07,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:05:07,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:07,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:05:07,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:05:07,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:05:07,500 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 17 states. [2018-11-23 13:05:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:13,473 INFO L93 Difference]: Finished difference Result 368 states and 494 transitions. [2018-11-23 13:05:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:05:13,473 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-23 13:05:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 253 transitions. [2018-11-23 13:05:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:05:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 253 transitions. [2018-11-23 13:05:13,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 253 transitions. [2018-11-23 13:05:13,816 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:13,826 INFO L225 Difference]: With dead ends: 368 [2018-11-23 13:05:13,827 INFO L226 Difference]: Without dead ends: 333 [2018-11-23 13:05:13,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:05:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-11-23 13:05:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 104. [2018-11-23 13:05:14,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:14,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand 104 states. [2018-11-23 13:05:14,912 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand 104 states. [2018-11-23 13:05:14,912 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 104 states. [2018-11-23 13:05:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,923 INFO L93 Difference]: Finished difference Result 333 states and 439 transitions. [2018-11-23 13:05:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 439 transitions. [2018-11-23 13:05:14,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:14,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:14,925 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 333 states. [2018-11-23 13:05:14,925 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 333 states. [2018-11-23 13:05:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:14,935 INFO L93 Difference]: Finished difference Result 333 states and 439 transitions. [2018-11-23 13:05:14,935 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 439 transitions. [2018-11-23 13:05:14,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:14,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:14,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:14,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:14,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 13:05:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2018-11-23 13:05:14,940 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 41 [2018-11-23 13:05:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:14,940 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2018-11-23 13:05:14,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:05:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2018-11-23 13:05:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 13:05:14,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:14,941 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:14,942 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:14,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1004006687, now seen corresponding path program 1 times [2018-11-23 13:05:14,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:14,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:14,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:14,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:14,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:15,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {5455#true} call ULTIMATE.init(); {5455#true} is VALID [2018-11-23 13:05:15,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {5455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5455#true} is VALID [2018-11-23 13:05:15,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {5455#true} assume true; {5455#true} is VALID [2018-11-23 13:05:15,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5455#true} {5455#true} #116#return; {5455#true} is VALID [2018-11-23 13:05:15,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {5455#true} call #t~ret17 := main(); {5455#true} is VALID [2018-11-23 13:05:15,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {5455#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5457#(= main_~i~0 0)} is VALID [2018-11-23 13:05:15,264 INFO L273 TraceCheckUtils]: 6: Hoare triple {5457#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5457#(= main_~i~0 0)} is VALID [2018-11-23 13:05:15,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {5457#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5458#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:05:15,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {5458#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5458#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} is VALID [2018-11-23 13:05:15,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {5458#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967294) 4294967296)) 1) main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5459#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:05:15,267 INFO L273 TraceCheckUtils]: 10: Hoare triple {5459#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5459#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} is VALID [2018-11-23 13:05:15,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {5459#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967293) 4294967296)) 2) main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5460#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:05:15,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {5460#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5460#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} is VALID [2018-11-23 13:05:15,271 INFO L273 TraceCheckUtils]: 13: Hoare triple {5460#(<= (+ (* 4294967296 (div (+ main_~i~0 4294967292) 4294967296)) 3) main_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5461#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 4))} is VALID [2018-11-23 13:05:15,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {5461#(<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 4))} assume !(~i~0 % 4294967296 < 5); {5456#false} is VALID [2018-11-23 13:05:15,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {5456#false} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5456#false} is VALID [2018-11-23 13:05:15,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {5456#false} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5456#false} is VALID [2018-11-23 13:05:15,273 INFO L273 TraceCheckUtils]: 17: Hoare triple {5456#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5456#false} is VALID [2018-11-23 13:05:15,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {5456#false} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5456#false} is VALID [2018-11-23 13:05:15,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {5456#false} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5456#false} is VALID [2018-11-23 13:05:15,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {5456#false} assume !(0 != #t~mem4);havoc #t~mem4; {5456#false} is VALID [2018-11-23 13:05:15,274 INFO L273 TraceCheckUtils]: 21: Hoare triple {5456#false} ~cont~0 := 0;~i~0 := 0; {5456#false} is VALID [2018-11-23 13:05:15,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {5456#false} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {5456#false} is VALID [2018-11-23 13:05:15,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {5456#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5456#false} is VALID [2018-11-23 13:05:15,275 INFO L273 TraceCheckUtils]: 24: Hoare triple {5456#false} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {5456#false} is VALID [2018-11-23 13:05:15,275 INFO L273 TraceCheckUtils]: 25: Hoare triple {5456#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5456#false} is VALID [2018-11-23 13:05:15,275 INFO L273 TraceCheckUtils]: 26: Hoare triple {5456#false} assume !(~j~0 % 4294967296 < 2); {5456#false} is VALID [2018-11-23 13:05:15,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {5456#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5456#false} is VALID [2018-11-23 13:05:15,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {5456#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5456#false} is VALID [2018-11-23 13:05:15,276 INFO L273 TraceCheckUtils]: 29: Hoare triple {5456#false} ~i~0 := 0;~cont_aux~0 := 0; {5456#false} is VALID [2018-11-23 13:05:15,276 INFO L273 TraceCheckUtils]: 30: Hoare triple {5456#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5456#false} is VALID [2018-11-23 13:05:15,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {5456#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5456#false} is VALID [2018-11-23 13:05:15,277 INFO L273 TraceCheckUtils]: 32: Hoare triple {5456#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5456#false} is VALID [2018-11-23 13:05:15,277 INFO L273 TraceCheckUtils]: 33: Hoare triple {5456#false} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {5456#false} is VALID [2018-11-23 13:05:15,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {5456#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5456#false} is VALID [2018-11-23 13:05:15,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {5456#false} assume !(~j~0 % 4294967296 < 2); {5456#false} is VALID [2018-11-23 13:05:15,278 INFO L273 TraceCheckUtils]: 36: Hoare triple {5456#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5456#false} is VALID [2018-11-23 13:05:15,278 INFO L273 TraceCheckUtils]: 37: Hoare triple {5456#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5456#false} is VALID [2018-11-23 13:05:15,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {5456#false} assume !(0 != #t~mem11);havoc #t~mem11; {5456#false} is VALID [2018-11-23 13:05:15,278 INFO L256 TraceCheckUtils]: 39: Hoare triple {5456#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5456#false} is VALID [2018-11-23 13:05:15,278 INFO L273 TraceCheckUtils]: 40: Hoare triple {5456#false} ~cond := #in~cond; {5456#false} is VALID [2018-11-23 13:05:15,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {5456#false} assume 0 == ~cond; {5456#false} is VALID [2018-11-23 13:05:15,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {5456#false} assume !false; {5456#false} is VALID [2018-11-23 13:05:15,282 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:05:15,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:15,283 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:05:15,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:15,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:15,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {5455#true} call ULTIMATE.init(); {5455#true} is VALID [2018-11-23 13:05:15,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {5455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5455#true} is VALID [2018-11-23 13:05:15,532 INFO L273 TraceCheckUtils]: 2: Hoare triple {5455#true} assume true; {5455#true} is VALID [2018-11-23 13:05:15,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5455#true} {5455#true} #116#return; {5455#true} is VALID [2018-11-23 13:05:15,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {5455#true} call #t~ret17 := main(); {5455#true} is VALID [2018-11-23 13:05:15,532 INFO L273 TraceCheckUtils]: 5: Hoare triple {5455#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {5457#(= main_~i~0 0)} is VALID [2018-11-23 13:05:15,534 INFO L273 TraceCheckUtils]: 6: Hoare triple {5457#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5457#(= main_~i~0 0)} is VALID [2018-11-23 13:05:15,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {5457#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5455#true} is VALID [2018-11-23 13:05:15,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {5455#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5455#true} is VALID [2018-11-23 13:05:15,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {5455#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5455#true} is VALID [2018-11-23 13:05:15,534 INFO L273 TraceCheckUtils]: 10: Hoare triple {5455#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5455#true} is VALID [2018-11-23 13:05:15,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {5455#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5455#true} is VALID [2018-11-23 13:05:15,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {5455#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {5455#true} is VALID [2018-11-23 13:05:15,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {5455#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5455#true} is VALID [2018-11-23 13:05:15,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {5455#true} assume !(~i~0 % 4294967296 < 5); {5455#true} is VALID [2018-11-23 13:05:15,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {5455#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {5455#true} is VALID [2018-11-23 13:05:15,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {5455#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {5455#true} is VALID [2018-11-23 13:05:15,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {5455#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5455#true} is VALID [2018-11-23 13:05:15,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {5455#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {5455#true} is VALID [2018-11-23 13:05:15,535 INFO L273 TraceCheckUtils]: 19: Hoare triple {5455#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {5455#true} is VALID [2018-11-23 13:05:15,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {5455#true} assume !(0 != #t~mem4);havoc #t~mem4; {5455#true} is VALID [2018-11-23 13:05:15,536 INFO L273 TraceCheckUtils]: 21: Hoare triple {5455#true} ~cont~0 := 0;~i~0 := 0; {5528#(= main_~cont~0 0)} is VALID [2018-11-23 13:05:15,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {5528#(= main_~cont~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {5528#(= main_~cont~0 0)} is VALID [2018-11-23 13:05:15,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {5528#(= main_~cont~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5528#(= main_~cont~0 0)} is VALID [2018-11-23 13:05:15,537 INFO L273 TraceCheckUtils]: 24: Hoare triple {5528#(= main_~cont~0 0)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {5538#(= main_~cont~0 1)} is VALID [2018-11-23 13:05:15,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {5538#(= main_~cont~0 1)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {5538#(= main_~cont~0 1)} is VALID [2018-11-23 13:05:15,538 INFO L273 TraceCheckUtils]: 26: Hoare triple {5538#(= main_~cont~0 1)} assume !(~j~0 % 4294967296 < 2); {5538#(= main_~cont~0 1)} is VALID [2018-11-23 13:05:15,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {5538#(= main_~cont~0 1)} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {5538#(= main_~cont~0 1)} is VALID [2018-11-23 13:05:15,539 INFO L273 TraceCheckUtils]: 28: Hoare triple {5538#(= main_~cont~0 1)} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {5538#(= main_~cont~0 1)} is VALID [2018-11-23 13:05:15,540 INFO L273 TraceCheckUtils]: 29: Hoare triple {5538#(= main_~cont~0 1)} ~i~0 := 0;~cont_aux~0 := 0; {5554#(and (= main_~cont~0 1) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:05:15,541 INFO L273 TraceCheckUtils]: 30: Hoare triple {5554#(and (= main_~cont~0 1) (= 0 main_~cont_aux~0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5554#(and (= main_~cont~0 1) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:05:15,555 INFO L273 TraceCheckUtils]: 31: Hoare triple {5554#(and (= main_~cont~0 1) (= 0 main_~cont_aux~0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {5554#(and (= main_~cont~0 1) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:05:15,556 INFO L273 TraceCheckUtils]: 32: Hoare triple {5554#(and (= main_~cont~0 1) (= 0 main_~cont_aux~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {5554#(and (= main_~cont~0 1) (= 0 main_~cont_aux~0))} is VALID [2018-11-23 13:05:15,556 INFO L273 TraceCheckUtils]: 33: Hoare triple {5554#(and (= main_~cont~0 1) (= 0 main_~cont_aux~0))} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} is VALID [2018-11-23 13:05:15,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} is VALID [2018-11-23 13:05:15,557 INFO L273 TraceCheckUtils]: 35: Hoare triple {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} assume !(~j~0 % 4294967296 < 2); {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} is VALID [2018-11-23 13:05:15,558 INFO L273 TraceCheckUtils]: 36: Hoare triple {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} is VALID [2018-11-23 13:05:15,558 INFO L273 TraceCheckUtils]: 37: Hoare triple {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} is VALID [2018-11-23 13:05:15,559 INFO L273 TraceCheckUtils]: 38: Hoare triple {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} assume !(0 != #t~mem11);havoc #t~mem11; {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} is VALID [2018-11-23 13:05:15,560 INFO L256 TraceCheckUtils]: 39: Hoare triple {5567#(and (= 1 main_~cont_aux~0) (= main_~cont~0 1))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {5586#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:05:15,560 INFO L273 TraceCheckUtils]: 40: Hoare triple {5586#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5590#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:05:15,561 INFO L273 TraceCheckUtils]: 41: Hoare triple {5590#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5456#false} is VALID [2018-11-23 13:05:15,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {5456#false} assume !false; {5456#false} is VALID [2018-11-23 13:05:15,564 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 13:05:15,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:15,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 13 [2018-11-23 13:05:15,583 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 13:05:15,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:15,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:05:15,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:15,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:05:15,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:05:15,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:05:15,653 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand 13 states. [2018-11-23 13:05:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:24,764 INFO L93 Difference]: Finished difference Result 594 states and 798 transitions. [2018-11-23 13:05:24,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 13:05:24,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-11-23 13:05:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:24,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 500 transitions. [2018-11-23 13:05:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:05:24,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 500 transitions. [2018-11-23 13:05:24,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 500 transitions. [2018-11-23 13:05:25,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:25,969 INFO L225 Difference]: With dead ends: 594 [2018-11-23 13:05:25,969 INFO L226 Difference]: Without dead ends: 498 [2018-11-23 13:05:25,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 13:05:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-11-23 13:05:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 140. [2018-11-23 13:05:26,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:26,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand 140 states. [2018-11-23 13:05:26,743 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand 140 states. [2018-11-23 13:05:26,743 INFO L87 Difference]: Start difference. First operand 498 states. Second operand 140 states. [2018-11-23 13:05:26,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:26,761 INFO L93 Difference]: Finished difference Result 498 states and 670 transitions. [2018-11-23 13:05:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 670 transitions. [2018-11-23 13:05:26,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:26,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:26,763 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 498 states. [2018-11-23 13:05:26,763 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 498 states. [2018-11-23 13:05:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:26,781 INFO L93 Difference]: Finished difference Result 498 states and 670 transitions. [2018-11-23 13:05:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 670 transitions. [2018-11-23 13:05:26,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:26,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:26,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:26,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-23 13:05:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 179 transitions. [2018-11-23 13:05:26,787 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 179 transitions. Word has length 43 [2018-11-23 13:05:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:26,788 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 179 transitions. [2018-11-23 13:05:26,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:05:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2018-11-23 13:05:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 13:05:26,789 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:26,789 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:26,789 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:26,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash -346830021, now seen corresponding path program 1 times [2018-11-23 13:05:26,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:26,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:26,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:26,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:27,303 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-11-23 13:05:27,306 INFO L256 TraceCheckUtils]: 0: Hoare triple {7695#true} call ULTIMATE.init(); {7695#true} is VALID [2018-11-23 13:05:27,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {7695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7695#true} is VALID [2018-11-23 13:05:27,306 INFO L273 TraceCheckUtils]: 2: Hoare triple {7695#true} assume true; {7695#true} is VALID [2018-11-23 13:05:27,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7695#true} {7695#true} #116#return; {7695#true} is VALID [2018-11-23 13:05:27,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {7695#true} call #t~ret17 := main(); {7695#true} is VALID [2018-11-23 13:05:27,307 INFO L273 TraceCheckUtils]: 5: Hoare triple {7695#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {7695#true} is VALID [2018-11-23 13:05:27,307 INFO L273 TraceCheckUtils]: 6: Hoare triple {7695#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7695#true} is VALID [2018-11-23 13:05:27,307 INFO L273 TraceCheckUtils]: 7: Hoare triple {7695#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7695#true} is VALID [2018-11-23 13:05:27,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {7695#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7695#true} is VALID [2018-11-23 13:05:27,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {7695#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7695#true} is VALID [2018-11-23 13:05:27,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {7695#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7695#true} is VALID [2018-11-23 13:05:27,308 INFO L273 TraceCheckUtils]: 11: Hoare triple {7695#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7695#true} is VALID [2018-11-23 13:05:27,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {7695#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7695#true} is VALID [2018-11-23 13:05:27,308 INFO L273 TraceCheckUtils]: 13: Hoare triple {7695#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7695#true} is VALID [2018-11-23 13:05:27,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {7695#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7695#true} is VALID [2018-11-23 13:05:27,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {7695#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7695#true} is VALID [2018-11-23 13:05:27,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {7695#true} assume !(~i~0 % 4294967296 < 5); {7695#true} is VALID [2018-11-23 13:05:27,308 INFO L273 TraceCheckUtils]: 17: Hoare triple {7695#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {7695#true} is VALID [2018-11-23 13:05:27,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {7695#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {7695#true} is VALID [2018-11-23 13:05:27,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {7695#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7695#true} is VALID [2018-11-23 13:05:27,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {7695#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {7695#true} is VALID [2018-11-23 13:05:27,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {7695#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7695#true} is VALID [2018-11-23 13:05:27,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {7695#true} assume !(0 != #t~mem4);havoc #t~mem4; {7695#true} is VALID [2018-11-23 13:05:27,309 INFO L273 TraceCheckUtils]: 23: Hoare triple {7695#true} ~cont~0 := 0;~i~0 := 0; {7695#true} is VALID [2018-11-23 13:05:27,309 INFO L273 TraceCheckUtils]: 24: Hoare triple {7695#true} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {7697#(= main_~j~0 0)} is VALID [2018-11-23 13:05:27,310 INFO L273 TraceCheckUtils]: 25: Hoare triple {7697#(= main_~j~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7697#(= main_~j~0 0)} is VALID [2018-11-23 13:05:27,310 INFO L273 TraceCheckUtils]: 26: Hoare triple {7697#(= main_~j~0 0)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {7697#(= main_~j~0 0)} is VALID [2018-11-23 13:05:27,311 INFO L273 TraceCheckUtils]: 27: Hoare triple {7697#(= main_~j~0 0)} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7698#(and (<= main_~j~0 1) (< 0 (+ (div main_~j~0 4294967296) 1)))} is VALID [2018-11-23 13:05:27,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {7698#(and (<= main_~j~0 1) (< 0 (+ (div main_~j~0 4294967296) 1)))} assume !(~j~0 % 4294967296 < 2); {7696#false} is VALID [2018-11-23 13:05:27,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {7696#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7696#false} is VALID [2018-11-23 13:05:27,311 INFO L273 TraceCheckUtils]: 30: Hoare triple {7696#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {7696#false} is VALID [2018-11-23 13:05:27,312 INFO L273 TraceCheckUtils]: 31: Hoare triple {7696#false} ~i~0 := 0;~cont_aux~0 := 0; {7696#false} is VALID [2018-11-23 13:05:27,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {7696#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7696#false} is VALID [2018-11-23 13:05:27,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {7696#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7696#false} is VALID [2018-11-23 13:05:27,312 INFO L273 TraceCheckUtils]: 34: Hoare triple {7696#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7696#false} is VALID [2018-11-23 13:05:27,312 INFO L273 TraceCheckUtils]: 35: Hoare triple {7696#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem14;havoc #t~mem13; {7696#false} is VALID [2018-11-23 13:05:27,312 INFO L273 TraceCheckUtils]: 36: Hoare triple {7696#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7696#false} is VALID [2018-11-23 13:05:27,312 INFO L273 TraceCheckUtils]: 37: Hoare triple {7696#false} assume !(~j~0 % 4294967296 < 2); {7696#false} is VALID [2018-11-23 13:05:27,313 INFO L273 TraceCheckUtils]: 38: Hoare triple {7696#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7696#false} is VALID [2018-11-23 13:05:27,313 INFO L273 TraceCheckUtils]: 39: Hoare triple {7696#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7696#false} is VALID [2018-11-23 13:05:27,313 INFO L273 TraceCheckUtils]: 40: Hoare triple {7696#false} assume !(0 != #t~mem11);havoc #t~mem11; {7696#false} is VALID [2018-11-23 13:05:27,313 INFO L256 TraceCheckUtils]: 41: Hoare triple {7696#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {7696#false} is VALID [2018-11-23 13:05:27,313 INFO L273 TraceCheckUtils]: 42: Hoare triple {7696#false} ~cond := #in~cond; {7696#false} is VALID [2018-11-23 13:05:27,313 INFO L273 TraceCheckUtils]: 43: Hoare triple {7696#false} assume 0 == ~cond; {7696#false} is VALID [2018-11-23 13:05:27,313 INFO L273 TraceCheckUtils]: 44: Hoare triple {7696#false} assume !false; {7696#false} is VALID [2018-11-23 13:05:27,314 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 13:05:27,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:27,315 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:05:27,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:27,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:27,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-23 13:05:27,591 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:05:27,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:05:27,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:05:27,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:05:27,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-23 13:05:27,605 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:05:27,606 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#vogal_array~0.base|, |main_~#input_string~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#vogal_array~0.base|) 0)) (.cse1 (select (select |#memory_int| |main_~#input_string~0.base|) 0))) (and (= |main_#t~mem14| .cse0) (= .cse1 .cse0) (= |main_#t~mem13| .cse1))) [2018-11-23 13:05:27,606 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem14| |main_#t~mem13|) [2018-11-23 13:05:27,620 INFO L256 TraceCheckUtils]: 0: Hoare triple {7695#true} call ULTIMATE.init(); {7695#true} is VALID [2018-11-23 13:05:27,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {7695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7695#true} is VALID [2018-11-23 13:05:27,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {7695#true} assume true; {7695#true} is VALID [2018-11-23 13:05:27,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7695#true} {7695#true} #116#return; {7695#true} is VALID [2018-11-23 13:05:27,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {7695#true} call #t~ret17 := main(); {7695#true} is VALID [2018-11-23 13:05:27,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {7695#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {7717#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:05:27,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {7717#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,627 INFO L273 TraceCheckUtils]: 10: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,627 INFO L273 TraceCheckUtils]: 11: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,630 INFO L273 TraceCheckUtils]: 14: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,636 INFO L273 TraceCheckUtils]: 23: Hoare triple {7721#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {7717#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:05:27,637 INFO L273 TraceCheckUtils]: 24: Hoare triple {7717#(and (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {7776#(and (= 0 |main_~#input_string~0.offset|) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:05:27,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {7776#(and (= 0 |main_~#input_string~0.offset|) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7780#(and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} is VALID [2018-11-23 13:05:27,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {7780#(and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= 0 |main_~#input_string~0.offset|) (= |main_~#vogal_array~0.offset| 0) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,640 INFO L273 TraceCheckUtils]: 27: Hoare triple {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,641 INFO L273 TraceCheckUtils]: 28: Hoare triple {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} assume !(~j~0 % 4294967296 < 2); {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,642 INFO L273 TraceCheckUtils]: 29: Hoare triple {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:27,643 INFO L273 TraceCheckUtils]: 31: Hoare triple {7784#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0))} ~i~0 := 0;~cont_aux~0 := 0; {7800#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:05:27,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {7800#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7800#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:05:27,645 INFO L273 TraceCheckUtils]: 33: Hoare triple {7800#(and (= 0 |main_~#input_string~0.offset|) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {7807#(and (= 0 |main_~#input_string~0.offset|) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:05:27,646 INFO L273 TraceCheckUtils]: 34: Hoare triple {7807#(and (= 0 |main_~#input_string~0.offset|) (= main_~j~0 0) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) |main_~#input_string~0.offset|)) (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {7811#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2018-11-23 13:05:27,647 INFO L273 TraceCheckUtils]: 35: Hoare triple {7811#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem14;havoc #t~mem13; {7696#false} is VALID [2018-11-23 13:05:27,647 INFO L273 TraceCheckUtils]: 36: Hoare triple {7696#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {7696#false} is VALID [2018-11-23 13:05:27,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {7696#false} assume !(~j~0 % 4294967296 < 2); {7696#false} is VALID [2018-11-23 13:05:27,648 INFO L273 TraceCheckUtils]: 38: Hoare triple {7696#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {7696#false} is VALID [2018-11-23 13:05:27,648 INFO L273 TraceCheckUtils]: 39: Hoare triple {7696#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {7696#false} is VALID [2018-11-23 13:05:27,648 INFO L273 TraceCheckUtils]: 40: Hoare triple {7696#false} assume !(0 != #t~mem11);havoc #t~mem11; {7696#false} is VALID [2018-11-23 13:05:27,648 INFO L256 TraceCheckUtils]: 41: Hoare triple {7696#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {7696#false} is VALID [2018-11-23 13:05:27,648 INFO L273 TraceCheckUtils]: 42: Hoare triple {7696#false} ~cond := #in~cond; {7696#false} is VALID [2018-11-23 13:05:27,649 INFO L273 TraceCheckUtils]: 43: Hoare triple {7696#false} assume 0 == ~cond; {7696#false} is VALID [2018-11-23 13:05:27,649 INFO L273 TraceCheckUtils]: 44: Hoare triple {7696#false} assume !false; {7696#false} is VALID [2018-11-23 13:05:27,653 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 13:05:27,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:27,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10] total 12 [2018-11-23 13:05:27,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-23 13:05:27,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:27,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:05:27,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:27,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:05:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:05:27,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:05:27,733 INFO L87 Difference]: Start difference. First operand 140 states and 179 transitions. Second operand 12 states. [2018-11-23 13:05:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:31,244 INFO L93 Difference]: Finished difference Result 478 states and 658 transitions. [2018-11-23 13:05:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:05:31,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-11-23 13:05:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 180 transitions. [2018-11-23 13:05:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:05:31,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 180 transitions. [2018-11-23 13:05:31,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 180 transitions. [2018-11-23 13:05:31,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:31,914 INFO L225 Difference]: With dead ends: 478 [2018-11-23 13:05:31,914 INFO L226 Difference]: Without dead ends: 397 [2018-11-23 13:05:31,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:05:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-11-23 13:05:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 238. [2018-11-23 13:05:33,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:33,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand 238 states. [2018-11-23 13:05:33,061 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand 238 states. [2018-11-23 13:05:33,061 INFO L87 Difference]: Start difference. First operand 397 states. Second operand 238 states. [2018-11-23 13:05:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:33,073 INFO L93 Difference]: Finished difference Result 397 states and 525 transitions. [2018-11-23 13:05:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 525 transitions. [2018-11-23 13:05:33,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:33,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:33,075 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 397 states. [2018-11-23 13:05:33,075 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 397 states. [2018-11-23 13:05:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:33,088 INFO L93 Difference]: Finished difference Result 397 states and 525 transitions. [2018-11-23 13:05:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 525 transitions. [2018-11-23 13:05:33,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:33,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:33,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:33,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:33,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-23 13:05:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 306 transitions. [2018-11-23 13:05:33,096 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 306 transitions. Word has length 45 [2018-11-23 13:05:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:33,096 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 306 transitions. [2018-11-23 13:05:33,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:05:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 306 transitions. [2018-11-23 13:05:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:05:33,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:33,098 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-11-23 13:05:33,098 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:33,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:33,098 INFO L82 PathProgramCache]: Analyzing trace with hash -57035726, now seen corresponding path program 2 times [2018-11-23 13:05:33,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:33,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:33,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:33,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:33,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:33,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {9641#true} call ULTIMATE.init(); {9641#true} is VALID [2018-11-23 13:05:33,475 INFO L273 TraceCheckUtils]: 1: Hoare triple {9641#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9641#true} is VALID [2018-11-23 13:05:33,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {9641#true} assume true; {9641#true} is VALID [2018-11-23 13:05:33,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9641#true} {9641#true} #116#return; {9641#true} is VALID [2018-11-23 13:05:33,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {9641#true} call #t~ret17 := main(); {9641#true} is VALID [2018-11-23 13:05:33,475 INFO L273 TraceCheckUtils]: 5: Hoare triple {9641#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {9641#true} is VALID [2018-11-23 13:05:33,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {9641#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9641#true} is VALID [2018-11-23 13:05:33,476 INFO L273 TraceCheckUtils]: 7: Hoare triple {9641#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9641#true} is VALID [2018-11-23 13:05:33,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {9641#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9641#true} is VALID [2018-11-23 13:05:33,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {9641#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9641#true} is VALID [2018-11-23 13:05:33,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {9641#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9641#true} is VALID [2018-11-23 13:05:33,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {9641#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9641#true} is VALID [2018-11-23 13:05:33,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {9641#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9641#true} is VALID [2018-11-23 13:05:33,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {9641#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9641#true} is VALID [2018-11-23 13:05:33,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {9641#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9641#true} is VALID [2018-11-23 13:05:33,477 INFO L273 TraceCheckUtils]: 15: Hoare triple {9641#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9641#true} is VALID [2018-11-23 13:05:33,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {9641#true} assume !(~i~0 % 4294967296 < 5); {9641#true} is VALID [2018-11-23 13:05:33,477 INFO L273 TraceCheckUtils]: 17: Hoare triple {9641#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {9641#true} is VALID [2018-11-23 13:05:33,478 INFO L273 TraceCheckUtils]: 18: Hoare triple {9641#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {9641#true} is VALID [2018-11-23 13:05:33,478 INFO L273 TraceCheckUtils]: 19: Hoare triple {9641#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9641#true} is VALID [2018-11-23 13:05:33,478 INFO L273 TraceCheckUtils]: 20: Hoare triple {9641#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {9641#true} is VALID [2018-11-23 13:05:33,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {9641#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9641#true} is VALID [2018-11-23 13:05:33,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {9641#true} assume !(0 != #t~mem4);havoc #t~mem4; {9641#true} is VALID [2018-11-23 13:05:33,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {9641#true} ~cont~0 := 0;~i~0 := 0; {9643#(= main_~cont~0 0)} is VALID [2018-11-23 13:05:33,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {9643#(= main_~cont~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {9643#(= main_~cont~0 0)} is VALID [2018-11-23 13:05:33,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {9643#(= main_~cont~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9643#(= main_~cont~0 0)} is VALID [2018-11-23 13:05:33,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {9643#(= main_~cont~0 0)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2018-11-23 13:05:33,480 INFO L273 TraceCheckUtils]: 27: Hoare triple {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2018-11-23 13:05:33,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2018-11-23 13:05:33,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,482 INFO L273 TraceCheckUtils]: 30: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~j~0 % 4294967296 < 2); {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,484 INFO L273 TraceCheckUtils]: 33: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,484 INFO L273 TraceCheckUtils]: 34: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} ~i~0 := 0;~cont_aux~0 := 0; {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} is VALID [2018-11-23 13:05:33,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} is VALID [2018-11-23 13:05:33,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} is VALID [2018-11-23 13:05:33,487 INFO L273 TraceCheckUtils]: 37: Hoare triple {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} is VALID [2018-11-23 13:05:33,488 INFO L273 TraceCheckUtils]: 38: Hoare triple {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {9647#(and (<= (+ main_~cont_aux~0 1) main_~cont~0) (<= main_~cont~0 (+ main_~cont_aux~0 1)))} is VALID [2018-11-23 13:05:33,489 INFO L273 TraceCheckUtils]: 39: Hoare triple {9647#(and (<= (+ main_~cont_aux~0 1) main_~cont~0) (<= main_~cont~0 (+ main_~cont_aux~0 1)))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {9647#(and (<= (+ main_~cont_aux~0 1) main_~cont~0) (<= main_~cont~0 (+ main_~cont_aux~0 1)))} is VALID [2018-11-23 13:05:33,490 INFO L273 TraceCheckUtils]: 40: Hoare triple {9647#(and (<= (+ main_~cont_aux~0 1) main_~cont~0) (<= main_~cont~0 (+ main_~cont_aux~0 1)))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9647#(and (<= (+ main_~cont_aux~0 1) main_~cont~0) (<= main_~cont~0 (+ main_~cont_aux~0 1)))} is VALID [2018-11-23 13:05:33,491 INFO L273 TraceCheckUtils]: 41: Hoare triple {9647#(and (<= (+ main_~cont_aux~0 1) main_~cont~0) (<= main_~cont~0 (+ main_~cont_aux~0 1)))} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} is VALID [2018-11-23 13:05:33,492 INFO L273 TraceCheckUtils]: 42: Hoare triple {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} is VALID [2018-11-23 13:05:33,493 INFO L273 TraceCheckUtils]: 43: Hoare triple {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} assume !(~j~0 % 4294967296 < 2); {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} is VALID [2018-11-23 13:05:33,494 INFO L273 TraceCheckUtils]: 44: Hoare triple {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} is VALID [2018-11-23 13:05:33,495 INFO L273 TraceCheckUtils]: 45: Hoare triple {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} is VALID [2018-11-23 13:05:33,496 INFO L273 TraceCheckUtils]: 46: Hoare triple {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} assume !(0 != #t~mem11);havoc #t~mem11; {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} is VALID [2018-11-23 13:05:33,498 INFO L256 TraceCheckUtils]: 47: Hoare triple {9648#(and (<= (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296))) (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0)) (< (div main_~cont_aux~0 4294967296) (+ (div main_~cont~0 4294967296) 1)) (< (+ (* 4294967296 (div main_~cont~0 4294967296)) main_~cont_aux~0) (+ main_~cont~0 (* 4294967296 (div main_~cont_aux~0 4294967296)) 1)) (<= (div main_~cont~0 4294967296) (div main_~cont_aux~0 4294967296)))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {9649#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:05:33,499 INFO L273 TraceCheckUtils]: 48: Hoare triple {9649#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9650#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:05:33,499 INFO L273 TraceCheckUtils]: 49: Hoare triple {9650#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {9642#false} is VALID [2018-11-23 13:05:33,500 INFO L273 TraceCheckUtils]: 50: Hoare triple {9642#false} assume !false; {9642#false} is VALID [2018-11-23 13:05:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 13:05:33,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:33,505 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:05:33,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:05:33,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:05:33,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:05:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:33,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:05:33,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {9641#true} call ULTIMATE.init(); {9641#true} is VALID [2018-11-23 13:05:33,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {9641#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9641#true} is VALID [2018-11-23 13:05:33,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {9641#true} assume true; {9641#true} is VALID [2018-11-23 13:05:33,751 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9641#true} {9641#true} #116#return; {9641#true} is VALID [2018-11-23 13:05:33,751 INFO L256 TraceCheckUtils]: 4: Hoare triple {9641#true} call #t~ret17 := main(); {9641#true} is VALID [2018-11-23 13:05:33,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {9641#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {9669#(= main_~i~0 0)} is VALID [2018-11-23 13:05:33,752 INFO L273 TraceCheckUtils]: 6: Hoare triple {9669#(= main_~i~0 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9669#(= main_~i~0 0)} is VALID [2018-11-23 13:05:33,752 INFO L273 TraceCheckUtils]: 7: Hoare triple {9669#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9676#(= main_~i~0 1)} is VALID [2018-11-23 13:05:33,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {9676#(= main_~i~0 1)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9676#(= main_~i~0 1)} is VALID [2018-11-23 13:05:33,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {9676#(= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9641#true} is VALID [2018-11-23 13:05:33,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {9641#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9641#true} is VALID [2018-11-23 13:05:33,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {9641#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9641#true} is VALID [2018-11-23 13:05:33,753 INFO L273 TraceCheckUtils]: 12: Hoare triple {9641#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9641#true} is VALID [2018-11-23 13:05:33,753 INFO L273 TraceCheckUtils]: 13: Hoare triple {9641#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9641#true} is VALID [2018-11-23 13:05:33,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {9641#true} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {9641#true} is VALID [2018-11-23 13:05:33,753 INFO L273 TraceCheckUtils]: 15: Hoare triple {9641#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9641#true} is VALID [2018-11-23 13:05:33,753 INFO L273 TraceCheckUtils]: 16: Hoare triple {9641#true} assume !(~i~0 % 4294967296 < 5); {9641#true} is VALID [2018-11-23 13:05:33,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {9641#true} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {9641#true} is VALID [2018-11-23 13:05:33,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {9641#true} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {9641#true} is VALID [2018-11-23 13:05:33,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {9641#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9641#true} is VALID [2018-11-23 13:05:33,754 INFO L273 TraceCheckUtils]: 20: Hoare triple {9641#true} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {9641#true} is VALID [2018-11-23 13:05:33,754 INFO L273 TraceCheckUtils]: 21: Hoare triple {9641#true} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {9641#true} is VALID [2018-11-23 13:05:33,755 INFO L273 TraceCheckUtils]: 22: Hoare triple {9641#true} assume !(0 != #t~mem4);havoc #t~mem4; {9641#true} is VALID [2018-11-23 13:05:33,755 INFO L273 TraceCheckUtils]: 23: Hoare triple {9641#true} ~cont~0 := 0;~i~0 := 0; {9643#(= main_~cont~0 0)} is VALID [2018-11-23 13:05:33,756 INFO L273 TraceCheckUtils]: 24: Hoare triple {9643#(= main_~cont~0 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {9643#(= main_~cont~0 0)} is VALID [2018-11-23 13:05:33,756 INFO L273 TraceCheckUtils]: 25: Hoare triple {9643#(= main_~cont~0 0)} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9643#(= main_~cont~0 0)} is VALID [2018-11-23 13:05:33,756 INFO L273 TraceCheckUtils]: 26: Hoare triple {9643#(= main_~cont~0 0)} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2018-11-23 13:05:33,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2018-11-23 13:05:33,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} is VALID [2018-11-23 13:05:33,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {9644#(and (<= main_~cont~0 1) (<= 1 main_~cont~0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,759 INFO L273 TraceCheckUtils]: 30: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,759 INFO L273 TraceCheckUtils]: 31: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~j~0 % 4294967296 < 2); {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,760 INFO L273 TraceCheckUtils]: 32: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,761 INFO L273 TraceCheckUtils]: 33: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,761 INFO L273 TraceCheckUtils]: 34: Hoare triple {9645#(and (<= main_~cont~0 2) (<= 2 main_~cont~0))} ~i~0 := 0;~cont_aux~0 := 0; {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} is VALID [2018-11-23 13:05:33,762 INFO L273 TraceCheckUtils]: 35: Hoare triple {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} is VALID [2018-11-23 13:05:33,763 INFO L273 TraceCheckUtils]: 36: Hoare triple {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} is VALID [2018-11-23 13:05:33,764 INFO L273 TraceCheckUtils]: 37: Hoare triple {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} is VALID [2018-11-23 13:05:33,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {9646#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= main_~cont_aux~0 0))} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {9770#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= 1 main_~cont_aux~0))} is VALID [2018-11-23 13:05:33,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {9770#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= 1 main_~cont_aux~0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {9770#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= 1 main_~cont_aux~0))} is VALID [2018-11-23 13:05:33,766 INFO L273 TraceCheckUtils]: 40: Hoare triple {9770#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= 1 main_~cont_aux~0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {9770#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= 1 main_~cont_aux~0))} is VALID [2018-11-23 13:05:33,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {9770#(and (<= main_~cont~0 2) (<= 2 main_~cont~0) (= 1 main_~cont_aux~0))} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,781 INFO L273 TraceCheckUtils]: 42: Hoare triple {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,781 INFO L273 TraceCheckUtils]: 43: Hoare triple {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} assume !(~j~0 % 4294967296 < 2); {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,782 INFO L273 TraceCheckUtils]: 44: Hoare triple {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,782 INFO L273 TraceCheckUtils]: 45: Hoare triple {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,783 INFO L273 TraceCheckUtils]: 46: Hoare triple {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} assume !(0 != #t~mem11);havoc #t~mem11; {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} is VALID [2018-11-23 13:05:33,783 INFO L256 TraceCheckUtils]: 47: Hoare triple {9780#(and (<= main_~cont~0 2) (= 2 main_~cont_aux~0) (<= 2 main_~cont~0))} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {9649#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:05:33,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {9649#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9650#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:05:33,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {9650#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {9642#false} is VALID [2018-11-23 13:05:33,784 INFO L273 TraceCheckUtils]: 50: Hoare triple {9642#false} assume !false; {9642#false} is VALID [2018-11-23 13:05:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 13:05:33,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:05:33,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 14 [2018-11-23 13:05:33,807 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-11-23 13:05:33,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:05:33,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:05:33,872 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:05:33,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:05:33,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:05:33,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:05:33,873 INFO L87 Difference]: Start difference. First operand 238 states and 306 transitions. Second operand 14 states. [2018-11-23 13:05:42,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:42,778 INFO L93 Difference]: Finished difference Result 701 states and 930 transitions. [2018-11-23 13:05:42,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 13:05:42,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 51 [2018-11-23 13:05:42,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 384 transitions. [2018-11-23 13:05:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:05:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 384 transitions. [2018-11-23 13:05:42,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 384 transitions. [2018-11-23 13:05:43,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 384 edges. 384 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:43,696 INFO L225 Difference]: With dead ends: 701 [2018-11-23 13:05:43,696 INFO L226 Difference]: Without dead ends: 695 [2018-11-23 13:05:43,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 13:05:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-23 13:05:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 310. [2018-11-23 13:05:46,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:46,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 695 states. Second operand 310 states. [2018-11-23 13:05:46,108 INFO L74 IsIncluded]: Start isIncluded. First operand 695 states. Second operand 310 states. [2018-11-23 13:05:46,108 INFO L87 Difference]: Start difference. First operand 695 states. Second operand 310 states. [2018-11-23 13:05:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:46,130 INFO L93 Difference]: Finished difference Result 695 states and 923 transitions. [2018-11-23 13:05:46,130 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 923 transitions. [2018-11-23 13:05:46,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:46,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:46,132 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand 695 states. [2018-11-23 13:05:46,132 INFO L87 Difference]: Start difference. First operand 310 states. Second operand 695 states. [2018-11-23 13:05:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:46,152 INFO L93 Difference]: Finished difference Result 695 states and 923 transitions. [2018-11-23 13:05:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 923 transitions. [2018-11-23 13:05:46,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:46,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:46,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:46,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-23 13:05:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 401 transitions. [2018-11-23 13:05:46,161 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 401 transitions. Word has length 51 [2018-11-23 13:05:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:46,162 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 401 transitions. [2018-11-23 13:05:46,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:05:46,162 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 401 transitions. [2018-11-23 13:05:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:05:46,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:46,163 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:46,163 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:46,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:46,164 INFO L82 PathProgramCache]: Analyzing trace with hash -450062736, now seen corresponding path program 1 times [2018-11-23 13:05:46,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:46,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:46,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:46,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:46,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:47,722 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 37 [2018-11-23 13:05:48,508 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 64 [2018-11-23 13:05:48,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {12668#true} call ULTIMATE.init(); {12668#true} is VALID [2018-11-23 13:05:48,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {12668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12668#true} is VALID [2018-11-23 13:05:48,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {12668#true} assume true; {12668#true} is VALID [2018-11-23 13:05:48,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12668#true} {12668#true} #116#return; {12668#true} is VALID [2018-11-23 13:05:48,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {12668#true} call #t~ret17 := main(); {12668#true} is VALID [2018-11-23 13:05:48,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {12668#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,721 INFO L273 TraceCheckUtils]: 10: Hoare triple {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,722 INFO L273 TraceCheckUtils]: 11: Hoare triple {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,725 INFO L273 TraceCheckUtils]: 13: Hoare triple {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {12670#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (not (= |main_~#vogal_array~0.base| |main_~#input_string~0.base|)) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !(~i~0 % 4294967296 < 5); {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,728 INFO L273 TraceCheckUtils]: 17: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,730 INFO L273 TraceCheckUtils]: 19: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,733 INFO L273 TraceCheckUtils]: 22: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !(0 != #t~mem4);havoc #t~mem4; {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,733 INFO L273 TraceCheckUtils]: 23: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} ~cont~0 := 0;~i~0 := 0; {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,734 INFO L273 TraceCheckUtils]: 24: Hoare triple {12671#(and (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {12672#(and (= main_~j~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 (* (- 4294967296) (div main_~j~0 4294967296)) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,737 INFO L273 TraceCheckUtils]: 25: Hoare triple {12672#(and (= main_~j~0 0) (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 (* (- 4294967296) (div main_~j~0 4294967296)) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {12673#(and (or (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset|)) |main_#t~mem8|) (<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647))) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset| (- 4294967296))) |main_#t~mem8|) (< (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647) main_~i~0))) (not (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (= main_~j~0 0) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {12673#(and (or (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset|)) |main_#t~mem8|) (<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647))) (and (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset| (- 4294967296))) |main_#t~mem8|) (< (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647) main_~i~0))) (not (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)))) (= main_~j~0 0) (<= 0 |main_~#vogal_array~0.offset|) (<= |main_~#vogal_array~0.offset| 0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {12674#(and (= main_~j~0 0) (or (<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))) (<= 0 |main_~#vogal_array~0.offset|) (or (< (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647) main_~i~0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))) (<= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:05:48,742 INFO L273 TraceCheckUtils]: 27: Hoare triple {12674#(and (= main_~j~0 0) (or (<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647)) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset| (- 4294967296))) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))) (<= 0 |main_~#vogal_array~0.offset|) (or (< (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647) main_~i~0) (not (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))))) (<= |main_~#vogal_array~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12675#(and (<= (div main_~j~0 4294967296) 0) (or (and (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 4294967297)) (< (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647) main_~j~0)) (<= |main_~#vogal_array~0.offset| 0)) (or (and (not (= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 4294967297))) (or (not (= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1))) (< (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647) main_~j~0))) (and (= 0 |main_~#vogal_array~0.offset|) (or (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 (* (- 4294967296) (div main_~j~0 4294967296)) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset| (- 4294967296))))) (<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647))) (or (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 (* (- 4294967296) (div main_~j~0 4294967296)) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset|)))) (< (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647) main_~i~0)))) (or (<= 1 (+ main_~j~0 |main_~#vogal_array~0.offset|)) (and (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|)) (<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647)))))} is VALID [2018-11-23 13:05:48,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {12675#(and (<= (div main_~j~0 4294967296) 0) (or (and (<= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 4294967297)) (< (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647) main_~j~0)) (<= |main_~#vogal_array~0.offset| 0)) (or (and (not (= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 4294967297))) (or (not (= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1))) (< (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647) main_~j~0))) (and (= 0 |main_~#vogal_array~0.offset|) (or (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 (* (- 4294967296) (div main_~j~0 4294967296)) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset| (- 4294967296))))) (<= main_~i~0 (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647))) (or (not (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ main_~j~0 (* (- 4294967296) (div main_~j~0 4294967296)) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ main_~i~0 (* (- 4294967296) (div main_~i~0 4294967296)) |main_~#input_string~0.offset|)))) (< (+ (* 4294967296 (div main_~i~0 4294967296)) 2147483647) main_~i~0)))) (or (<= 1 (+ main_~j~0 |main_~#vogal_array~0.offset|)) (and (< (* 4294967296 (div main_~j~0 4294967296)) (+ main_~j~0 |main_~#vogal_array~0.offset|)) (<= main_~j~0 (+ (* 4294967296 (div main_~j~0 4294967296)) 2147483647)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {12676#(and (<= (div main_~j~0 4294967296) 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1)) (= 0 |main_~#vogal_array~0.offset|) (not (= |main_#t~mem8| |main_#t~mem9|)))} is VALID [2018-11-23 13:05:48,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {12676#(and (<= (div main_~j~0 4294967296) 0) (= (+ main_~j~0 |main_~#vogal_array~0.offset|) (+ (* 4294967296 (div main_~j~0 4294967296)) 1)) (= 0 |main_~#vogal_array~0.offset|) (not (= |main_#t~mem8| |main_#t~mem9|)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {12669#false} is VALID [2018-11-23 13:05:48,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {12669#false} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12669#false} is VALID [2018-11-23 13:05:48,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {12669#false} assume !(~j~0 % 4294967296 < 2); {12669#false} is VALID [2018-11-23 13:05:48,747 INFO L273 TraceCheckUtils]: 32: Hoare triple {12669#false} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12669#false} is VALID [2018-11-23 13:05:48,747 INFO L273 TraceCheckUtils]: 33: Hoare triple {12669#false} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {12669#false} is VALID [2018-11-23 13:05:48,747 INFO L273 TraceCheckUtils]: 34: Hoare triple {12669#false} ~i~0 := 0;~cont_aux~0 := 0; {12669#false} is VALID [2018-11-23 13:05:48,747 INFO L273 TraceCheckUtils]: 35: Hoare triple {12669#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12669#false} is VALID [2018-11-23 13:05:48,748 INFO L273 TraceCheckUtils]: 36: Hoare triple {12669#false} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {12669#false} is VALID [2018-11-23 13:05:48,748 INFO L273 TraceCheckUtils]: 37: Hoare triple {12669#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {12669#false} is VALID [2018-11-23 13:05:48,748 INFO L273 TraceCheckUtils]: 38: Hoare triple {12669#false} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {12669#false} is VALID [2018-11-23 13:05:48,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {12669#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {12669#false} is VALID [2018-11-23 13:05:48,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {12669#false} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {12669#false} is VALID [2018-11-23 13:05:48,749 INFO L273 TraceCheckUtils]: 41: Hoare triple {12669#false} assume !(#t~mem13 == #t~mem14);havoc #t~mem14;havoc #t~mem13; {12669#false} is VALID [2018-11-23 13:05:48,749 INFO L273 TraceCheckUtils]: 42: Hoare triple {12669#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {12669#false} is VALID [2018-11-23 13:05:48,749 INFO L273 TraceCheckUtils]: 43: Hoare triple {12669#false} assume !(~j~0 % 4294967296 < 2); {12669#false} is VALID [2018-11-23 13:05:48,749 INFO L273 TraceCheckUtils]: 44: Hoare triple {12669#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {12669#false} is VALID [2018-11-23 13:05:48,750 INFO L273 TraceCheckUtils]: 45: Hoare triple {12669#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12669#false} is VALID [2018-11-23 13:05:48,750 INFO L273 TraceCheckUtils]: 46: Hoare triple {12669#false} assume !(0 != #t~mem11);havoc #t~mem11; {12669#false} is VALID [2018-11-23 13:05:48,750 INFO L256 TraceCheckUtils]: 47: Hoare triple {12669#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {12669#false} is VALID [2018-11-23 13:05:48,750 INFO L273 TraceCheckUtils]: 48: Hoare triple {12669#false} ~cond := #in~cond; {12669#false} is VALID [2018-11-23 13:05:48,750 INFO L273 TraceCheckUtils]: 49: Hoare triple {12669#false} assume 0 == ~cond; {12669#false} is VALID [2018-11-23 13:05:48,751 INFO L273 TraceCheckUtils]: 50: Hoare triple {12669#false} assume !false; {12669#false} is VALID [2018-11-23 13:05:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 13:05:48,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:05:48,758 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:05:48,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:05:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:48,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:00,657 WARN L180 SmtUtils]: Spent 10.72 s on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2018-11-23 13:06:10,045 WARN L180 SmtUtils]: Spent 9.22 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2018-11-23 13:06:10,273 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 13:06:10,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 70 [2018-11-23 13:06:10,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2018-11-23 13:06:10,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,385 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 52 treesize of output 18 [2018-11-23 13:06:10,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 14 [2018-11-23 13:06:10,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 66 [2018-11-23 13:06:10,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2018-11-23 13:06:10,518 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,564 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 48 treesize of output 18 [2018-11-23 13:06:10,568 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 14 [2018-11-23 13:06:10,614 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,629 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:10,651 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 18 variables, input treesize:241, output treesize:3 [2018-11-23 13:06:10,656 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:06:10,656 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_14, v_prenex_13, v_prenex_15, v_prenex_17, v_prenex_16, v_prenex_12, v_prenex_11, v_prenex_9, v_prenex_7, v_prenex_10, v_prenex_8, v_prenex_4, |#memory_int|, |main_~#input_string~0.base|, main_~i~0, |main_~#input_string~0.offset|, |main_~#vogal_array~0.base|, v_prenex_2]. (or (let ((.cse4 (select v_prenex_14 v_prenex_13)) (.cse5 (mod v_prenex_15 4294967296)) (.cse6 (select v_prenex_14 v_prenex_16))) (let ((.cse0 (select .cse6 1)) (.cse2 (mod v_prenex_12 4294967296)) (.cse1 (select .cse4 (+ .cse5 v_prenex_17 (- 4294967296)))) (.cse3 (select .cse6 0))) (and (= |main_#t~mem14| .cse0) (= .cse0 .cse1) (< 2147483647 .cse2) (= .cse3 (select .cse4 (+ .cse2 v_prenex_17 (- 4294967296)))) (= |main_#t~mem13| (select .cse4 (+ .cse2 v_prenex_17))) (< 2147483647 .cse5) (<= .cse2 2147483647) (= .cse1 .cse3)))) (let ((.cse7 (mod v_prenex_4 4294967296)) (.cse14 (select v_prenex_11 v_prenex_9)) (.cse8 (mod v_prenex_7 4294967296)) (.cse13 (select v_prenex_11 v_prenex_8))) (let ((.cse11 (select .cse13 1)) (.cse10 (select .cse14 (+ .cse8 v_prenex_10 (- 4294967296)))) (.cse12 (select .cse14 (+ .cse7 v_prenex_10 (- 4294967296)))) (.cse9 (select .cse13 0))) (and (< 2147483647 .cse7) (not (<= .cse8 2147483647)) (< 2147483647 .cse8) (= .cse9 .cse10) (= .cse11 .cse12) (= |main_#t~mem14| .cse11) (= |main_#t~mem13| .cse10) (= .cse12 .cse9)))) (let ((.cse20 (mod v_prenex_2 4294967296)) (.cse21 (select |#memory_int| |main_~#input_string~0.base|)) (.cse19 (mod main_~i~0 4294967296)) (.cse22 (select |#memory_int| |main_~#vogal_array~0.base|))) (let ((.cse18 (select .cse22 0)) (.cse15 (select .cse21 (+ .cse19 |main_~#input_string~0.offset|))) (.cse16 (select .cse22 1)) (.cse17 (select .cse21 (+ .cse20 |main_~#input_string~0.offset|)))) (and (= |main_#t~mem13| .cse15) (= |main_#t~mem14| .cse16) (= .cse17 .cse18) (= .cse18 .cse15) (= .cse16 .cse17) (<= .cse19 2147483647) (<= .cse20 2147483647))))) [2018-11-23 13:06:10,656 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem14| |main_#t~mem13|) [2018-11-23 13:06:10,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {12668#true} call ULTIMATE.init(); {12668#true} is VALID [2018-11-23 13:06:10,685 INFO L273 TraceCheckUtils]: 1: Hoare triple {12668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12668#true} is VALID [2018-11-23 13:06:10,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {12668#true} assume true; {12668#true} is VALID [2018-11-23 13:06:10,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12668#true} {12668#true} #116#return; {12668#true} is VALID [2018-11-23 13:06:10,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {12668#true} call #t~ret17 := main(); {12668#true} is VALID [2018-11-23 13:06:10,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {12668#true} call ~#input_string~0.base, ~#input_string~0.offset := #Ultimate.alloc(5);call ~#vogal_array~0.base, ~#vogal_array~0.offset := #Ultimate.alloc(11);call write~init~int(97, ~#vogal_array~0.base, ~#vogal_array~0.offset, 1);call write~init~int(65, ~#vogal_array~0.base, 1 + ~#vogal_array~0.offset, 1);call write~init~int(101, ~#vogal_array~0.base, 2 + ~#vogal_array~0.offset, 1);call write~init~int(69, ~#vogal_array~0.base, 3 + ~#vogal_array~0.offset, 1);call write~init~int(105, ~#vogal_array~0.base, 4 + ~#vogal_array~0.offset, 1);call write~init~int(73, ~#vogal_array~0.base, 5 + ~#vogal_array~0.offset, 1);call write~init~int(111, ~#vogal_array~0.base, 6 + ~#vogal_array~0.offset, 1);call write~init~int(79, ~#vogal_array~0.base, 7 + ~#vogal_array~0.offset, 1);call write~init~int(117, ~#vogal_array~0.base, 8 + ~#vogal_array~0.offset, 1);call write~init~int(85, ~#vogal_array~0.base, 9 + ~#vogal_array~0.offset, 1);call write~init~int(0, ~#vogal_array~0.base, 10 + ~#vogal_array~0.offset, 1);havoc ~i~0;havoc ~j~0;havoc ~cont~0;havoc ~tam_string~0;havoc ~n_caracter~0;~i~0 := 0; {12695#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:06:10,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {12695#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12695#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 13:06:10,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {12695#(and (= |main_~#vogal_array~0.offset| 0) (= main_~i~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,714 INFO L273 TraceCheckUtils]: 11: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,728 INFO L273 TraceCheckUtils]: 12: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,736 INFO L273 TraceCheckUtils]: 13: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} assume !!(~i~0 % 4294967296 < 5);assume -128 <= #t~nondet2 && #t~nondet2 <= 127;call write~int(#t~nondet2, ~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);havoc #t~nondet2; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} assume !(~i~0 % 4294967296 < 5); {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} call #t~mem3 := read~int(~#input_string~0.base, 4 + ~#input_string~0.offset, 1); {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} assume !!(0 == #t~mem3);havoc #t~mem3;~n_caracter~0 := 0; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,762 INFO L273 TraceCheckUtils]: 20: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} assume !!(0 != #t~mem4);havoc #t~mem4;#t~post5 := ~n_caracter~0;~n_caracter~0 := 1 + #t~post5;havoc #t~post5; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,762 INFO L273 TraceCheckUtils]: 21: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} call #t~mem4 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~n_caracter~0 % 4294967296 % 4294967296 <= 2147483647 then ~n_caracter~0 % 4294967296 % 4294967296 else ~n_caracter~0 % 4294967296 % 4294967296 - 4294967296), 1); {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,763 INFO L273 TraceCheckUtils]: 22: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} assume !(0 != #t~mem4);havoc #t~mem4; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} ~cont~0 := 0;~i~0 := 0; {12702#(= |main_~#vogal_array~0.offset| 0)} is VALID [2018-11-23 13:06:10,763 INFO L273 TraceCheckUtils]: 24: Hoare triple {12702#(= |main_~#vogal_array~0.offset| 0)} assume !!(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296);~j~0 := 0; {12754#(and (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:06:10,766 INFO L273 TraceCheckUtils]: 25: Hoare triple {12754#(and (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {12758#(and (or (and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296))) (and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) |main_#t~mem9|) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:06:10,767 INFO L273 TraceCheckUtils]: 26: Hoare triple {12758#(and (or (and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296))) (and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) |main_#t~mem9|) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {12762#(and (= main_~j~0 0) (or (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296))) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647))) (= |main_~#vogal_array~0.offset| 0))} is VALID [2018-11-23 13:06:10,769 INFO L273 TraceCheckUtils]: 27: Hoare triple {12762#(and (= main_~j~0 0) (or (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296))) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647))) (= |main_~#vogal_array~0.offset| 0))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12766#(and (or (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 1))} is VALID [2018-11-23 13:06:10,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {12766#(and (or (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 1))} assume !!(~j~0 % 4294967296 < 2);call #t~mem8 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem9 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {12770#(or (and (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (<= (mod v_prenex_2 4294967296) 2147483647))) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (= |main_~#vogal_array~0.offset| 0)) (and (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (exists ((main_~i~0 Int)) (and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} is VALID [2018-11-23 13:06:10,775 INFO L273 TraceCheckUtils]: 29: Hoare triple {12770#(or (and (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (<= (mod v_prenex_2 4294967296) 2147483647))) (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (= |main_~#vogal_array~0.offset| 0)) (and (= |main_#t~mem9| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (exists ((main_~i~0 Int)) (and (= |main_#t~mem8| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} assume #t~mem8 == #t~mem9;havoc #t~mem8;havoc #t~mem9;#t~post10 := ~cont~0;~cont~0 := 1 + #t~post10;havoc #t~post10; {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} is VALID [2018-11-23 13:06:10,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} #t~post7 := ~j~0;~j~0 := 1 + #t~post7;havoc #t~post7; {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} is VALID [2018-11-23 13:06:10,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} assume !(~j~0 % 4294967296 < 2); {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} is VALID [2018-11-23 13:06:10,777 INFO L273 TraceCheckUtils]: 32: Hoare triple {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} #t~post6 := ~i~0;~i~0 := 1 + #t~post6;havoc #t~post6; {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} is VALID [2018-11-23 13:06:10,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} assume !(~i~0 % 4294967296 < ~n_caracter~0 % 4294967296); {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} is VALID [2018-11-23 13:06:10,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} ~i~0 := 0;~cont_aux~0 := 0; {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} is VALID [2018-11-23 13:06:10,778 INFO L273 TraceCheckUtils]: 35: Hoare triple {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} is VALID [2018-11-23 13:06:10,781 INFO L273 TraceCheckUtils]: 36: Hoare triple {12774#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))) (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= |main_~#vogal_array~0.offset| 0)))} assume !!(0 != #t~mem11);havoc #t~mem11;~j~0 := 0; {12796#(or (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0)) (and (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))))} is VALID [2018-11-23 13:06:10,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {12796#(or (and (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (< 2147483647 (mod main_~i~0 4294967296)))) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0)) (and (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647)))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {12800#(or (and (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 4294967296)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) (= main_~j~0 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (< 2147483647 (mod main_~i~0 4294967296))) (and (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= main_~j~0 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647))) (< 2147483647 (mod main_~i~0 4294967296))) (and (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 4294967296)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) (= main_~j~0 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (<= (mod main_~i~0 4294967296) 2147483647)) (and (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (= main_~j~0 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647))) (<= (mod main_~i~0 4294967296) 2147483647)))} is VALID [2018-11-23 13:06:12,904 INFO L273 TraceCheckUtils]: 38: Hoare triple {12800#(or (and (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 4294967296)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) (= main_~j~0 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (< 2147483647 (mod main_~i~0 4294967296))) (and (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= main_~j~0 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647))) (< 2147483647 (mod main_~i~0 4294967296))) (and (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 4294967296)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) (= main_~j~0 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (<= (mod main_~i~0 4294967296) 2147483647)) (and (= |main_#t~mem13| (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (= main_~j~0 0) (= |main_#t~mem14| (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|))) (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647))) (<= (mod main_~i~0 4294967296) 2147483647)))} assume #t~mem13 == #t~mem14;havoc #t~mem14;havoc #t~mem13;#t~post15 := ~cont_aux~0;~cont_aux~0 := 1 + #t~post15;havoc #t~post15; {12804#(or (and (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 4294967296)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0) (< 2147483647 (mod main_~i~0 4294967296))) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647))) (<= (mod main_~i~0 4294967296) 2147483647)))} is UNKNOWN [2018-11-23 13:06:12,924 INFO L273 TraceCheckUtils]: 39: Hoare triple {12804#(or (and (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 4294967296)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0) (< 2147483647 (mod main_~i~0 4294967296))) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod main_~j~0 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (= main_~j~0 0) (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647))) (<= (mod main_~i~0 4294967296) 2147483647)))} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {12808#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647))) (= main_~j~0 1) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod (+ main_~j~0 4294967295) 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 4294967296)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod (+ main_~j~0 4294967295) 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 1) (< 2147483647 (mod main_~i~0 4294967296))))} is VALID [2018-11-23 13:06:12,940 INFO L273 TraceCheckUtils]: 40: Hoare triple {12808#(or (and (= |main_~#vogal_array~0.offset| 0) (exists ((v_prenex_2 Int)) (and (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|))) (= (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_2 4294967296) |main_~#input_string~0.offset|)) (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1))) (<= (mod v_prenex_2 4294967296) 2147483647))) (= main_~j~0 1) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod (+ main_~j~0 4294967295) 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset|))) (<= (mod main_~i~0 4294967296) 2147483647)) (and (exists ((v_prenex_4 Int)) (and (< 2147483647 (mod v_prenex_4 4294967296)) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ |main_~#vogal_array~0.offset| 1)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) |main_~#vogal_array~0.offset|) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod v_prenex_4 4294967296) |main_~#input_string~0.offset| (- 4294967296)))))) (= (select (select |#memory_int| |main_~#vogal_array~0.base|) (+ (mod (+ main_~j~0 4294967295) 4294967296) |main_~#vogal_array~0.offset|)) (select (select |#memory_int| |main_~#input_string~0.base|) (+ (mod main_~i~0 4294967296) |main_~#input_string~0.offset| (- 4294967296)))) (= |main_~#vogal_array~0.offset| 0) (= main_~j~0 1) (< 2147483647 (mod main_~i~0 4294967296))))} assume !!(~j~0 % 4294967296 < 2);call #t~mem13 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1);call #t~mem14 := read~int(~#vogal_array~0.base, ~#vogal_array~0.offset + (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 1); {12812#(= |main_#t~mem14| |main_#t~mem13|)} is VALID [2018-11-23 13:06:12,940 INFO L273 TraceCheckUtils]: 41: Hoare triple {12812#(= |main_#t~mem14| |main_#t~mem13|)} assume !(#t~mem13 == #t~mem14);havoc #t~mem14;havoc #t~mem13; {12669#false} is VALID [2018-11-23 13:06:12,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {12669#false} #t~post12 := ~j~0;~j~0 := 1 + #t~post12;havoc #t~post12; {12669#false} is VALID [2018-11-23 13:06:12,941 INFO L273 TraceCheckUtils]: 43: Hoare triple {12669#false} assume !(~j~0 % 4294967296 < 2); {12669#false} is VALID [2018-11-23 13:06:12,941 INFO L273 TraceCheckUtils]: 44: Hoare triple {12669#false} #t~post16 := ~i~0;~i~0 := 1 + #t~post16;havoc #t~post16; {12669#false} is VALID [2018-11-23 13:06:12,941 INFO L273 TraceCheckUtils]: 45: Hoare triple {12669#false} call #t~mem11 := read~int(~#input_string~0.base, ~#input_string~0.offset + (if ~i~0 % 4294967296 % 4294967296 <= 2147483647 then ~i~0 % 4294967296 % 4294967296 else ~i~0 % 4294967296 % 4294967296 - 4294967296), 1); {12669#false} is VALID [2018-11-23 13:06:12,941 INFO L273 TraceCheckUtils]: 46: Hoare triple {12669#false} assume !(0 != #t~mem11);havoc #t~mem11; {12669#false} is VALID [2018-11-23 13:06:12,941 INFO L256 TraceCheckUtils]: 47: Hoare triple {12669#false} call __VERIFIER_assert((if ~cont_aux~0 % 4294967296 == ~cont~0 % 4294967296 then 1 else 0)); {12669#false} is VALID [2018-11-23 13:06:12,941 INFO L273 TraceCheckUtils]: 48: Hoare triple {12669#false} ~cond := #in~cond; {12669#false} is VALID [2018-11-23 13:06:12,942 INFO L273 TraceCheckUtils]: 49: Hoare triple {12669#false} assume 0 == ~cond; {12669#false} is VALID [2018-11-23 13:06:12,942 INFO L273 TraceCheckUtils]: 50: Hoare triple {12669#false} assume !false; {12669#false} is VALID [2018-11-23 13:06:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:06:12,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:12,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 22 [2018-11-23 13:06:12,986 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 13:06:12,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:06:12,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 13:06:15,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 70 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:15,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 13:06:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:06:15,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:06:15,287 INFO L87 Difference]: Start difference. First operand 310 states and 401 transitions. Second operand 22 states. [2018-11-23 13:06:16,799 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 42 [2018-11-23 13:06:18,987 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2018-11-23 13:06:40,693 WARN L180 SmtUtils]: Spent 21.35 s on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2018-11-23 13:06:41,288 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-11-23 13:06:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:42,834 INFO L93 Difference]: Finished difference Result 599 states and 788 transitions. [2018-11-23 13:06:42,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 13:06:42,834 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-23 13:06:42,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:06:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:06:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 116 transitions. [2018-11-23 13:06:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 13:06:42,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 116 transitions. [2018-11-23 13:06:42,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 116 transitions. [2018-11-23 13:06:43,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:06:43,050 INFO L225 Difference]: With dead ends: 599 [2018-11-23 13:06:43,050 INFO L226 Difference]: Without dead ends: 441 [2018-11-23 13:06:43,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=232, Invalid=1100, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 13:06:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-11-23 13:06:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 354. [2018-11-23 13:06:45,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:06:45,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 441 states. Second operand 354 states. [2018-11-23 13:06:45,968 INFO L74 IsIncluded]: Start isIncluded. First operand 441 states. Second operand 354 states. [2018-11-23 13:06:45,968 INFO L87 Difference]: Start difference. First operand 441 states. Second operand 354 states. [2018-11-23 13:06:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:45,978 INFO L93 Difference]: Finished difference Result 441 states and 566 transitions. [2018-11-23 13:06:45,978 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 566 transitions. [2018-11-23 13:06:45,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:45,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:45,979 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand 441 states. [2018-11-23 13:06:45,979 INFO L87 Difference]: Start difference. First operand 354 states. Second operand 441 states. [2018-11-23 13:06:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:45,991 INFO L93 Difference]: Finished difference Result 441 states and 566 transitions. [2018-11-23 13:06:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 566 transitions. [2018-11-23 13:06:45,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:06:45,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:06:45,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:06:45,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:06:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-11-23 13:06:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 453 transitions. [2018-11-23 13:06:46,002 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 453 transitions. Word has length 51 [2018-11-23 13:06:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:06:46,002 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 453 transitions. [2018-11-23 13:06:46,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 13:06:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 453 transitions. [2018-11-23 13:06:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:06:46,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:06:46,003 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:46,004 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:06:46,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:46,004 INFO L82 PathProgramCache]: Analyzing trace with hash 161818992, now seen corresponding path program 1 times [2018-11-23 13:06:46,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:46,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:46,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:46,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:46,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:47,254 WARN L180 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 21 [2018-11-23 13:06:47,626 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 39 [2018-11-23 13:06:48,336 WARN L180 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 43 [2018-11-23 13:06:49,580 WARN L180 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 41 [2018-11-23 13:06:52,938 WARN L180 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2018-11-23 13:06:52,952 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: must not be argument of unary minus + at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:06:52,956 INFO L168 Benchmark]: Toolchain (without parser) took 125729.09 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -268.2 MB). Peak memory consumption was 956.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:52,957 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:06:52,958 INFO L168 Benchmark]: CACSL2BoogieTranslator took 442.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:52,958 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:06:52,959 INFO L168 Benchmark]: Boogie Preprocessor took 73.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:06:52,959 INFO L168 Benchmark]: RCFGBuilder took 1205.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:52,960 INFO L168 Benchmark]: TraceAbstraction took 123971.64 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 488.1 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 492.7 MB). Peak memory consumption was 980.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:06:52,963 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 442.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1205.73 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -771.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 123971.64 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 488.1 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 492.7 MB). Peak memory consumption was 980.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: must not be argument of unary minus + de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: must not be argument of unary minus +: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:115) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...