java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:32:27,971 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:32:27,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:32:27,994 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:32:27,996 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:32:27,997 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:32:27,999 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:32:28,001 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:32:28,004 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:32:28,005 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:32:28,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:32:28,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:32:28,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:32:28,009 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:32:28,017 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:32:28,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:32:28,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:32:28,024 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:32:28,029 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:32:28,032 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:32:28,033 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:32:28,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:32:28,038 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:32:28,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:32:28,039 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:32:28,040 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:32:28,041 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:32:28,041 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:32:28,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:32:28,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:32:28,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:32:28,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:32:28,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:32:28,045 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:32:28,046 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:32:28,046 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:32:28,047 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:32:28,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:32:28,065 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:32:28,065 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:32:28,068 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:32:28,068 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:32:28,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:32:28,069 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:32:28,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:32:28,069 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:32:28,070 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:32:28,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:32:28,070 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:32:28,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:32:28,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:32:28,070 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:32:28,071 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:32:28,071 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:32:28,071 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:32:28,071 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:32:28,071 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:32:28,072 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:32:28,072 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:32:28,072 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:32:28,072 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:32:28,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:32:28,072 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:32:28,073 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:32:28,073 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:32:28,073 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:32:28,073 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:32:28,073 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:32:28,074 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:32:28,074 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:32:28,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:32:28,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:32:28,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:32:28,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:32:28,139 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:32:28,142 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-23 11:32:28,199 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8180ab5/75337124343443ba8cb8a8c9e0978629/FLAG9a671a07d [2018-11-23 11:32:28,634 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:32:28,635 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-23 11:32:28,643 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8180ab5/75337124343443ba8cb8a8c9e0978629/FLAG9a671a07d [2018-11-23 11:32:28,982 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a8180ab5/75337124343443ba8cb8a8c9e0978629 [2018-11-23 11:32:28,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:32:28,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:32:28,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:28,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:32:28,998 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:32:29,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:28" (1/1) ... [2018-11-23 11:32:29,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64758b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29, skipping insertion in model container [2018-11-23 11:32:29,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:28" (1/1) ... [2018-11-23 11:32:29,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:32:29,048 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:32:29,321 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:29,327 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:32:29,377 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:29,399 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:32:29,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29 WrapperNode [2018-11-23 11:32:29,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:29,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:29,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:32:29,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:32:29,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2018-11-23 11:32:29,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2018-11-23 11:32:29,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:29,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:32:29,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:32:29,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:32:29,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2018-11-23 11:32:29,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2018-11-23 11:32:29,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2018-11-23 11:32:29,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2018-11-23 11:32:29,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2018-11-23 11:32:29,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2018-11-23 11:32:29,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (1/1) ... [2018-11-23 11:32:29,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:32:29,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:32:29,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:32:29,498 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:32:29,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (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 11:32:29,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:32:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:32:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:32:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:32:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:32:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:32:29,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:32:29,623 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:32:30,658 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:32:30,658 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:32:30,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:30 BoogieIcfgContainer [2018-11-23 11:32:30,659 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:32:30,660 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:32:30,660 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:32:30,664 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:32:30,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:28" (1/3) ... [2018-11-23 11:32:30,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a00974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:30, skipping insertion in model container [2018-11-23 11:32:30,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:29" (2/3) ... [2018-11-23 11:32:30,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12a00974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:30, skipping insertion in model container [2018-11-23 11:32:30,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:30" (3/3) ... [2018-11-23 11:32:30,667 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call_true-termination.i [2018-11-23 11:32:30,678 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:32:30,685 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:32:30,702 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:32:30,738 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:32:30,739 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:32:30,739 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:32:30,739 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:32:30,739 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:32:30,739 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:32:30,740 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:32:30,740 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:32:30,740 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:32:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-23 11:32:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:32:30,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:30,766 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:30,768 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:30,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1341651050, now seen corresponding path program 1 times [2018-11-23 11:32:30,778 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:30,778 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:30,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:30,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:31,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {54#true} is VALID [2018-11-23 11:32:31,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2018-11-23 11:32:31,347 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #130#return; {54#true} is VALID [2018-11-23 11:32:31,348 INFO L256 TraceCheckUtils]: 3: Hoare triple {54#true} call #t~ret12 := main(); {54#true} is VALID [2018-11-23 11:32:31,348 INFO L273 TraceCheckUtils]: 4: Hoare triple {54#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {54#true} is VALID [2018-11-23 11:32:31,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {54#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {74#(bvsle main_~urilen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:31,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {74#(bvsle main_~urilen~0 (_ bv1000000 32))} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {74#(bvsle main_~urilen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:31,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {74#(bvsle main_~urilen~0 (_ bv1000000 32))} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {81#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:31,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {81#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)))} assume ~bvsgt32(~urilen~0, 0bv32); {85#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:31,359 INFO L273 TraceCheckUtils]: 9: Hoare triple {85#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} assume ~bvsgt32(~tokenlen~0, 0bv32); {85#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:31,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {85#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} assume ~bvsge32(~scheme~0, 0bv32); {92#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:31,362 INFO L273 TraceCheckUtils]: 11: Hoare triple {92#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {96#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:31,399 INFO L256 TraceCheckUtils]: 12: Hoare triple {96#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {100#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:31,400 INFO L273 TraceCheckUtils]: 13: Hoare triple {100#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {104#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:31,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {104#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {55#false} is VALID [2018-11-23 11:32:31,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {55#false} assume !false; {55#false} is VALID [2018-11-23 11:32:31,410 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 11:32:31,411 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:31,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:31,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:32:31,423 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-23 11:32:31,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:31,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:32:31,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:31,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:32:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:32:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:32:31,578 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 9 states. [2018-11-23 11:32:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:35,323 INFO L93 Difference]: Finished difference Result 130 states and 245 transitions. [2018-11-23 11:32:35,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:32:35,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-23 11:32:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:32:35,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2018-11-23 11:32:35,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:32:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 245 transitions. [2018-11-23 11:32:35,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 245 transitions. [2018-11-23 11:32:36,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:36,200 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:32:36,201 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:32:36,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:32:36,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:32:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2018-11-23 11:32:36,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:36,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 59 states. [2018-11-23 11:32:36,315 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 59 states. [2018-11-23 11:32:36,315 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 59 states. [2018-11-23 11:32:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:36,326 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2018-11-23 11:32:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2018-11-23 11:32:36,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:36,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:36,331 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 73 states. [2018-11-23 11:32:36,331 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 73 states. [2018-11-23 11:32:36,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:36,340 INFO L93 Difference]: Finished difference Result 73 states and 109 transitions. [2018-11-23 11:32:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2018-11-23 11:32:36,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:36,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:36,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:36,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:32:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2018-11-23 11:32:36,353 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 16 [2018-11-23 11:32:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:36,353 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2018-11-23 11:32:36,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:32:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2018-11-23 11:32:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:32:36,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:36,355 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:36,356 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:36,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash 298554093, now seen corresponding path program 1 times [2018-11-23 11:32:36,357 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:36,357 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:36,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:36,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:36,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {550#true} is VALID [2018-11-23 11:32:36,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 11:32:36,583 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {550#true} {550#true} #130#return; {550#true} is VALID [2018-11-23 11:32:36,583 INFO L256 TraceCheckUtils]: 3: Hoare triple {550#true} call #t~ret12 := main(); {550#true} is VALID [2018-11-23 11:32:36,584 INFO L273 TraceCheckUtils]: 4: Hoare triple {550#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {550#true} is VALID [2018-11-23 11:32:36,584 INFO L273 TraceCheckUtils]: 5: Hoare triple {550#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {550#true} is VALID [2018-11-23 11:32:36,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {550#true} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {550#true} is VALID [2018-11-23 11:32:36,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {550#true} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {576#(bvsle main_~scheme~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:36,602 INFO L273 TraceCheckUtils]: 8: Hoare triple {576#(bvsle main_~scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~urilen~0, 0bv32); {576#(bvsle main_~scheme~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:36,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {576#(bvsle main_~scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~tokenlen~0, 0bv32); {576#(bvsle main_~scheme~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:36,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {576#(bvsle main_~scheme~0 (_ bv1000000 32))} assume ~bvsge32(~scheme~0, 0bv32); {586#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:36,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {586#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)))} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {590#(and (not (= (_ bv0 32) main_~cp~0)) (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~cp~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:36,609 INFO L256 TraceCheckUtils]: 12: Hoare triple {590#(and (not (= (_ bv0 32) main_~cp~0)) (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~cp~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {550#true} is VALID [2018-11-23 11:32:36,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {550#true} ~cond := #in~cond; {550#true} is VALID [2018-11-23 11:32:36,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {550#true} assume !(0bv32 == ~cond); {550#true} is VALID [2018-11-23 11:32:36,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 11:32:36,612 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {550#true} {590#(and (not (= (_ bv0 32) main_~cp~0)) (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~cp~0 (_ bv1000000 32)))} #134#return; {590#(and (not (= (_ bv0 32) main_~cp~0)) (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~cp~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:36,614 INFO L256 TraceCheckUtils]: 17: Hoare triple {590#(and (not (= (_ bv0 32) main_~cp~0)) (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~cp~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsub32(~cp~0, 1bv32)) then 1bv32 else 0bv32)); {609#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:36,614 INFO L273 TraceCheckUtils]: 18: Hoare triple {609#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {613#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:36,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {613#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {551#false} is VALID [2018-11-23 11:32:36,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {551#false} assume !false; {551#false} is VALID [2018-11-23 11:32:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:36,620 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:36,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:36,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:32:36,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:32:36,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:36,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:32:36,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:36,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:32:36,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:32:36,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:32:36,664 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand 7 states. [2018-11-23 11:32:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:37,887 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2018-11-23 11:32:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:32:37,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 11:32:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:32:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-23 11:32:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:32:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2018-11-23 11:32:37,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2018-11-23 11:32:38,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:38,077 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:32:38,078 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:32:38,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:32:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:32:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-23 11:32:38,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:38,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 72 states. [2018-11-23 11:32:38,228 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 72 states. [2018-11-23 11:32:38,228 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 72 states. [2018-11-23 11:32:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:38,236 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2018-11-23 11:32:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2018-11-23 11:32:38,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:38,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:38,239 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 74 states. [2018-11-23 11:32:38,239 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 74 states. [2018-11-23 11:32:38,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:38,246 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2018-11-23 11:32:38,246 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2018-11-23 11:32:38,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:38,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:38,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:38,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 11:32:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2018-11-23 11:32:38,254 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 21 [2018-11-23 11:32:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:38,255 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2018-11-23 11:32:38,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:32:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2018-11-23 11:32:38,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 11:32:38,257 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:38,257 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 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 11:32:38,258 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:38,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash 151068296, now seen corresponding path program 1 times [2018-11-23 11:32:38,259 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:38,259 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:38,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:38,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:38,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {997#true} call ULTIMATE.init(); {997#true} is VALID [2018-11-23 11:32:38,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {997#true} assume true; {997#true} is VALID [2018-11-23 11:32:38,468 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {997#true} {997#true} #130#return; {997#true} is VALID [2018-11-23 11:32:38,468 INFO L256 TraceCheckUtils]: 3: Hoare triple {997#true} call #t~ret12 := main(); {997#true} is VALID [2018-11-23 11:32:38,468 INFO L273 TraceCheckUtils]: 4: Hoare triple {997#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {997#true} is VALID [2018-11-23 11:32:38,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {997#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {997#true} is VALID [2018-11-23 11:32:38,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {997#true} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {997#true} is VALID [2018-11-23 11:32:38,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {997#true} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {997#true} is VALID [2018-11-23 11:32:38,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {997#true} assume ~bvsgt32(~urilen~0, 0bv32); {997#true} is VALID [2018-11-23 11:32:38,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {997#true} assume ~bvsgt32(~tokenlen~0, 0bv32); {997#true} is VALID [2018-11-23 11:32:38,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {997#true} assume ~bvsge32(~scheme~0, 0bv32); {997#true} is VALID [2018-11-23 11:32:38,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {997#true} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {997#true} is VALID [2018-11-23 11:32:38,471 INFO L256 TraceCheckUtils]: 12: Hoare triple {997#true} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {997#true} is VALID [2018-11-23 11:32:38,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2018-11-23 11:32:38,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {997#true} assume !(0bv32 == ~cond); {997#true} is VALID [2018-11-23 11:32:38,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {997#true} assume true; {997#true} is VALID [2018-11-23 11:32:38,473 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {997#true} {997#true} #134#return; {997#true} is VALID [2018-11-23 11:32:38,473 INFO L256 TraceCheckUtils]: 17: Hoare triple {997#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsub32(~cp~0, 1bv32)) then 1bv32 else 0bv32)); {997#true} is VALID [2018-11-23 11:32:38,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2018-11-23 11:32:38,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {997#true} assume !(0bv32 == ~cond); {997#true} is VALID [2018-11-23 11:32:38,474 INFO L273 TraceCheckUtils]: 20: Hoare triple {997#true} assume true; {997#true} is VALID [2018-11-23 11:32:38,475 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {997#true} {997#true} #136#return; {997#true} is VALID [2018-11-23 11:32:38,475 INFO L273 TraceCheckUtils]: 22: Hoare triple {997#true} assume 0bv32 != #t~nondet4;havoc #t~nondet4; {997#true} is VALID [2018-11-23 11:32:38,475 INFO L256 TraceCheckUtils]: 23: Hoare triple {997#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {997#true} is VALID [2018-11-23 11:32:38,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2018-11-23 11:32:38,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {997#true} assume !(0bv32 == ~cond); {997#true} is VALID [2018-11-23 11:32:38,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {997#true} assume true; {997#true} is VALID [2018-11-23 11:32:38,479 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {997#true} {997#true} #138#return; {997#true} is VALID [2018-11-23 11:32:38,480 INFO L256 TraceCheckUtils]: 28: Hoare triple {997#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {997#true} is VALID [2018-11-23 11:32:38,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2018-11-23 11:32:38,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {997#true} assume !(0bv32 == ~cond); {997#true} is VALID [2018-11-23 11:32:38,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {997#true} assume true; {997#true} is VALID [2018-11-23 11:32:38,481 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {997#true} {997#true} #140#return; {997#true} is VALID [2018-11-23 11:32:38,494 INFO L273 TraceCheckUtils]: 33: Hoare triple {997#true} assume !(~cp~0 != ~bvsub32(~urilen~0, 1bv32)); {1101#(= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} is VALID [2018-11-23 11:32:38,495 INFO L256 TraceCheckUtils]: 34: Hoare triple {1101#(= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {997#true} is VALID [2018-11-23 11:32:38,495 INFO L273 TraceCheckUtils]: 35: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2018-11-23 11:32:38,496 INFO L273 TraceCheckUtils]: 36: Hoare triple {997#true} assume !(0bv32 == ~cond); {997#true} is VALID [2018-11-23 11:32:38,496 INFO L273 TraceCheckUtils]: 37: Hoare triple {997#true} assume true; {997#true} is VALID [2018-11-23 11:32:38,498 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {997#true} {1101#(= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} #146#return; {1101#(= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} is VALID [2018-11-23 11:32:38,498 INFO L256 TraceCheckUtils]: 39: Hoare triple {1101#(= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {997#true} is VALID [2018-11-23 11:32:38,498 INFO L273 TraceCheckUtils]: 40: Hoare triple {997#true} ~cond := #in~cond; {997#true} is VALID [2018-11-23 11:32:38,499 INFO L273 TraceCheckUtils]: 41: Hoare triple {997#true} assume !(0bv32 == ~cond); {997#true} is VALID [2018-11-23 11:32:38,499 INFO L273 TraceCheckUtils]: 42: Hoare triple {997#true} assume true; {997#true} is VALID [2018-11-23 11:32:38,504 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {997#true} {1101#(= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} #148#return; {1101#(= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} is VALID [2018-11-23 11:32:38,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {1101#(= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} assume !(~cp~0 == ~bvsub32(~urilen~0, 1bv32)); {998#false} is VALID [2018-11-23 11:32:38,505 INFO L256 TraceCheckUtils]: 45: Hoare triple {998#false} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~cp~0), ~urilen~0) then 1bv32 else 0bv32)); {998#false} is VALID [2018-11-23 11:32:38,506 INFO L273 TraceCheckUtils]: 46: Hoare triple {998#false} ~cond := #in~cond; {998#false} is VALID [2018-11-23 11:32:38,506 INFO L273 TraceCheckUtils]: 47: Hoare triple {998#false} assume 0bv32 == ~cond; {998#false} is VALID [2018-11-23 11:32:38,506 INFO L273 TraceCheckUtils]: 48: Hoare triple {998#false} assume !false; {998#false} is VALID [2018-11-23 11:32:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 11:32:38,510 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:38,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:38,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:32:38,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-23 11:32:38,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:38,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:32:38,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:38,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:32:38,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:32:38,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:32:38,579 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand 3 states. [2018-11-23 11:32:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:38,912 INFO L93 Difference]: Finished difference Result 104 states and 143 transitions. [2018-11-23 11:32:38,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:32:38,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-23 11:32:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 11:32:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:32:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-23 11:32:38,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-23 11:32:39,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:39,134 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:32:39,135 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 11:32:39,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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 11:32:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 11:32:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 11:32:39,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:39,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-23 11:32:39,194 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 11:32:39,194 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 11:32:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:39,199 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 11:32:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 11:32:39,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:39,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:39,201 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 11:32:39,201 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 11:32:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:39,206 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2018-11-23 11:32:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 11:32:39,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:39,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:39,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:39,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 11:32:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2018-11-23 11:32:39,212 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 49 [2018-11-23 11:32:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:39,213 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2018-11-23 11:32:39,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:32:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2018-11-23 11:32:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:32:39,214 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:39,215 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 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 11:32:39,215 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:39,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:39,215 INFO L82 PathProgramCache]: Analyzing trace with hash 318469520, now seen corresponding path program 1 times [2018-11-23 11:32:39,216 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:39,216 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:39,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:39,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:40,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {1541#true} call ULTIMATE.init(); {1541#true} is VALID [2018-11-23 11:32:40,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:40,174 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1541#true} {1541#true} #130#return; {1541#true} is VALID [2018-11-23 11:32:40,174 INFO L256 TraceCheckUtils]: 3: Hoare triple {1541#true} call #t~ret12 := main(); {1541#true} is VALID [2018-11-23 11:32:40,175 INFO L273 TraceCheckUtils]: 4: Hoare triple {1541#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1541#true} is VALID [2018-11-23 11:32:40,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {1541#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {1561#(bvsle main_~urilen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:40,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {1561#(bvsle main_~urilen~0 (_ bv1000000 32))} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {1561#(bvsle main_~urilen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:40,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {1561#(bvsle main_~urilen~0 (_ bv1000000 32))} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {1568#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:40,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {1568#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)))} assume ~bvsgt32(~urilen~0, 0bv32); {1572#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {1572#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} assume ~bvsgt32(~tokenlen~0, 0bv32); {1572#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {1572#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} assume ~bvsge32(~scheme~0, 0bv32); {1579#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {1579#(and (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {1583#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,182 INFO L256 TraceCheckUtils]: 12: Hoare triple {1583#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:40,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {1541#true} ~cond := #in~cond; {1590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:32:40,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {1590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0bv32 == ~cond); {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:40,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:40,204 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {1583#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} #134#return; {1583#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,205 INFO L256 TraceCheckUtils]: 17: Hoare triple {1583#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsub32(~cp~0, 1bv32)) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:40,210 INFO L273 TraceCheckUtils]: 18: Hoare triple {1541#true} ~cond := #in~cond; {1590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:32:40,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {1590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0bv32 == ~cond); {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:40,211 INFO L273 TraceCheckUtils]: 20: Hoare triple {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:40,213 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {1583#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsgt main_~urilen~0 (_ bv0 32)))} #136#return; {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} assume 0bv32 != #t~nondet4;havoc #t~nondet4; {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,214 INFO L256 TraceCheckUtils]: 23: Hoare triple {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:40,214 INFO L273 TraceCheckUtils]: 24: Hoare triple {1541#true} ~cond := #in~cond; {1590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:32:40,215 INFO L273 TraceCheckUtils]: 25: Hoare triple {1590#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0bv32 == ~cond); {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:40,216 INFO L273 TraceCheckUtils]: 26: Hoare triple {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:40,216 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} #138#return; {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,217 INFO L256 TraceCheckUtils]: 28: Hoare triple {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:40,217 INFO L273 TraceCheckUtils]: 29: Hoare triple {1541#true} ~cond := #in~cond; {1541#true} is VALID [2018-11-23 11:32:40,217 INFO L273 TraceCheckUtils]: 30: Hoare triple {1541#true} assume !(0bv32 == ~cond); {1541#true} is VALID [2018-11-23 11:32:40,218 INFO L273 TraceCheckUtils]: 31: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:40,218 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1541#true} {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} #140#return; {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,236 INFO L273 TraceCheckUtils]: 33: Hoare triple {1616#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32)); {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5; {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,238 INFO L256 TraceCheckUtils]: 35: Hoare triple {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:40,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {1541#true} ~cond := #in~cond; {1541#true} is VALID [2018-11-23 11:32:40,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {1541#true} assume !(0bv32 == ~cond); {1541#true} is VALID [2018-11-23 11:32:40,239 INFO L273 TraceCheckUtils]: 38: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:40,248 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1541#true} {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} #146#return; {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,248 INFO L256 TraceCheckUtils]: 40: Hoare triple {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:40,249 INFO L273 TraceCheckUtils]: 41: Hoare triple {1541#true} ~cond := #in~cond; {1541#true} is VALID [2018-11-23 11:32:40,249 INFO L273 TraceCheckUtils]: 42: Hoare triple {1541#true} assume !(0bv32 == ~cond); {1541#true} is VALID [2018-11-23 11:32:40,249 INFO L273 TraceCheckUtils]: 43: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:40,255 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1541#true} {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} #148#return; {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,256 INFO L273 TraceCheckUtils]: 45: Hoare triple {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} assume !(~cp~0 == ~bvsub32(~urilen~0, 1bv32)); {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} is VALID [2018-11-23 11:32:40,301 INFO L256 TraceCheckUtils]: 46: Hoare triple {1653#(and (bvsge main_~cp~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~cp~0), ~urilen~0) then 1bv32 else 0bv32)); {1693#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:40,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {1693#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1697#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:40,302 INFO L273 TraceCheckUtils]: 48: Hoare triple {1697#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1542#false} is VALID [2018-11-23 11:32:40,302 INFO L273 TraceCheckUtils]: 49: Hoare triple {1542#false} assume !false; {1542#false} is VALID [2018-11-23 11:32:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 11:32:40,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:41,247 INFO L273 TraceCheckUtils]: 49: Hoare triple {1542#false} assume !false; {1542#false} is VALID [2018-11-23 11:32:41,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {1707#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1542#false} is VALID [2018-11-23 11:32:41,249 INFO L273 TraceCheckUtils]: 47: Hoare triple {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1707#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:41,250 INFO L256 TraceCheckUtils]: 46: Hoare triple {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~cp~0), ~urilen~0) then 1bv32 else 0bv32)); {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:41,251 INFO L273 TraceCheckUtils]: 45: Hoare triple {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} assume !(~cp~0 == ~bvsub32(~urilen~0, 1bv32)); {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} is VALID [2018-11-23 11:32:41,269 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {1541#true} {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} #148#return; {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} is VALID [2018-11-23 11:32:41,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:41,269 INFO L273 TraceCheckUtils]: 42: Hoare triple {1541#true} assume !(0bv32 == ~cond); {1541#true} is VALID [2018-11-23 11:32:41,270 INFO L273 TraceCheckUtils]: 41: Hoare triple {1541#true} ~cond := #in~cond; {1541#true} is VALID [2018-11-23 11:32:41,270 INFO L256 TraceCheckUtils]: 40: Hoare triple {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:41,284 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1541#true} {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} #146#return; {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} is VALID [2018-11-23 11:32:41,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:41,284 INFO L273 TraceCheckUtils]: 37: Hoare triple {1541#true} assume !(0bv32 == ~cond); {1541#true} is VALID [2018-11-23 11:32:41,285 INFO L273 TraceCheckUtils]: 36: Hoare triple {1541#true} ~cond := #in~cond; {1541#true} is VALID [2018-11-23 11:32:41,285 INFO L256 TraceCheckUtils]: 35: Hoare triple {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:41,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} assume 0bv32 != #t~nondet5;havoc #t~nondet5; {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} is VALID [2018-11-23 11:32:41,301 INFO L273 TraceCheckUtils]: 33: Hoare triple {1754#(or (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0) (bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32)); {1714#(bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)} is VALID [2018-11-23 11:32:41,303 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1541#true} {1754#(or (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0) (bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0))} #140#return; {1754#(or (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0) (bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0))} is VALID [2018-11-23 11:32:41,303 INFO L273 TraceCheckUtils]: 31: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:41,303 INFO L273 TraceCheckUtils]: 30: Hoare triple {1541#true} assume !(0bv32 == ~cond); {1541#true} is VALID [2018-11-23 11:32:41,304 INFO L273 TraceCheckUtils]: 29: Hoare triple {1541#true} ~cond := #in~cond; {1541#true} is VALID [2018-11-23 11:32:41,304 INFO L256 TraceCheckUtils]: 28: Hoare triple {1754#(or (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0) (bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:41,352 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {1541#true} #138#return; {1754#(or (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0) (bvslt (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0))} is VALID [2018-11-23 11:32:41,352 INFO L273 TraceCheckUtils]: 26: Hoare triple {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:41,353 INFO L273 TraceCheckUtils]: 25: Hoare triple {1782#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} assume !(0bv32 == ~cond); {1594#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:41,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {1541#true} ~cond := #in~cond; {1782#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} is VALID [2018-11-23 11:32:41,354 INFO L256 TraceCheckUtils]: 23: Hoare triple {1541#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:41,354 INFO L273 TraceCheckUtils]: 22: Hoare triple {1541#true} assume 0bv32 != #t~nondet4;havoc #t~nondet4; {1541#true} is VALID [2018-11-23 11:32:41,354 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1541#true} {1541#true} #136#return; {1541#true} is VALID [2018-11-23 11:32:41,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:41,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {1541#true} assume !(0bv32 == ~cond); {1541#true} is VALID [2018-11-23 11:32:41,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {1541#true} ~cond := #in~cond; {1541#true} is VALID [2018-11-23 11:32:41,355 INFO L256 TraceCheckUtils]: 17: Hoare triple {1541#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsub32(~cp~0, 1bv32)) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:41,355 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {1541#true} {1541#true} #134#return; {1541#true} is VALID [2018-11-23 11:32:41,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:41,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {1541#true} assume !(0bv32 == ~cond); {1541#true} is VALID [2018-11-23 11:32:41,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {1541#true} ~cond := #in~cond; {1541#true} is VALID [2018-11-23 11:32:41,355 INFO L256 TraceCheckUtils]: 12: Hoare triple {1541#true} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {1541#true} is VALID [2018-11-23 11:32:41,356 INFO L273 TraceCheckUtils]: 11: Hoare triple {1541#true} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {1541#true} is VALID [2018-11-23 11:32:41,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {1541#true} assume ~bvsge32(~scheme~0, 0bv32); {1541#true} is VALID [2018-11-23 11:32:41,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {1541#true} assume ~bvsgt32(~tokenlen~0, 0bv32); {1541#true} is VALID [2018-11-23 11:32:41,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {1541#true} assume ~bvsgt32(~urilen~0, 0bv32); {1541#true} is VALID [2018-11-23 11:32:41,358 INFO L273 TraceCheckUtils]: 7: Hoare triple {1541#true} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {1541#true} is VALID [2018-11-23 11:32:41,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {1541#true} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {1541#true} is VALID [2018-11-23 11:32:41,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {1541#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {1541#true} is VALID [2018-11-23 11:32:41,358 INFO L273 TraceCheckUtils]: 4: Hoare triple {1541#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1541#true} is VALID [2018-11-23 11:32:41,358 INFO L256 TraceCheckUtils]: 3: Hoare triple {1541#true} call #t~ret12 := main(); {1541#true} is VALID [2018-11-23 11:32:41,359 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1541#true} {1541#true} #130#return; {1541#true} is VALID [2018-11-23 11:32:41,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {1541#true} assume true; {1541#true} is VALID [2018-11-23 11:32:41,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {1541#true} call ULTIMATE.init(); {1541#true} is VALID [2018-11-23 11:32:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 11:32:41,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:41,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 17 [2018-11-23 11:32:41,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-11-23 11:32:41,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:41,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:32:41,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:41,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:32:41,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:32:41,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:32:41,616 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand 17 states. [2018-11-23 11:32:47,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:47,804 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2018-11-23 11:32:47,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:32:47,804 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-11-23 11:32:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:32:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2018-11-23 11:32:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:32:47,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 71 transitions. [2018-11-23 11:32:47,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 71 transitions. [2018-11-23 11:32:48,348 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 11:32:48,350 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:32:48,351 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:32:48,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:32:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:32:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 11:32:48,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:48,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2018-11-23 11:32:48,446 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2018-11-23 11:32:48,446 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2018-11-23 11:32:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:48,451 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2018-11-23 11:32:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2018-11-23 11:32:48,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:48,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:48,453 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2018-11-23 11:32:48,453 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2018-11-23 11:32:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:48,457 INFO L93 Difference]: Finished difference Result 72 states and 94 transitions. [2018-11-23 11:32:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2018-11-23 11:32:48,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:48,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:48,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:48,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 11:32:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2018-11-23 11:32:48,462 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 50 [2018-11-23 11:32:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:48,463 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2018-11-23 11:32:48,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:32:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2018-11-23 11:32:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 11:32:48,465 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:48,465 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:48,465 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:48,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:48,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1515283408, now seen corresponding path program 1 times [2018-11-23 11:32:48,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:48,466 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:48,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:48,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:48,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {2228#true} call ULTIMATE.init(); {2228#true} is VALID [2018-11-23 11:32:48,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,870 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2228#true} {2228#true} #130#return; {2228#true} is VALID [2018-11-23 11:32:48,870 INFO L256 TraceCheckUtils]: 3: Hoare triple {2228#true} call #t~ret12 := main(); {2228#true} is VALID [2018-11-23 11:32:48,870 INFO L273 TraceCheckUtils]: 4: Hoare triple {2228#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {2228#true} is VALID [2018-11-23 11:32:48,871 INFO L273 TraceCheckUtils]: 5: Hoare triple {2228#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {2228#true} is VALID [2018-11-23 11:32:48,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {2228#true} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {2251#(bvsle main_~tokenlen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:48,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {2251#(bvsle main_~tokenlen~0 (_ bv1000000 32))} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {2251#(bvsle main_~tokenlen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:48,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {2251#(bvsle main_~tokenlen~0 (_ bv1000000 32))} assume ~bvsgt32(~urilen~0, 0bv32); {2251#(bvsle main_~tokenlen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:48,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {2251#(bvsle main_~tokenlen~0 (_ bv1000000 32))} assume ~bvsgt32(~tokenlen~0, 0bv32); {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume ~bvsge32(~scheme~0, 0bv32); {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,877 INFO L256 TraceCheckUtils]: 12: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,880 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2228#true} {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #134#return; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,880 INFO L256 TraceCheckUtils]: 17: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsub32(~cp~0, 1bv32)) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,881 INFO L273 TraceCheckUtils]: 20: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,881 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2228#true} {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #136#return; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,882 INFO L273 TraceCheckUtils]: 22: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet4;havoc #t~nondet4; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,882 INFO L256 TraceCheckUtils]: 23: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,883 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2228#true} {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #138#return; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,883 INFO L256 TraceCheckUtils]: 28: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,884 INFO L273 TraceCheckUtils]: 30: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,885 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2228#true} {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #140#return; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32)); {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,886 INFO L273 TraceCheckUtils]: 34: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,887 INFO L256 TraceCheckUtils]: 35: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,887 INFO L273 TraceCheckUtils]: 36: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,887 INFO L273 TraceCheckUtils]: 37: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,888 INFO L273 TraceCheckUtils]: 38: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,891 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2228#true} {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #146#return; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,891 INFO L256 TraceCheckUtils]: 40: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,891 INFO L273 TraceCheckUtils]: 41: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,892 INFO L273 TraceCheckUtils]: 43: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,893 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2228#true} {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #148#return; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,893 INFO L273 TraceCheckUtils]: 45: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !(~cp~0 == ~bvsub32(~urilen~0, 1bv32)); {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,894 INFO L256 TraceCheckUtils]: 46: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~cp~0), ~urilen~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,894 INFO L273 TraceCheckUtils]: 47: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,894 INFO L273 TraceCheckUtils]: 48: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,894 INFO L273 TraceCheckUtils]: 49: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,895 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {2228#true} {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #150#return; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,895 INFO L256 TraceCheckUtils]: 51: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvadd32(1bv32, ~cp~0)) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,895 INFO L273 TraceCheckUtils]: 52: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,895 INFO L273 TraceCheckUtils]: 53: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,896 INFO L273 TraceCheckUtils]: 54: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,896 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2228#true} {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #152#return; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,897 INFO L273 TraceCheckUtils]: 56: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !(~bvadd32(1bv32, ~cp~0) == ~bvsub32(~urilen~0, 1bv32));#t~pre7 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre7;~scheme~0 := ~cp~0; {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,897 INFO L273 TraceCheckUtils]: 57: Hoare triple {2261#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet8;havoc #t~nondet8;~c~0 := 0bv32; {2406#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,897 INFO L256 TraceCheckUtils]: 58: Hoare triple {2406#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,898 INFO L273 TraceCheckUtils]: 59: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,898 INFO L273 TraceCheckUtils]: 60: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,898 INFO L273 TraceCheckUtils]: 61: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,899 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {2228#true} {2406#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #154#return; {2406#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,899 INFO L256 TraceCheckUtils]: 63: Hoare triple {2406#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,900 INFO L273 TraceCheckUtils]: 64: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,900 INFO L273 TraceCheckUtils]: 65: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,900 INFO L273 TraceCheckUtils]: 66: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,903 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {2228#true} {2406#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #156#return; {2406#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,905 INFO L273 TraceCheckUtils]: 68: Hoare triple {2406#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {2440#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,906 INFO L256 TraceCheckUtils]: 69: Hoare triple {2440#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,906 INFO L273 TraceCheckUtils]: 70: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,907 INFO L273 TraceCheckUtils]: 71: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,907 INFO L273 TraceCheckUtils]: 72: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,911 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {2228#true} {2440#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #158#return; {2440#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,911 INFO L256 TraceCheckUtils]: 74: Hoare triple {2440#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2228#true} is VALID [2018-11-23 11:32:48,912 INFO L273 TraceCheckUtils]: 75: Hoare triple {2228#true} ~cond := #in~cond; {2228#true} is VALID [2018-11-23 11:32:48,912 INFO L273 TraceCheckUtils]: 76: Hoare triple {2228#true} assume !(0bv32 == ~cond); {2228#true} is VALID [2018-11-23 11:32:48,912 INFO L273 TraceCheckUtils]: 77: Hoare triple {2228#true} assume true; {2228#true} is VALID [2018-11-23 11:32:48,915 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {2228#true} {2440#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #160#return; {2440#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:48,915 INFO L273 TraceCheckUtils]: 79: Hoare triple {2440#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {2474#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:48,918 INFO L256 TraceCheckUtils]: 80: Hoare triple {2474#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {2478#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:48,919 INFO L273 TraceCheckUtils]: 81: Hoare triple {2478#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2482#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:48,919 INFO L273 TraceCheckUtils]: 82: Hoare triple {2482#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2229#false} is VALID [2018-11-23 11:32:48,919 INFO L273 TraceCheckUtils]: 83: Hoare triple {2229#false} assume !false; {2229#false} is VALID [2018-11-23 11:32:48,926 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-11-23 11:32:48,926 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:48,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:48,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:32:48,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-11-23 11:32:48,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:48,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:32:49,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:49,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:32:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:32:49,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:32:49,058 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 9 states. [2018-11-23 11:32:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:50,580 INFO L93 Difference]: Finished difference Result 92 states and 123 transitions. [2018-11-23 11:32:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:32:50,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-11-23 11:32:50,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:32:50,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2018-11-23 11:32:50,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:32:50,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2018-11-23 11:32:50,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2018-11-23 11:32:50,792 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 11:32:50,797 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:32:50,797 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 11:32:50,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:32:50,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 11:32:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-11-23 11:32:51,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:51,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 82 states. [2018-11-23 11:32:51,135 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 82 states. [2018-11-23 11:32:51,136 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 82 states. [2018-11-23 11:32:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:51,140 INFO L93 Difference]: Finished difference Result 90 states and 121 transitions. [2018-11-23 11:32:51,141 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2018-11-23 11:32:51,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:51,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:51,142 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 90 states. [2018-11-23 11:32:51,142 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 90 states. [2018-11-23 11:32:51,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:51,148 INFO L93 Difference]: Finished difference Result 90 states and 121 transitions. [2018-11-23 11:32:51,148 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2018-11-23 11:32:51,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:51,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:51,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:51,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:32:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 108 transitions. [2018-11-23 11:32:51,154 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 108 transitions. Word has length 84 [2018-11-23 11:32:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:51,155 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 108 transitions. [2018-11-23 11:32:51,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:32:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 108 transitions. [2018-11-23 11:32:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 11:32:51,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:51,157 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:51,158 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:51,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1947514206, now seen corresponding path program 1 times [2018-11-23 11:32:51,159 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:51,159 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:51,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:51,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:51,896 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-11-23 11:32:52,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {2934#true} call ULTIMATE.init(); {2934#true} is VALID [2018-11-23 11:32:52,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,025 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2934#true} {2934#true} #130#return; {2934#true} is VALID [2018-11-23 11:32:52,025 INFO L256 TraceCheckUtils]: 3: Hoare triple {2934#true} call #t~ret12 := main(); {2934#true} is VALID [2018-11-23 11:32:52,026 INFO L273 TraceCheckUtils]: 4: Hoare triple {2934#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {2934#true} is VALID [2018-11-23 11:32:52,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {2934#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {2934#true} is VALID [2018-11-23 11:32:52,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {2934#true} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {2957#(bvsle main_~tokenlen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:52,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {2957#(bvsle main_~tokenlen~0 (_ bv1000000 32))} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {2957#(bvsle main_~tokenlen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:52,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {2957#(bvsle main_~tokenlen~0 (_ bv1000000 32))} assume ~bvsgt32(~urilen~0, 0bv32); {2957#(bvsle main_~tokenlen~0 (_ bv1000000 32))} is VALID [2018-11-23 11:32:52,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {2957#(bvsle main_~tokenlen~0 (_ bv1000000 32))} assume ~bvsgt32(~tokenlen~0, 0bv32); {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume ~bvsge32(~scheme~0, 0bv32); {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,040 INFO L256 TraceCheckUtils]: 12: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,040 INFO L273 TraceCheckUtils]: 13: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,040 INFO L273 TraceCheckUtils]: 14: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,041 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2934#true} {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #134#return; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,041 INFO L256 TraceCheckUtils]: 17: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsub32(~cp~0, 1bv32)) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,042 INFO L273 TraceCheckUtils]: 18: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,042 INFO L273 TraceCheckUtils]: 19: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,042 INFO L273 TraceCheckUtils]: 20: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,043 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2934#true} {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #136#return; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet4;havoc #t~nondet4; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,044 INFO L256 TraceCheckUtils]: 23: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,044 INFO L273 TraceCheckUtils]: 24: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,045 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2934#true} {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #138#return; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,046 INFO L256 TraceCheckUtils]: 28: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,046 INFO L273 TraceCheckUtils]: 29: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,046 INFO L273 TraceCheckUtils]: 30: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,046 INFO L273 TraceCheckUtils]: 31: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,047 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2934#true} {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #140#return; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,066 INFO L273 TraceCheckUtils]: 33: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32)); {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,081 INFO L273 TraceCheckUtils]: 34: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet5;havoc #t~nondet5; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,081 INFO L256 TraceCheckUtils]: 35: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,082 INFO L273 TraceCheckUtils]: 37: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,091 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2934#true} {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #146#return; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,091 INFO L256 TraceCheckUtils]: 40: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,091 INFO L273 TraceCheckUtils]: 41: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,092 INFO L273 TraceCheckUtils]: 43: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,105 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2934#true} {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #148#return; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,114 INFO L273 TraceCheckUtils]: 45: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !(~cp~0 == ~bvsub32(~urilen~0, 1bv32)); {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,114 INFO L256 TraceCheckUtils]: 46: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~cp~0), ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,114 INFO L273 TraceCheckUtils]: 47: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,114 INFO L273 TraceCheckUtils]: 48: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,115 INFO L273 TraceCheckUtils]: 49: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,121 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {2934#true} {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #150#return; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,121 INFO L256 TraceCheckUtils]: 51: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvadd32(1bv32, ~cp~0)) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,121 INFO L273 TraceCheckUtils]: 52: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,121 INFO L273 TraceCheckUtils]: 53: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,121 INFO L273 TraceCheckUtils]: 54: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,122 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2934#true} {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #152#return; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,123 INFO L273 TraceCheckUtils]: 56: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !(~bvadd32(1bv32, ~cp~0) == ~bvsub32(~urilen~0, 1bv32));#t~pre7 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre7;~scheme~0 := ~cp~0; {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,123 INFO L273 TraceCheckUtils]: 57: Hoare triple {2967#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet8;havoc #t~nondet8;~c~0 := 0bv32; {3112#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,123 INFO L256 TraceCheckUtils]: 58: Hoare triple {3112#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,124 INFO L273 TraceCheckUtils]: 61: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,126 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {2934#true} {3112#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #154#return; {3112#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,126 INFO L256 TraceCheckUtils]: 63: Hoare triple {3112#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,126 INFO L273 TraceCheckUtils]: 64: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,126 INFO L273 TraceCheckUtils]: 65: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,126 INFO L273 TraceCheckUtils]: 66: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,128 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {2934#true} {3112#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #156#return; {3112#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,129 INFO L273 TraceCheckUtils]: 68: Hoare triple {3112#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {3146#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,129 INFO L256 TraceCheckUtils]: 69: Hoare triple {3146#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,129 INFO L273 TraceCheckUtils]: 70: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,129 INFO L273 TraceCheckUtils]: 71: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,130 INFO L273 TraceCheckUtils]: 72: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,130 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {2934#true} {3146#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #158#return; {3146#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,131 INFO L256 TraceCheckUtils]: 74: Hoare triple {3146#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,131 INFO L273 TraceCheckUtils]: 75: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,131 INFO L273 TraceCheckUtils]: 76: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,131 INFO L273 TraceCheckUtils]: 77: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,133 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {2934#true} {3146#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} #160#return; {3146#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,134 INFO L273 TraceCheckUtils]: 79: Hoare triple {3146#(and (= main_~c~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:52,134 INFO L256 TraceCheckUtils]: 80: Hoare triple {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,141 INFO L273 TraceCheckUtils]: 81: Hoare triple {2934#true} ~cond := #in~cond; {3187#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2018-11-23 11:32:52,144 INFO L273 TraceCheckUtils]: 82: Hoare triple {3187#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0bv32 == ~cond); {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:52,144 INFO L273 TraceCheckUtils]: 83: Hoare triple {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:52,144 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #162#return; {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:52,145 INFO L256 TraceCheckUtils]: 85: Hoare triple {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~c~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,145 INFO L273 TraceCheckUtils]: 86: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,145 INFO L273 TraceCheckUtils]: 87: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,145 INFO L273 TraceCheckUtils]: 88: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,149 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {2934#true} {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #164#return; {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:52,149 INFO L256 TraceCheckUtils]: 90: Hoare triple {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,149 INFO L273 TraceCheckUtils]: 91: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,149 INFO L273 TraceCheckUtils]: 92: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,149 INFO L273 TraceCheckUtils]: 93: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,151 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {2934#true} {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #166#return; {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:52,151 INFO L256 TraceCheckUtils]: 95: Hoare triple {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,151 INFO L273 TraceCheckUtils]: 96: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,151 INFO L273 TraceCheckUtils]: 97: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,151 INFO L273 TraceCheckUtils]: 98: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,152 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {2934#true} {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #168#return; {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:52,153 INFO L273 TraceCheckUtils]: 100: Hoare triple {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~pre11 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre11; {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:52,153 INFO L273 TraceCheckUtils]: 101: Hoare triple {3180#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (_ bv0 32) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {3249#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:52,153 INFO L256 TraceCheckUtils]: 102: Hoare triple {3249#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,154 INFO L273 TraceCheckUtils]: 103: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,154 INFO L273 TraceCheckUtils]: 104: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,154 INFO L273 TraceCheckUtils]: 105: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,154 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {2934#true} {3249#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #158#return; {3249#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:52,155 INFO L256 TraceCheckUtils]: 107: Hoare triple {3249#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:52,155 INFO L273 TraceCheckUtils]: 108: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:52,155 INFO L273 TraceCheckUtils]: 109: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:52,155 INFO L273 TraceCheckUtils]: 110: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:52,158 INFO L268 TraceCheckUtils]: 111: Hoare quadruple {2934#true} {3249#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} #160#return; {3249#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:32:52,161 INFO L273 TraceCheckUtils]: 112: Hoare triple {3249#(and (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32)))} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {3283#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:32:52,163 INFO L256 TraceCheckUtils]: 113: Hoare triple {3283#(and (= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvslt (bvadd main_~c~0 (_ bv4294967295 32)) (bvadd main_~tokenlen~0 (_ bv4294967295 32))) (bvsle main_~tokenlen~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {3287#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,177 INFO L273 TraceCheckUtils]: 114: Hoare triple {3287#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3291#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:52,179 INFO L273 TraceCheckUtils]: 115: Hoare triple {3291#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2935#false} is VALID [2018-11-23 11:32:52,179 INFO L273 TraceCheckUtils]: 116: Hoare triple {2935#false} assume !false; {2935#false} is VALID [2018-11-23 11:32:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 71 proven. 21 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-23 11:32:52,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:53,128 INFO L273 TraceCheckUtils]: 116: Hoare triple {2935#false} assume !false; {2935#false} is VALID [2018-11-23 11:32:53,128 INFO L273 TraceCheckUtils]: 115: Hoare triple {3301#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2935#false} is VALID [2018-11-23 11:32:53,129 INFO L273 TraceCheckUtils]: 114: Hoare triple {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3301#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:53,129 INFO L256 TraceCheckUtils]: 113: Hoare triple {3308#(bvslt main_~c~0 main_~tokenlen~0)} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:53,131 INFO L273 TraceCheckUtils]: 112: Hoare triple {3312#(bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0)} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {3308#(bvslt main_~c~0 main_~tokenlen~0)} is VALID [2018-11-23 11:32:53,132 INFO L268 TraceCheckUtils]: 111: Hoare quadruple {2934#true} {3312#(bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0)} #160#return; {3312#(bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0)} is VALID [2018-11-23 11:32:53,132 INFO L273 TraceCheckUtils]: 110: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,132 INFO L273 TraceCheckUtils]: 109: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,132 INFO L273 TraceCheckUtils]: 108: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,133 INFO L256 TraceCheckUtils]: 107: Hoare triple {3312#(bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0)} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,133 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {2934#true} {3312#(bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0)} #158#return; {3312#(bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0)} is VALID [2018-11-23 11:32:53,134 INFO L273 TraceCheckUtils]: 105: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,134 INFO L273 TraceCheckUtils]: 104: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,134 INFO L273 TraceCheckUtils]: 103: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,134 INFO L256 TraceCheckUtils]: 102: Hoare triple {3312#(bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0)} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,135 INFO L273 TraceCheckUtils]: 101: Hoare triple {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {3312#(bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0)} is VALID [2018-11-23 11:32:53,136 INFO L273 TraceCheckUtils]: 100: Hoare triple {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} #t~pre11 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre11; {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} is VALID [2018-11-23 11:32:53,136 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {2934#true} {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} #168#return; {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} is VALID [2018-11-23 11:32:53,136 INFO L273 TraceCheckUtils]: 98: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,137 INFO L273 TraceCheckUtils]: 97: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,137 INFO L273 TraceCheckUtils]: 96: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,137 INFO L256 TraceCheckUtils]: 95: Hoare triple {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,137 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {2934#true} {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} #166#return; {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} is VALID [2018-11-23 11:32:53,138 INFO L273 TraceCheckUtils]: 93: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,138 INFO L273 TraceCheckUtils]: 92: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,138 INFO L273 TraceCheckUtils]: 91: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,138 INFO L256 TraceCheckUtils]: 90: Hoare triple {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,139 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {2934#true} {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} #164#return; {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} is VALID [2018-11-23 11:32:53,139 INFO L273 TraceCheckUtils]: 88: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,139 INFO L273 TraceCheckUtils]: 87: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,139 INFO L273 TraceCheckUtils]: 86: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,139 INFO L256 TraceCheckUtils]: 85: Hoare triple {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~c~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,185 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} {2934#true} #162#return; {3346#(or (not (bvslt main_~c~0 (bvadd main_~tokenlen~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0))} is VALID [2018-11-23 11:32:53,185 INFO L273 TraceCheckUtils]: 83: Hoare triple {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} assume true; {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:53,186 INFO L273 TraceCheckUtils]: 82: Hoare triple {3407#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} assume !(0bv32 == ~cond); {3191#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:53,186 INFO L273 TraceCheckUtils]: 81: Hoare triple {2934#true} ~cond := #in~cond; {3407#(or (= (_ bv0 32) __VERIFIER_assert_~cond) (not (= |__VERIFIER_assert_#in~cond| (_ bv0 32))))} is VALID [2018-11-23 11:32:53,186 INFO L256 TraceCheckUtils]: 80: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,187 INFO L273 TraceCheckUtils]: 79: Hoare triple {2934#true} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {2934#true} is VALID [2018-11-23 11:32:53,187 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {2934#true} {2934#true} #160#return; {2934#true} is VALID [2018-11-23 11:32:53,187 INFO L273 TraceCheckUtils]: 77: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,187 INFO L273 TraceCheckUtils]: 76: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,187 INFO L273 TraceCheckUtils]: 75: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,187 INFO L256 TraceCheckUtils]: 74: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,187 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {2934#true} {2934#true} #158#return; {2934#true} is VALID [2018-11-23 11:32:53,188 INFO L273 TraceCheckUtils]: 72: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,188 INFO L273 TraceCheckUtils]: 71: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,188 INFO L273 TraceCheckUtils]: 70: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,188 INFO L256 TraceCheckUtils]: 69: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,188 INFO L273 TraceCheckUtils]: 68: Hoare triple {2934#true} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {2934#true} is VALID [2018-11-23 11:32:53,188 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {2934#true} {2934#true} #156#return; {2934#true} is VALID [2018-11-23 11:32:53,188 INFO L273 TraceCheckUtils]: 66: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,189 INFO L273 TraceCheckUtils]: 65: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,189 INFO L273 TraceCheckUtils]: 64: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,189 INFO L256 TraceCheckUtils]: 63: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,189 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {2934#true} {2934#true} #154#return; {2934#true} is VALID [2018-11-23 11:32:53,189 INFO L273 TraceCheckUtils]: 61: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,190 INFO L273 TraceCheckUtils]: 60: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,190 INFO L273 TraceCheckUtils]: 59: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,190 INFO L256 TraceCheckUtils]: 58: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,190 INFO L273 TraceCheckUtils]: 57: Hoare triple {2934#true} assume 0bv32 != #t~nondet8;havoc #t~nondet8;~c~0 := 0bv32; {2934#true} is VALID [2018-11-23 11:32:53,191 INFO L273 TraceCheckUtils]: 56: Hoare triple {2934#true} assume !(~bvadd32(1bv32, ~cp~0) == ~bvsub32(~urilen~0, 1bv32));#t~pre7 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre7;~scheme~0 := ~cp~0; {2934#true} is VALID [2018-11-23 11:32:53,191 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2934#true} {2934#true} #152#return; {2934#true} is VALID [2018-11-23 11:32:53,191 INFO L273 TraceCheckUtils]: 54: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,191 INFO L273 TraceCheckUtils]: 53: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,191 INFO L273 TraceCheckUtils]: 52: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,191 INFO L256 TraceCheckUtils]: 51: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvadd32(1bv32, ~cp~0)) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,192 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {2934#true} {2934#true} #150#return; {2934#true} is VALID [2018-11-23 11:32:53,192 INFO L273 TraceCheckUtils]: 49: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,192 INFO L273 TraceCheckUtils]: 48: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,192 INFO L273 TraceCheckUtils]: 47: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,192 INFO L256 TraceCheckUtils]: 46: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~cp~0), ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,192 INFO L273 TraceCheckUtils]: 45: Hoare triple {2934#true} assume !(~cp~0 == ~bvsub32(~urilen~0, 1bv32)); {2934#true} is VALID [2018-11-23 11:32:53,192 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {2934#true} {2934#true} #148#return; {2934#true} is VALID [2018-11-23 11:32:53,193 INFO L273 TraceCheckUtils]: 43: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,193 INFO L273 TraceCheckUtils]: 42: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,193 INFO L256 TraceCheckUtils]: 40: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,193 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2934#true} {2934#true} #146#return; {2934#true} is VALID [2018-11-23 11:32:53,193 INFO L273 TraceCheckUtils]: 38: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,193 INFO L273 TraceCheckUtils]: 37: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,193 INFO L273 TraceCheckUtils]: 36: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,194 INFO L256 TraceCheckUtils]: 35: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,194 INFO L273 TraceCheckUtils]: 34: Hoare triple {2934#true} assume 0bv32 != #t~nondet5;havoc #t~nondet5; {2934#true} is VALID [2018-11-23 11:32:53,194 INFO L273 TraceCheckUtils]: 33: Hoare triple {2934#true} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32)); {2934#true} is VALID [2018-11-23 11:32:53,194 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2934#true} {2934#true} #140#return; {2934#true} is VALID [2018-11-23 11:32:53,194 INFO L273 TraceCheckUtils]: 31: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,194 INFO L273 TraceCheckUtils]: 30: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,194 INFO L273 TraceCheckUtils]: 29: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,194 INFO L256 TraceCheckUtils]: 28: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,195 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {2934#true} {2934#true} #138#return; {2934#true} is VALID [2018-11-23 11:32:53,195 INFO L273 TraceCheckUtils]: 26: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,195 INFO L273 TraceCheckUtils]: 25: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,195 INFO L256 TraceCheckUtils]: 23: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,195 INFO L273 TraceCheckUtils]: 22: Hoare triple {2934#true} assume 0bv32 != #t~nondet4;havoc #t~nondet4; {2934#true} is VALID [2018-11-23 11:32:53,195 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2934#true} {2934#true} #136#return; {2934#true} is VALID [2018-11-23 11:32:53,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,196 INFO L273 TraceCheckUtils]: 19: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,196 INFO L273 TraceCheckUtils]: 18: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,196 INFO L256 TraceCheckUtils]: 17: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsub32(~cp~0, 1bv32)) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,196 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {2934#true} {2934#true} #134#return; {2934#true} is VALID [2018-11-23 11:32:53,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,196 INFO L273 TraceCheckUtils]: 14: Hoare triple {2934#true} assume !(0bv32 == ~cond); {2934#true} is VALID [2018-11-23 11:32:53,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {2934#true} ~cond := #in~cond; {2934#true} is VALID [2018-11-23 11:32:53,197 INFO L256 TraceCheckUtils]: 12: Hoare triple {2934#true} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {2934#true} is VALID [2018-11-23 11:32:53,197 INFO L273 TraceCheckUtils]: 11: Hoare triple {2934#true} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {2934#true} is VALID [2018-11-23 11:32:53,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {2934#true} assume ~bvsge32(~scheme~0, 0bv32); {2934#true} is VALID [2018-11-23 11:32:53,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {2934#true} assume ~bvsgt32(~tokenlen~0, 0bv32); {2934#true} is VALID [2018-11-23 11:32:53,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {2934#true} assume ~bvsgt32(~urilen~0, 0bv32); {2934#true} is VALID [2018-11-23 11:32:53,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {2934#true} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {2934#true} is VALID [2018-11-23 11:32:53,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {2934#true} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {2934#true} is VALID [2018-11-23 11:32:53,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {2934#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {2934#true} is VALID [2018-11-23 11:32:53,198 INFO L273 TraceCheckUtils]: 4: Hoare triple {2934#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {2934#true} is VALID [2018-11-23 11:32:53,198 INFO L256 TraceCheckUtils]: 3: Hoare triple {2934#true} call #t~ret12 := main(); {2934#true} is VALID [2018-11-23 11:32:53,198 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2934#true} {2934#true} #130#return; {2934#true} is VALID [2018-11-23 11:32:53,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {2934#true} assume true; {2934#true} is VALID [2018-11-23 11:32:53,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {2934#true} call ULTIMATE.init(); {2934#true} is VALID [2018-11-23 11:32:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 76 proven. 16 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-11-23 11:32:53,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:53,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2018-11-23 11:32:53,210 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 117 [2018-11-23 11:32:53,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:53,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:32:53,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:53,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:32:53,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:32:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:32:53,447 INFO L87 Difference]: Start difference. First operand 82 states and 108 transitions. Second operand 18 states. [2018-11-23 11:32:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:58,447 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2018-11-23 11:32:58,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:32:58,447 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 117 [2018-11-23 11:32:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:32:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2018-11-23 11:32:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:32:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 117 transitions. [2018-11-23 11:32:58,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 117 transitions. [2018-11-23 11:32:58,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:58,799 INFO L225 Difference]: With dead ends: 111 [2018-11-23 11:32:58,799 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:32:58,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 218 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:32:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:32:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-11-23 11:32:58,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:58,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 95 states. [2018-11-23 11:32:58,923 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 95 states. [2018-11-23 11:32:58,923 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 95 states. [2018-11-23 11:32:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:58,928 INFO L93 Difference]: Finished difference Result 109 states and 146 transitions. [2018-11-23 11:32:58,928 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 146 transitions. [2018-11-23 11:32:58,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:58,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:58,929 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 109 states. [2018-11-23 11:32:58,930 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 109 states. [2018-11-23 11:32:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:58,936 INFO L93 Difference]: Finished difference Result 109 states and 146 transitions. [2018-11-23 11:32:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 146 transitions. [2018-11-23 11:32:58,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:58,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:58,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:58,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 11:32:58,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 127 transitions. [2018-11-23 11:32:58,942 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 127 transitions. Word has length 117 [2018-11-23 11:32:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:58,942 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 127 transitions. [2018-11-23 11:32:58,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:32:58,942 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 127 transitions. [2018-11-23 11:32:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 11:32:58,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:58,945 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:58,945 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:58,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:58,945 INFO L82 PathProgramCache]: Analyzing trace with hash 670726439, now seen corresponding path program 2 times [2018-11-23 11:32:58,946 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:58,946 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:58,972 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:32:59,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:32:59,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:32:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:59,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:59,428 INFO L256 TraceCheckUtils]: 0: Hoare triple {4201#true} call ULTIMATE.init(); {4201#true} is VALID [2018-11-23 11:32:59,429 INFO L273 TraceCheckUtils]: 1: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,429 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4201#true} {4201#true} #130#return; {4201#true} is VALID [2018-11-23 11:32:59,429 INFO L256 TraceCheckUtils]: 3: Hoare triple {4201#true} call #t~ret12 := main(); {4201#true} is VALID [2018-11-23 11:32:59,429 INFO L273 TraceCheckUtils]: 4: Hoare triple {4201#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {4201#true} is VALID [2018-11-23 11:32:59,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {4201#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {4201#true} is VALID [2018-11-23 11:32:59,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {4201#true} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {4201#true} is VALID [2018-11-23 11:32:59,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {4201#true} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {4201#true} is VALID [2018-11-23 11:32:59,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {4201#true} assume ~bvsgt32(~urilen~0, 0bv32); {4201#true} is VALID [2018-11-23 11:32:59,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {4201#true} assume ~bvsgt32(~tokenlen~0, 0bv32); {4201#true} is VALID [2018-11-23 11:32:59,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {4201#true} assume ~bvsge32(~scheme~0, 0bv32); {4201#true} is VALID [2018-11-23 11:32:59,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {4201#true} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {4201#true} is VALID [2018-11-23 11:32:59,431 INFO L256 TraceCheckUtils]: 12: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,432 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4201#true} {4201#true} #134#return; {4201#true} is VALID [2018-11-23 11:32:59,432 INFO L256 TraceCheckUtils]: 17: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsub32(~cp~0, 1bv32)) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,433 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4201#true} {4201#true} #136#return; {4201#true} is VALID [2018-11-23 11:32:59,433 INFO L273 TraceCheckUtils]: 22: Hoare triple {4201#true} assume 0bv32 != #t~nondet4;havoc #t~nondet4; {4201#true} is VALID [2018-11-23 11:32:59,433 INFO L256 TraceCheckUtils]: 23: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,433 INFO L273 TraceCheckUtils]: 25: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,433 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4201#true} {4201#true} #138#return; {4201#true} is VALID [2018-11-23 11:32:59,434 INFO L256 TraceCheckUtils]: 28: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,434 INFO L273 TraceCheckUtils]: 29: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,434 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {4201#true} {4201#true} #140#return; {4201#true} is VALID [2018-11-23 11:32:59,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {4201#true} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32)); {4201#true} is VALID [2018-11-23 11:32:59,434 INFO L273 TraceCheckUtils]: 34: Hoare triple {4201#true} assume 0bv32 != #t~nondet5;havoc #t~nondet5; {4201#true} is VALID [2018-11-23 11:32:59,434 INFO L256 TraceCheckUtils]: 35: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,435 INFO L273 TraceCheckUtils]: 36: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,435 INFO L273 TraceCheckUtils]: 37: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,435 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4201#true} {4201#true} #146#return; {4201#true} is VALID [2018-11-23 11:32:59,435 INFO L256 TraceCheckUtils]: 40: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,435 INFO L273 TraceCheckUtils]: 41: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,435 INFO L273 TraceCheckUtils]: 42: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,435 INFO L273 TraceCheckUtils]: 43: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,436 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4201#true} {4201#true} #148#return; {4201#true} is VALID [2018-11-23 11:32:59,436 INFO L273 TraceCheckUtils]: 45: Hoare triple {4201#true} assume !(~cp~0 == ~bvsub32(~urilen~0, 1bv32)); {4201#true} is VALID [2018-11-23 11:32:59,436 INFO L256 TraceCheckUtils]: 46: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~cp~0), ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,436 INFO L273 TraceCheckUtils]: 47: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,436 INFO L273 TraceCheckUtils]: 48: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,436 INFO L273 TraceCheckUtils]: 49: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,436 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {4201#true} {4201#true} #150#return; {4201#true} is VALID [2018-11-23 11:32:59,436 INFO L256 TraceCheckUtils]: 51: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvadd32(1bv32, ~cp~0)) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,437 INFO L273 TraceCheckUtils]: 52: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,437 INFO L273 TraceCheckUtils]: 53: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,437 INFO L273 TraceCheckUtils]: 54: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,437 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4201#true} {4201#true} #152#return; {4201#true} is VALID [2018-11-23 11:32:59,437 INFO L273 TraceCheckUtils]: 56: Hoare triple {4201#true} assume !(~bvadd32(1bv32, ~cp~0) == ~bvsub32(~urilen~0, 1bv32));#t~pre7 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre7;~scheme~0 := ~cp~0; {4201#true} is VALID [2018-11-23 11:32:59,437 INFO L273 TraceCheckUtils]: 57: Hoare triple {4201#true} assume 0bv32 != #t~nondet8;havoc #t~nondet8;~c~0 := 0bv32; {4377#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:32:59,438 INFO L256 TraceCheckUtils]: 58: Hoare triple {4377#(= main_~c~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,438 INFO L273 TraceCheckUtils]: 59: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,438 INFO L273 TraceCheckUtils]: 60: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,438 INFO L273 TraceCheckUtils]: 61: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,451 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {4201#true} {4377#(= main_~c~0 (_ bv0 32))} #154#return; {4377#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:32:59,451 INFO L256 TraceCheckUtils]: 63: Hoare triple {4377#(= main_~c~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,452 INFO L273 TraceCheckUtils]: 64: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,452 INFO L273 TraceCheckUtils]: 65: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,452 INFO L273 TraceCheckUtils]: 66: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,466 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {4201#true} {4377#(= main_~c~0 (_ bv0 32))} #156#return; {4377#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:32:59,475 INFO L273 TraceCheckUtils]: 68: Hoare triple {4377#(= main_~c~0 (_ bv0 32))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {4377#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:32:59,475 INFO L256 TraceCheckUtils]: 69: Hoare triple {4377#(= main_~c~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,475 INFO L273 TraceCheckUtils]: 70: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,475 INFO L273 TraceCheckUtils]: 71: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,475 INFO L273 TraceCheckUtils]: 72: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,490 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {4201#true} {4377#(= main_~c~0 (_ bv0 32))} #158#return; {4377#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:32:59,490 INFO L256 TraceCheckUtils]: 74: Hoare triple {4377#(= main_~c~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,490 INFO L273 TraceCheckUtils]: 75: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,491 INFO L273 TraceCheckUtils]: 76: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,491 INFO L273 TraceCheckUtils]: 77: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,492 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {4201#true} {4377#(= main_~c~0 (_ bv0 32))} #160#return; {4377#(= main_~c~0 (_ bv0 32))} is VALID [2018-11-23 11:32:59,493 INFO L273 TraceCheckUtils]: 79: Hoare triple {4377#(= main_~c~0 (_ bv0 32))} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,493 INFO L256 TraceCheckUtils]: 80: Hoare triple {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,493 INFO L273 TraceCheckUtils]: 81: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,493 INFO L273 TraceCheckUtils]: 82: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,493 INFO L273 TraceCheckUtils]: 83: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,495 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {4201#true} {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #162#return; {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,495 INFO L256 TraceCheckUtils]: 85: Hoare triple {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~c~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,495 INFO L273 TraceCheckUtils]: 86: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,495 INFO L273 TraceCheckUtils]: 87: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,495 INFO L273 TraceCheckUtils]: 88: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,496 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {4201#true} {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #164#return; {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,496 INFO L256 TraceCheckUtils]: 90: Hoare triple {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,496 INFO L273 TraceCheckUtils]: 91: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,496 INFO L273 TraceCheckUtils]: 92: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,496 INFO L273 TraceCheckUtils]: 93: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,498 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {4201#true} {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #166#return; {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,498 INFO L256 TraceCheckUtils]: 95: Hoare triple {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,498 INFO L273 TraceCheckUtils]: 96: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,498 INFO L273 TraceCheckUtils]: 97: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,498 INFO L273 TraceCheckUtils]: 98: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,500 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {4201#true} {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #168#return; {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,500 INFO L273 TraceCheckUtils]: 100: Hoare triple {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #t~pre11 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre11; {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,502 INFO L273 TraceCheckUtils]: 101: Hoare triple {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,502 INFO L256 TraceCheckUtils]: 102: Hoare triple {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,502 INFO L273 TraceCheckUtils]: 103: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,502 INFO L273 TraceCheckUtils]: 104: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,502 INFO L273 TraceCheckUtils]: 105: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,503 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {4201#true} {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #158#return; {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,503 INFO L256 TraceCheckUtils]: 107: Hoare triple {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,503 INFO L273 TraceCheckUtils]: 108: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,503 INFO L273 TraceCheckUtils]: 109: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,503 INFO L273 TraceCheckUtils]: 110: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,504 INFO L268 TraceCheckUtils]: 111: Hoare quadruple {4201#true} {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} #160#return; {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,508 INFO L273 TraceCheckUtils]: 112: Hoare triple {4444#(= (bvadd main_~c~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,508 INFO L256 TraceCheckUtils]: 113: Hoare triple {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,508 INFO L273 TraceCheckUtils]: 114: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,508 INFO L273 TraceCheckUtils]: 115: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,508 INFO L273 TraceCheckUtils]: 116: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,509 INFO L268 TraceCheckUtils]: 117: Hoare quadruple {4201#true} {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #162#return; {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,509 INFO L256 TraceCheckUtils]: 118: Hoare triple {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~c~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,510 INFO L273 TraceCheckUtils]: 119: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,510 INFO L273 TraceCheckUtils]: 120: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,510 INFO L273 TraceCheckUtils]: 121: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,511 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {4201#true} {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #164#return; {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,511 INFO L256 TraceCheckUtils]: 123: Hoare triple {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,511 INFO L273 TraceCheckUtils]: 124: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,511 INFO L273 TraceCheckUtils]: 125: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,511 INFO L273 TraceCheckUtils]: 126: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,512 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {4201#true} {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #166#return; {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,512 INFO L256 TraceCheckUtils]: 128: Hoare triple {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,512 INFO L273 TraceCheckUtils]: 129: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,512 INFO L273 TraceCheckUtils]: 130: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,512 INFO L273 TraceCheckUtils]: 131: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,522 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {4201#true} {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #168#return; {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,523 INFO L273 TraceCheckUtils]: 133: Hoare triple {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #t~pre11 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre11; {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,523 INFO L273 TraceCheckUtils]: 134: Hoare triple {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,523 INFO L256 TraceCheckUtils]: 135: Hoare triple {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,523 INFO L273 TraceCheckUtils]: 136: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,524 INFO L273 TraceCheckUtils]: 137: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,524 INFO L273 TraceCheckUtils]: 138: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,524 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {4201#true} {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #158#return; {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,525 INFO L256 TraceCheckUtils]: 140: Hoare triple {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,525 INFO L273 TraceCheckUtils]: 141: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,525 INFO L273 TraceCheckUtils]: 142: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,525 INFO L273 TraceCheckUtils]: 143: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,542 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {4201#true} {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} #160#return; {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,550 INFO L273 TraceCheckUtils]: 145: Hoare triple {4544#(= (bvadd main_~c~0 (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {4644#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,550 INFO L256 TraceCheckUtils]: 146: Hoare triple {4644#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,550 INFO L273 TraceCheckUtils]: 147: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,550 INFO L273 TraceCheckUtils]: 148: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,550 INFO L273 TraceCheckUtils]: 149: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,551 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {4201#true} {4644#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} #162#return; {4644#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,552 INFO L256 TraceCheckUtils]: 151: Hoare triple {4644#(= (bvadd main_~c~0 (_ bv4294967293 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~c~0) then 1bv32 else 0bv32)); {4663#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,552 INFO L273 TraceCheckUtils]: 152: Hoare triple {4663#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4667#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:59,556 INFO L273 TraceCheckUtils]: 153: Hoare triple {4667#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {4202#false} is VALID [2018-11-23 11:32:59,556 INFO L273 TraceCheckUtils]: 154: Hoare triple {4202#false} assume !false; {4202#false} is VALID [2018-11-23 11:32:59,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 50 proven. 21 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-23 11:32:59,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:59,904 INFO L273 TraceCheckUtils]: 154: Hoare triple {4202#false} assume !false; {4202#false} is VALID [2018-11-23 11:32:59,904 INFO L273 TraceCheckUtils]: 153: Hoare triple {4677#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {4202#false} is VALID [2018-11-23 11:32:59,905 INFO L273 TraceCheckUtils]: 152: Hoare triple {4681#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {4677#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:59,906 INFO L256 TraceCheckUtils]: 151: Hoare triple {4685#(bvsle (_ bv0 32) main_~c~0)} call __VERIFIER_assert((if ~bvsle32(0bv32, ~c~0) then 1bv32 else 0bv32)); {4681#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:59,907 INFO L268 TraceCheckUtils]: 150: Hoare quadruple {4201#true} {4685#(bvsle (_ bv0 32) main_~c~0)} #162#return; {4685#(bvsle (_ bv0 32) main_~c~0)} is VALID [2018-11-23 11:32:59,907 INFO L273 TraceCheckUtils]: 149: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,908 INFO L273 TraceCheckUtils]: 148: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,908 INFO L273 TraceCheckUtils]: 147: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,908 INFO L256 TraceCheckUtils]: 146: Hoare triple {4685#(bvsle (_ bv0 32) main_~c~0)} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,909 INFO L273 TraceCheckUtils]: 145: Hoare triple {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {4685#(bvsle (_ bv0 32) main_~c~0)} is VALID [2018-11-23 11:32:59,909 INFO L268 TraceCheckUtils]: 144: Hoare quadruple {4201#true} {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} #160#return; {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} is VALID [2018-11-23 11:32:59,910 INFO L273 TraceCheckUtils]: 143: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,910 INFO L273 TraceCheckUtils]: 142: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,910 INFO L273 TraceCheckUtils]: 141: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,910 INFO L256 TraceCheckUtils]: 140: Hoare triple {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,911 INFO L268 TraceCheckUtils]: 139: Hoare quadruple {4201#true} {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} #158#return; {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} is VALID [2018-11-23 11:32:59,911 INFO L273 TraceCheckUtils]: 138: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,912 INFO L273 TraceCheckUtils]: 137: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,912 INFO L273 TraceCheckUtils]: 136: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,912 INFO L256 TraceCheckUtils]: 135: Hoare triple {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,912 INFO L273 TraceCheckUtils]: 134: Hoare triple {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} is VALID [2018-11-23 11:32:59,913 INFO L273 TraceCheckUtils]: 133: Hoare triple {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} #t~pre11 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre11; {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} is VALID [2018-11-23 11:32:59,914 INFO L268 TraceCheckUtils]: 132: Hoare quadruple {4201#true} {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} #168#return; {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} is VALID [2018-11-23 11:32:59,914 INFO L273 TraceCheckUtils]: 131: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,914 INFO L273 TraceCheckUtils]: 130: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,914 INFO L273 TraceCheckUtils]: 129: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,915 INFO L256 TraceCheckUtils]: 128: Hoare triple {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,915 INFO L268 TraceCheckUtils]: 127: Hoare quadruple {4201#true} {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} #166#return; {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} is VALID [2018-11-23 11:32:59,916 INFO L273 TraceCheckUtils]: 126: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,916 INFO L273 TraceCheckUtils]: 125: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,916 INFO L273 TraceCheckUtils]: 124: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,916 INFO L256 TraceCheckUtils]: 123: Hoare triple {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,917 INFO L268 TraceCheckUtils]: 122: Hoare quadruple {4201#true} {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} #164#return; {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} is VALID [2018-11-23 11:32:59,917 INFO L273 TraceCheckUtils]: 121: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,917 INFO L273 TraceCheckUtils]: 120: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,917 INFO L273 TraceCheckUtils]: 119: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,917 INFO L256 TraceCheckUtils]: 118: Hoare triple {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~c~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,918 INFO L268 TraceCheckUtils]: 117: Hoare quadruple {4201#true} {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} #162#return; {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} is VALID [2018-11-23 11:32:59,918 INFO L273 TraceCheckUtils]: 116: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,918 INFO L273 TraceCheckUtils]: 115: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,918 INFO L273 TraceCheckUtils]: 114: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,918 INFO L256 TraceCheckUtils]: 113: Hoare triple {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,921 INFO L273 TraceCheckUtils]: 112: Hoare triple {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {4704#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv1 32)))} is VALID [2018-11-23 11:32:59,922 INFO L268 TraceCheckUtils]: 111: Hoare quadruple {4201#true} {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} #160#return; {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:59,922 INFO L273 TraceCheckUtils]: 110: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,922 INFO L273 TraceCheckUtils]: 109: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,923 INFO L273 TraceCheckUtils]: 108: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,923 INFO L256 TraceCheckUtils]: 107: Hoare triple {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,924 INFO L268 TraceCheckUtils]: 106: Hoare quadruple {4201#true} {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} #158#return; {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:59,924 INFO L273 TraceCheckUtils]: 105: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,924 INFO L273 TraceCheckUtils]: 104: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,924 INFO L273 TraceCheckUtils]: 103: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,925 INFO L256 TraceCheckUtils]: 102: Hoare triple {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,925 INFO L273 TraceCheckUtils]: 101: Hoare triple {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:59,925 INFO L273 TraceCheckUtils]: 100: Hoare triple {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} #t~pre11 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre11; {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:59,926 INFO L268 TraceCheckUtils]: 99: Hoare quadruple {4201#true} {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} #168#return; {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:59,926 INFO L273 TraceCheckUtils]: 98: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,926 INFO L273 TraceCheckUtils]: 97: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,927 INFO L273 TraceCheckUtils]: 96: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,927 INFO L256 TraceCheckUtils]: 95: Hoare triple {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,928 INFO L268 TraceCheckUtils]: 94: Hoare quadruple {4201#true} {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} #166#return; {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:59,928 INFO L273 TraceCheckUtils]: 93: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,928 INFO L273 TraceCheckUtils]: 92: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,929 INFO L273 TraceCheckUtils]: 91: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,929 INFO L256 TraceCheckUtils]: 90: Hoare triple {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,929 INFO L268 TraceCheckUtils]: 89: Hoare quadruple {4201#true} {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} #164#return; {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:59,930 INFO L273 TraceCheckUtils]: 88: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,930 INFO L273 TraceCheckUtils]: 87: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,930 INFO L273 TraceCheckUtils]: 86: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,930 INFO L256 TraceCheckUtils]: 85: Hoare triple {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~c~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,931 INFO L268 TraceCheckUtils]: 84: Hoare quadruple {4201#true} {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} #162#return; {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:59,931 INFO L273 TraceCheckUtils]: 83: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,931 INFO L273 TraceCheckUtils]: 82: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,931 INFO L273 TraceCheckUtils]: 81: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,931 INFO L256 TraceCheckUtils]: 80: Hoare triple {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} call __VERIFIER_assert((if ~bvslt32(~c~0, ~tokenlen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,935 INFO L273 TraceCheckUtils]: 79: Hoare triple {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} assume 0bv32 != #t~nondet9;havoc #t~nondet9;#t~pre10 := ~bvadd32(1bv32, ~c~0);~c~0 := ~bvadd32(1bv32, ~c~0);havoc #t~pre10; {4804#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv2 32)))} is VALID [2018-11-23 11:32:59,936 INFO L268 TraceCheckUtils]: 78: Hoare quadruple {4201#true} {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} #160#return; {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} is VALID [2018-11-23 11:32:59,936 INFO L273 TraceCheckUtils]: 77: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,936 INFO L273 TraceCheckUtils]: 76: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,937 INFO L273 TraceCheckUtils]: 75: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,937 INFO L256 TraceCheckUtils]: 74: Hoare triple {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,938 INFO L268 TraceCheckUtils]: 73: Hoare quadruple {4201#true} {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} #158#return; {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} is VALID [2018-11-23 11:32:59,938 INFO L273 TraceCheckUtils]: 72: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,938 INFO L273 TraceCheckUtils]: 71: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,938 INFO L273 TraceCheckUtils]: 70: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,938 INFO L256 TraceCheckUtils]: 69: Hoare triple {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,939 INFO L273 TraceCheckUtils]: 68: Hoare triple {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32) && ~bvslt32(~c~0, ~bvsub32(~tokenlen~0, 1bv32))); {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} is VALID [2018-11-23 11:32:59,939 INFO L268 TraceCheckUtils]: 67: Hoare quadruple {4201#true} {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} #156#return; {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} is VALID [2018-11-23 11:32:59,939 INFO L273 TraceCheckUtils]: 66: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,939 INFO L273 TraceCheckUtils]: 65: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,940 INFO L273 TraceCheckUtils]: 64: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,940 INFO L256 TraceCheckUtils]: 63: Hoare triple {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,941 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {4201#true} {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} #154#return; {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} is VALID [2018-11-23 11:32:59,941 INFO L273 TraceCheckUtils]: 61: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,941 INFO L273 TraceCheckUtils]: 60: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,941 INFO L273 TraceCheckUtils]: 59: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,942 INFO L256 TraceCheckUtils]: 58: Hoare triple {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,942 INFO L273 TraceCheckUtils]: 57: Hoare triple {4201#true} assume 0bv32 != #t~nondet8;havoc #t~nondet8;~c~0 := 0bv32; {4904#(bvsle (_ bv0 32) (bvadd main_~c~0 (_ bv3 32)))} is VALID [2018-11-23 11:32:59,943 INFO L273 TraceCheckUtils]: 56: Hoare triple {4201#true} assume !(~bvadd32(1bv32, ~cp~0) == ~bvsub32(~urilen~0, 1bv32));#t~pre7 := ~bvadd32(1bv32, ~cp~0);~cp~0 := ~bvadd32(1bv32, ~cp~0);havoc #t~pre7;~scheme~0 := ~cp~0; {4201#true} is VALID [2018-11-23 11:32:59,943 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4201#true} {4201#true} #152#return; {4201#true} is VALID [2018-11-23 11:32:59,943 INFO L273 TraceCheckUtils]: 54: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,944 INFO L273 TraceCheckUtils]: 53: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,944 INFO L273 TraceCheckUtils]: 52: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,944 INFO L256 TraceCheckUtils]: 51: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvadd32(1bv32, ~cp~0)) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,945 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {4201#true} {4201#true} #150#return; {4201#true} is VALID [2018-11-23 11:32:59,945 INFO L273 TraceCheckUtils]: 49: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,945 INFO L273 TraceCheckUtils]: 48: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,946 INFO L273 TraceCheckUtils]: 47: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,946 INFO L256 TraceCheckUtils]: 46: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvslt32(~bvadd32(1bv32, ~cp~0), ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,946 INFO L273 TraceCheckUtils]: 45: Hoare triple {4201#true} assume !(~cp~0 == ~bvsub32(~urilen~0, 1bv32)); {4201#true} is VALID [2018-11-23 11:32:59,947 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4201#true} {4201#true} #148#return; {4201#true} is VALID [2018-11-23 11:32:59,947 INFO L273 TraceCheckUtils]: 43: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,947 INFO L273 TraceCheckUtils]: 42: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,947 INFO L273 TraceCheckUtils]: 41: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,947 INFO L256 TraceCheckUtils]: 40: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,948 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {4201#true} {4201#true} #146#return; {4201#true} is VALID [2018-11-23 11:32:59,948 INFO L273 TraceCheckUtils]: 38: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,948 INFO L273 TraceCheckUtils]: 37: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,948 INFO L273 TraceCheckUtils]: 36: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,948 INFO L256 TraceCheckUtils]: 35: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {4201#true} assume 0bv32 != #t~nondet5;havoc #t~nondet5; {4201#true} is VALID [2018-11-23 11:32:59,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {4201#true} assume !!(~cp~0 != ~bvsub32(~urilen~0, 1bv32)); {4201#true} is VALID [2018-11-23 11:32:59,949 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {4201#true} {4201#true} #140#return; {4201#true} is VALID [2018-11-23 11:32:59,949 INFO L273 TraceCheckUtils]: 31: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,950 INFO L273 TraceCheckUtils]: 30: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,950 INFO L256 TraceCheckUtils]: 28: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~cp~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,950 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {4201#true} {4201#true} #138#return; {4201#true} is VALID [2018-11-23 11:32:59,950 INFO L273 TraceCheckUtils]: 26: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,951 INFO L256 TraceCheckUtils]: 23: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvslt32(~cp~0, ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {4201#true} assume 0bv32 != #t~nondet4;havoc #t~nondet4; {4201#true} is VALID [2018-11-23 11:32:59,951 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {4201#true} {4201#true} #136#return; {4201#true} is VALID [2018-11-23 11:32:59,952 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,952 INFO L256 TraceCheckUtils]: 17: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvsle32(0bv32, ~bvsub32(~cp~0, 1bv32)) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,952 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4201#true} {4201#true} #134#return; {4201#true} is VALID [2018-11-23 11:32:59,953 INFO L273 TraceCheckUtils]: 15: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {4201#true} assume !(0bv32 == ~cond); {4201#true} is VALID [2018-11-23 11:32:59,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {4201#true} ~cond := #in~cond; {4201#true} is VALID [2018-11-23 11:32:59,953 INFO L256 TraceCheckUtils]: 12: Hoare triple {4201#true} call __VERIFIER_assert((if ~bvslt32(~bvsub32(~cp~0, 1bv32), ~urilen~0) then 1bv32 else 0bv32)); {4201#true} is VALID [2018-11-23 11:32:59,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {4201#true} assume !(0bv32 == ~scheme~0 || ~bvslt32(~bvsub32(~urilen~0, 1bv32), ~scheme~0));~cp~0 := ~scheme~0; {4201#true} is VALID [2018-11-23 11:32:59,954 INFO L273 TraceCheckUtils]: 10: Hoare triple {4201#true} assume ~bvsge32(~scheme~0, 0bv32); {4201#true} is VALID [2018-11-23 11:32:59,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {4201#true} assume ~bvsgt32(~tokenlen~0, 0bv32); {4201#true} is VALID [2018-11-23 11:32:59,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {4201#true} assume ~bvsgt32(~urilen~0, 0bv32); {4201#true} is VALID [2018-11-23 11:32:59,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {4201#true} assume !!(~bvsle32(~scheme~0, 1000000bv32) && ~bvsge32(~scheme~0, 4293967296bv32)); {4201#true} is VALID [2018-11-23 11:32:59,954 INFO L273 TraceCheckUtils]: 6: Hoare triple {4201#true} assume !!(~bvsle32(~tokenlen~0, 1000000bv32) && ~bvsge32(~tokenlen~0, 4293967296bv32)); {4201#true} is VALID [2018-11-23 11:32:59,955 INFO L273 TraceCheckUtils]: 5: Hoare triple {4201#true} assume !!(~bvsle32(~urilen~0, 1000000bv32) && ~bvsge32(~urilen~0, 4293967296bv32)); {4201#true} is VALID [2018-11-23 11:32:59,955 INFO L273 TraceCheckUtils]: 4: Hoare triple {4201#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;~urilen~0 := #t~nondet1;havoc #t~nondet1;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;~scheme~0 := #t~nondet3;havoc #t~nondet3; {4201#true} is VALID [2018-11-23 11:32:59,955 INFO L256 TraceCheckUtils]: 3: Hoare triple {4201#true} call #t~ret12 := main(); {4201#true} is VALID [2018-11-23 11:32:59,955 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4201#true} {4201#true} #130#return; {4201#true} is VALID [2018-11-23 11:32:59,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {4201#true} assume true; {4201#true} is VALID [2018-11-23 11:32:59,956 INFO L256 TraceCheckUtils]: 0: Hoare triple {4201#true} call ULTIMATE.init(); {4201#true} is VALID [2018-11-23 11:32:59,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1271 backedges. 50 proven. 21 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2018-11-23 11:32:59,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:59,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:32:59,992 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-11-23 11:32:59,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:59,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:33:00,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:00,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:33:00,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:33:00,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:33:00,271 INFO L87 Difference]: Start difference. First operand 95 states and 127 transitions. Second operand 14 states. [2018-11-23 11:33:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:03,568 INFO L93 Difference]: Finished difference Result 143 states and 203 transitions. [2018-11-23 11:33:03,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:33:03,568 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2018-11-23 11:33:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:33:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2018-11-23 11:33:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:33:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2018-11-23 11:33:03,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 166 transitions. [2018-11-23 11:33:03,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:03,865 INFO L225 Difference]: With dead ends: 143 [2018-11-23 11:33:03,866 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:33:03,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:33:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:33:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:33:03,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:03,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:03,869 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:03,870 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:03,870 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:33:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:33:03,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:03,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:03,871 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:03,871 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:33:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:03,871 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:33:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:33:03,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:03,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:03,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:03,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:33:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:33:03,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 155 [2018-11-23 11:33:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:03,873 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:33:03,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:33:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:33:03,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:03,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:33:04,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:33:04,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:33:04,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:33:04,137 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2018-11-23 11:33:04,907 WARN L180 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 27 [2018-11-23 11:33:05,409 WARN L180 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 23 [2018-11-23 11:33:05,899 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2018-11-23 11:33:06,120 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-11-23 11:33:06,517 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2018-11-23 11:33:06,791 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-11-23 11:33:06,990 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-11-23 11:33:07,271 WARN L180 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 27 [2018-11-23 11:33:07,589 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2018-11-23 11:33:07,633 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 11:33:07,633 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:33:07,633 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 11:33:07,633 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 11:33:07,633 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 11:33:07,633 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 11:33:07,633 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 69) no Hoare annotation was computed. [2018-11-23 11:33:07,633 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-23 11:33:07,633 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-23 11:33:07,633 INFO L444 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,634 INFO L444 ceAbstractionStarter]: At program point L28-1(line 28) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,634 INFO L444 ceAbstractionStarter]: At program point L53(line 53) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvslt main_~c~0 main_~tokenlen~0) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~c~0)) [2018-11-23 11:33:07,634 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-11-23 11:33:07,634 INFO L444 ceAbstractionStarter]: At program point L53-1(line 53) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvslt main_~c~0 main_~tokenlen~0) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvslt (bvadd main_~c~0 (_ bv1 32)) main_~tokenlen~0) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~c~0)) [2018-11-23 11:33:07,634 INFO L448 ceAbstractionStarter]: For program point L29(lines 11 69) no Hoare annotation was computed. [2018-11-23 11:33:07,634 INFO L448 ceAbstractionStarter]: For program point L54(lines 52 63) no Hoare annotation was computed. [2018-11-23 11:33:07,634 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-11-23 11:33:07,634 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 11 69) no Hoare annotation was computed. [2018-11-23 11:33:07,635 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 69) no Hoare annotation was computed. [2018-11-23 11:33:07,635 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 69) the Hoare annotation is: true [2018-11-23 11:33:07,635 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 61) no Hoare annotation was computed. [2018-11-23 11:33:07,635 INFO L448 ceAbstractionStarter]: For program point L22(lines 11 69) no Hoare annotation was computed. [2018-11-23 11:33:07,635 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 65) no Hoare annotation was computed. [2018-11-23 11:33:07,635 INFO L444 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse0 (bvsle main_~scheme~0 (_ bv1000000 32))) (.cse1 (bvsge main_~scheme~0 (_ bv0 32))) (.cse2 (bvsle main_~urilen~0 (_ bv1000000 32))) (.cse3 (bvsgt main_~urilen~0 (_ bv0 32)))) (or (and (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0) .cse0 .cse1 .cse2 .cse3) (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) .cse0 .cse1 (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) .cse2 (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) .cse3))) [2018-11-23 11:33:07,635 INFO L444 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,635 INFO L444 ceAbstractionStarter]: At program point L31-1(line 31) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,636 INFO L448 ceAbstractionStarter]: For program point L23(lines 11 69) no Hoare annotation was computed. [2018-11-23 11:33:07,636 INFO L448 ceAbstractionStarter]: For program point L40(lines 30 66) no Hoare annotation was computed. [2018-11-23 11:33:07,636 INFO L444 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvslt main_~c~0 main_~tokenlen~0) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsle (_ bv0 32) main_~c~0) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,636 INFO L444 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvslt main_~c~0 main_~tokenlen~0) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsle (_ bv0 32) main_~c~0) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,636 INFO L444 ceAbstractionStarter]: At program point L49(line 49) the Hoare annotation is: (and (= main_~c~0 (_ bv0 32)) (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,636 INFO L444 ceAbstractionStarter]: At program point L49-1(line 49) the Hoare annotation is: (and (= main_~c~0 (_ bv0 32)) (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,637 INFO L444 ceAbstractionStarter]: At program point L33-1(lines 32 38) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,637 INFO L444 ceAbstractionStarter]: At program point L33-2(lines 33 38) the Hoare annotation is: (let ((.cse0 (bvsle main_~scheme~0 (_ bv1000000 32))) (.cse1 (bvsge main_~scheme~0 (_ bv0 32))) (.cse2 (bvsle main_~urilen~0 (_ bv1000000 32))) (.cse3 (bvsgt main_~urilen~0 (_ bv0 32)))) (or (and (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0) .cse0 .cse1 .cse2 .cse3) (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) .cse0 .cse1 (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) .cse2 (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) .cse3))) [2018-11-23 11:33:07,637 INFO L444 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvslt main_~c~0 main_~tokenlen~0) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~c~0)) [2018-11-23 11:33:07,637 INFO L444 ceAbstractionStarter]: At program point L42(line 42) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,637 INFO L444 ceAbstractionStarter]: At program point L42-1(line 42) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,637 INFO L444 ceAbstractionStarter]: At program point L67(lines 11 69) the Hoare annotation is: (bvsle main_~urilen~0 (_ bv1000000 32)) [2018-11-23 11:33:07,637 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-23 11:33:07,638 INFO L444 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvslt main_~c~0 main_~tokenlen~0) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~c~0)) [2018-11-23 11:33:07,638 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-23 11:33:07,638 INFO L444 ceAbstractionStarter]: At program point L51-1(lines 50 63) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvslt main_~c~0 main_~tokenlen~0) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (bvsgt main_~urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) main_~c~0)) [2018-11-23 11:33:07,638 INFO L448 ceAbstractionStarter]: For program point L43(lines 30 66) no Hoare annotation was computed. [2018-11-23 11:33:07,638 INFO L444 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,638 INFO L444 ceAbstractionStarter]: At program point L35-1(line 35) the Hoare annotation is: (and (bvsge main_~cp~0 (_ bv0 32)) (bvsgt main_~tokenlen~0 (_ bv0 32)) (bvsle main_~scheme~0 (_ bv1000000 32)) (bvsge main_~scheme~0 (_ bv0 32)) (not (bvslt (bvadd main_~urilen~0 (_ bv4294967295 32)) main_~cp~0)) (bvsle main_~urilen~0 (_ bv1000000 32)) (bvsle main_~tokenlen~0 (_ bv1000000 32)) (bvsle (_ bv0 32) (bvadd main_~cp~0 (_ bv4294967295 32))) (not (= (bvadd main_~cp~0 (_ bv1 32)) main_~urilen~0)) (bvsgt main_~urilen~0 (_ bv0 32))) [2018-11-23 11:33:07,638 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 11:33:07,638 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 11:33:07,638 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:33:07,638 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 11:33:07,639 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 11:33:07,639 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 11:33:07,640 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:33:07,640 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 11:33:07,641 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,642 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 11:33:07,643 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 11:33:07,644 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 11:33:07,644 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 11:33:07,644 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2018-11-23 11:33:07,645 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 11:33:07,645 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 11:33:07,645 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2018-11-23 11:33:07,645 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-23 11:33:07,645 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-23 11:33:07,645 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 11:33:07,660 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2018-11-23 11:33:07,661 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-23 11:33:07,661 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-23 11:33:07,661 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 11:33:07,661 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 11:33:07,661 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 11:33:07,661 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2018-11-23 11:33:07,661 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 11:33:07,675 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 [2018-11-23 11:33:07,676 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 [2018-11-23 11:33:07,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:33:07 BoogieIcfgContainer [2018-11-23 11:33:07,679 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 11:33:07,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 11:33:07,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 11:33:07,679 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 11:33:07,680 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:30" (3/4) ... [2018-11-23 11:33:07,684 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 11:33:07,692 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 11:33:07,692 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 11:33:07,692 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 11:33:07,698 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-23 11:33:07,698 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 11:33:07,698 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 11:33:07,777 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-invgen/apache-escape-absolute_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 11:33:07,777 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 11:33:07,781 INFO L168 Benchmark]: Toolchain (without parser) took 38788.98 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -545.9 MB). Peak memory consumption was 516.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:33:07,782 INFO L168 Benchmark]: CDTParser took 0.30 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 11:33:07,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.15 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 11:33:07,783 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.81 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 11:33:07,783 INFO L168 Benchmark]: Boogie Preprocessor took 68.11 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 11:33:07,783 INFO L168 Benchmark]: RCFGBuilder took 1162.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:33:07,784 INFO L168 Benchmark]: TraceAbstraction took 37018.44 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 325.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 220.5 MB). Peak memory consumption was 546.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:33:07,784 INFO L168 Benchmark]: Witness Printer took 98.02 ms. Allocated memory is still 2.6 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:33:07,789 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.30 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 406.15 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 27.81 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 68.11 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 1162.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -777.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37018.44 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 325.6 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 220.5 MB). Peak memory consumption was 546.1 MB. Max. memory is 7.1 GB. * Witness Printer took 98.02 ms. Allocated memory is still 2.6 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((((~bvsge32(cp, 0bv32) && ~bvsle32(scheme, 1000000bv32)) && ~bvslt32(c, tokenlen)) && ~bvsge32(scheme, 0bv32)) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsle32(urilen, 1000000bv32)) && ~bvsle32(tokenlen, 1000000bv32)) && ~bvsle32(0bv32, ~bvadd64(cp, 4294967295bv32))) && ~bvsgt32(urilen, 0bv32)) && ~bvsle32(0bv32, c) - InvariantResult [Line: 11]: Loop Invariant [2018-11-23 11:33:07,797 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 [2018-11-23 11:33:07,797 WARN L1272 BoogieBacktranslator]: Unfinished Backtranslation cannot identify Boogie2SMT function ~bvsle32 Derived loop invariant: NULL - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (((((((~bvsge32(cp, 0bv32) && ~bvsgt32(tokenlen, 0bv32)) && ~bvsle32(scheme, 1000000bv32)) && ~bvsge32(scheme, 0bv32)) && !~bvslt32(~bvadd64(urilen, 4294967295bv32), cp)) && ~bvsle32(urilen, 1000000bv32)) && ~bvsle32(tokenlen, 1000000bv32)) && ~bvsle32(0bv32, ~bvadd64(cp, 4294967295bv32))) && ~bvsgt32(urilen, 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 51 locations, 1 error locations. SAFE Result, 36.9s OverallTime, 7 OverallIterations, 26 TraceHistogramMax, 24.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 489 SDtfs, 396 SDslu, 1941 SDs, 0 SdLazy, 1209 SolverSat, 486 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 830 GetRequests, 743 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 7 MinimizatonAttempts, 39 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 118 PreInvPairs, 196 NumberOfFragments, 820 HoareAnnotationTreeSize, 118 FomulaSimplifications, 10886 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 26 FomulaSimplificationsInter, 3598 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 804 ConstructedInterpolants, 0 QuantifiedInterpolants, 208065 SizeOfPredicates, 22 NumberOfNonLiveVariables, 754 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 4235/4354 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...