/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 22:27:26,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 22:27:26,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 22:27:26,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 22:27:26,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 22:27:26,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 22:27:26,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 22:27:26,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 22:27:26,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 22:27:26,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 22:27:26,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 22:27:26,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 22:27:26,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 22:27:26,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 22:27:26,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 22:27:26,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 22:27:26,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 22:27:26,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 22:27:26,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 22:27:26,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 22:27:26,953 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 22:27:26,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 22:27:26,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 22:27:26,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 22:27:26,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 22:27:26,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 22:27:26,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 22:27:26,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 22:27:26,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 22:27:26,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 22:27:26,968 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 22:27:26,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 22:27:26,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 22:27:26,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 22:27:26,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 22:27:26,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 22:27:26,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 22:27:26,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 22:27:26,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 22:27:26,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 22:27:26,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 22:27:26,976 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 22:27:26,976 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-07 22:27:26,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 22:27:26,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 22:27:26,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 22:27:26,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 22:27:26,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 22:27:26,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 22:27:26,995 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 22:27:26,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 22:27:26,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 22:27:26,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 22:27:26,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 22:27:26,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 22:27:26,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 22:27:26,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 22:27:26,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 22:27:26,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 22:27:26,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 22:27:26,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 22:27:26,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 22:27:26,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:27:26,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 22:27:26,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 22:27:26,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 22:27:26,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 22:27:26,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 22:27:26,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 22:27:26,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-07 22:27:27,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-07 22:27:27,000 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 22:27:27,001 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 22:27:27,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 22:27:27,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 22:27:27,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 22:27:27,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 22:27:27,175 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 22:27:27,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-04-07 22:27:27,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e3da410/6a21477770dd47309aa0f4fba23de878/FLAGc13a09bf9 [2022-04-07 22:27:27,549 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 22:27:27,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-04-07 22:27:27,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e3da410/6a21477770dd47309aa0f4fba23de878/FLAGc13a09bf9 [2022-04-07 22:27:27,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48e3da410/6a21477770dd47309aa0f4fba23de878 [2022-04-07 22:27:27,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 22:27:27,996 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 22:27:27,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 22:27:27,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 22:27:28,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 22:27:28,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:27:27" (1/1) ... [2022-04-07 22:27:28,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6b1a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28, skipping insertion in model container [2022-04-07 22:27:28,003 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 10:27:27" (1/1) ... [2022-04-07 22:27:28,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 22:27:28,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 22:27:28,141 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2022-04-07 22:27:28,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:27:28,160 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 22:27:28,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2022-04-07 22:27:28,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 22:27:28,184 INFO L208 MainTranslator]: Completed translation [2022-04-07 22:27:28,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28 WrapperNode [2022-04-07 22:27:28,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 22:27:28,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 22:27:28,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 22:27:28,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 22:27:28,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28" (1/1) ... [2022-04-07 22:27:28,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28" (1/1) ... [2022-04-07 22:27:28,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28" (1/1) ... [2022-04-07 22:27:28,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28" (1/1) ... [2022-04-07 22:27:28,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28" (1/1) ... [2022-04-07 22:27:28,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28" (1/1) ... [2022-04-07 22:27:28,204 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28" (1/1) ... [2022-04-07 22:27:28,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 22:27:28,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 22:27:28,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 22:27:28,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 22:27:28,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28" (1/1) ... [2022-04-07 22:27:28,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 22:27:28,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 22:27:28,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 22:27:28,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 22:27:28,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 22:27:28,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 22:27:28,276 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 22:27:28,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 22:27:28,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 22:27:28,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 22:27:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 22:27:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 22:27:28,276 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 22:27:28,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 22:27:28,321 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 22:27:28,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 22:27:28,550 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 22:27:28,555 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 22:27:28,555 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 22:27:28,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:27:28 BoogieIcfgContainer [2022-04-07 22:27:28,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 22:27:28,557 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 22:27:28,557 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 22:27:28,559 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 22:27:28,561 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:27:28" (1/1) ... [2022-04-07 22:27:28,563 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-07 22:27:28,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:27:28 BasicIcfg [2022-04-07 22:27:28,611 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 22:27:28,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 22:27:28,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 22:27:28,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 22:27:28,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 10:27:27" (1/4) ... [2022-04-07 22:27:28,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7c1180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:27:28, skipping insertion in model container [2022-04-07 22:27:28,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 10:27:28" (2/4) ... [2022-04-07 22:27:28,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7c1180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 10:27:28, skipping insertion in model container [2022-04-07 22:27:28,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 10:27:28" (3/4) ... [2022-04-07 22:27:28,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7c1180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:27:28, skipping insertion in model container [2022-04-07 22:27:28,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 10:27:28" (4/4) ... [2022-04-07 22:27:28,617 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.iqvasr [2022-04-07 22:27:28,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 22:27:28,621 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 22:27:28,657 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 22:27:28,662 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 22:27:28,662 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 22:27:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-07 22:27:28,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-07 22:27:28,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:27:28,678 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:27:28,678 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:27:28,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:27:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash -505878006, now seen corresponding path program 1 times [2022-04-07 22:27:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:27:28,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678882351] [2022-04-07 22:27:28,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:27:28,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:27:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:27:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:28,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {57#true} is VALID [2022-04-07 22:27:28,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:27:28,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {57#true} is VALID [2022-04-07 22:27:28,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {57#true} is VALID [2022-04-07 22:27:28,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {57#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {57#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {57#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-07 22:27:28,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {57#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {62#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2022-04-07 22:27:28,892 INFO L272 TraceCheckUtils]: 13: Hoare triple {62#(<= (+ main_~cp~0 1) main_~urilen~0)} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {63#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:27:28,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {63#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {64#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:27:28,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {64#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {58#false} is VALID [2022-04-07 22:27:28,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {58#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58#false} is VALID [2022-04-07 22:27:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:27:28,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:27:28,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678882351] [2022-04-07 22:27:28,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678882351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:27:28,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:27:28,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 22:27:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95112314] [2022-04-07 22:27:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:27:28,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 22:27:28,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:27:28,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:27:28,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:28,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 22:27:28,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:27:28,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 22:27:28,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 22:27:28,955 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:27:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:29,764 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2022-04-07 22:27:29,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 22:27:29,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-07 22:27:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:27:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:27:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-07 22:27:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:27:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-07 22:27:29,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 207 transitions. [2022-04-07 22:27:29,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:29,960 INFO L225 Difference]: With dead ends: 112 [2022-04-07 22:27:29,961 INFO L226 Difference]: Without dead ends: 64 [2022-04-07 22:27:29,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-07 22:27:29,965 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 22:27:29,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 82 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 22:27:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-07 22:27:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-04-07 22:27:29,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:27:29,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:29,999 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:30,000 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:30,006 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-07 22:27:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-07 22:27:30,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:30,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:30,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 64 states. [2022-04-07 22:27:30,009 INFO L87 Difference]: Start difference. First operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 64 states. [2022-04-07 22:27:30,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:30,013 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-07 22:27:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-07 22:27:30,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:30,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:30,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:27:30,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:27:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:30,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-04-07 22:27:30,020 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2022-04-07 22:27:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:27:30,020 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-04-07 22:27:30,020 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-07 22:27:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-04-07 22:27:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 22:27:30,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:27:30,021 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 22:27:30,021 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 22:27:30,021 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:27:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:27:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash 722598363, now seen corresponding path program 1 times [2022-04-07 22:27:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:27:30,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274766859] [2022-04-07 22:27:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:27:30,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:27:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:27:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-07 22:27:30,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 22:27:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {458#true} is VALID [2022-04-07 22:27:30,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {464#(<= 1 main_~cp~0)} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {464#(<= 1 main_~cp~0)} is VALID [2022-04-07 22:27:30,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:27:30,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {458#true} is VALID [2022-04-07 22:27:30,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {458#true} is VALID [2022-04-07 22:27:30,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {463#(< 0 (+ main_~scheme~0 1))} is VALID [2022-04-07 22:27:30,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {463#(< 0 (+ main_~scheme~0 1))} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {464#(<= 1 main_~cp~0)} is VALID [2022-04-07 22:27:30,121 INFO L272 TraceCheckUtils]: 13: Hoare triple {464#(<= 1 main_~cp~0)} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {458#true} is VALID [2022-04-07 22:27:30,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {458#true} is VALID [2022-04-07 22:27:30,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {458#true} is VALID [2022-04-07 22:27:30,122 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {458#true} {464#(<= 1 main_~cp~0)} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {464#(<= 1 main_~cp~0)} is VALID [2022-04-07 22:27:30,123 INFO L272 TraceCheckUtils]: 18: Hoare triple {464#(<= 1 main_~cp~0)} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {469#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:27:30,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {469#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {470#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:27:30,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {470#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-07 22:27:30,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {459#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-07 22:27:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 22:27:30,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:27:30,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274766859] [2022-04-07 22:27:30,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274766859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:27:30,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:27:30,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 22:27:30,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132706897] [2022-04-07 22:27:30,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:27:30,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-07 22:27:30,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:27:30,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:27:30,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:30,138 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 22:27:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:27:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 22:27:30,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 22:27:30,139 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:27:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:30,778 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-04-07 22:27:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 22:27:30,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-07 22:27:30,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:27:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:27:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-07 22:27:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:27:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-07 22:27:30,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-07 22:27:30,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:30,844 INFO L225 Difference]: With dead ends: 63 [2022-04-07 22:27:30,844 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 22:27:30,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:27:30,853 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 22:27:30,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 66 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 22:27:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 22:27:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-07 22:27:30,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:27:30,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:30,882 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:30,882 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:30,885 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-07 22:27:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-07 22:27:30,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:30,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:30,886 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-07 22:27:30,887 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-07 22:27:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:30,889 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-07 22:27:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-07 22:27:30,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:30,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:30,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:27:30,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:27:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:30,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-07 22:27:30,892 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2022-04-07 22:27:30,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:27:30,893 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-07 22:27:30,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 22:27:30,893 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-07 22:27:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-07 22:27:30,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:27:30,894 INFO L499 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, 1] [2022-04-07 22:27:30,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 22:27:30,894 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:27:30,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:27:30,895 INFO L85 PathProgramCache]: Analyzing trace with hash 349034817, now seen corresponding path program 1 times [2022-04-07 22:27:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:27:30,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666116820] [2022-04-07 22:27:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:27:30,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:27:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:27:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {790#true} is VALID [2022-04-07 22:27:30,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {790#true} {790#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 22:27:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-07 22:27:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-07 22:27:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-07 22:27:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-07 22:27:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-07 22:27:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-07 22:27:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:30,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-07 22:27:30,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:27:30,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {820#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {790#true} is VALID [2022-04-07 22:27:30,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {790#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {790#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,986 INFO L272 TraceCheckUtils]: 13: Hoare triple {790#true} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,986 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {790#true} {790#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,986 INFO L272 TraceCheckUtils]: 18: Hoare triple {790#true} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,987 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {790#true} {790#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {790#true} [212] L43-->L44: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {790#true} [215] L44-->L45: Formula: (not (= |v_main_#t~nondet4_3| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {790#true} is VALID [2022-04-07 22:27:30,987 INFO L272 TraceCheckUtils]: 25: Hoare triple {790#true} [220] L45-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,988 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {790#true} {790#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,988 INFO L272 TraceCheckUtils]: 30: Hoare triple {790#true} [221] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,988 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {790#true} {790#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {790#true} [223] L47-1-->L47-2: Formula: (= (+ (- 1) v_main_~urilen~0_12) v_main_~cp~0_7) InVars {main_~urilen~0=v_main_~urilen~0_12, main_~cp~0=v_main_~cp~0_7} OutVars{main_~urilen~0=v_main_~urilen~0_12, main_~cp~0=v_main_~cp~0_7} AuxVars[] AssignedVars[] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-07 22:27:30,989 INFO L272 TraceCheckUtils]: 36: Hoare triple {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [243] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,989 INFO L290 TraceCheckUtils]: 38: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,990 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-07 22:27:30,990 INFO L272 TraceCheckUtils]: 41: Hoare triple {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [227] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {790#true} is VALID [2022-04-07 22:27:30,990 INFO L290 TraceCheckUtils]: 42: Hoare triple {790#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {790#true} is VALID [2022-04-07 22:27:30,990 INFO L290 TraceCheckUtils]: 43: Hoare triple {790#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {790#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {790#true} is VALID [2022-04-07 22:27:30,991 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {790#true} {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-07 22:27:30,991 INFO L290 TraceCheckUtils]: 46: Hoare triple {811#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} [229] L54-->L56: Formula: (not (= v_main_~cp~0_16 (+ (- 1) v_main_~urilen~0_17))) InVars {main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} OutVars{main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} AuxVars[] AssignedVars[] {791#false} is VALID [2022-04-07 22:27:30,991 INFO L272 TraceCheckUtils]: 47: Hoare triple {791#false} [246] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {791#false} is VALID [2022-04-07 22:27:30,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {791#false} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {791#false} is VALID [2022-04-07 22:27:30,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {791#false} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {791#false} is VALID [2022-04-07 22:27:30,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {791#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {791#false} is VALID [2022-04-07 22:27:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 22:27:30,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:27:30,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666116820] [2022-04-07 22:27:30,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666116820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:27:30,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:27:30,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 22:27:30,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028653719] [2022-04-07 22:27:30,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:27:30,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2022-04-07 22:27:30,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:27:30,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 22:27:31,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:31,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 22:27:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:27:31,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 22:27:31,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 22:27:31,018 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 22:27:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:31,252 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2022-04-07 22:27:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 22:27:31,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2022-04-07 22:27:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:27:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 22:27:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-07 22:27:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 22:27:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-07 22:27:31,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-07 22:27:31,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:31,337 INFO L225 Difference]: With dead ends: 90 [2022-04-07 22:27:31,337 INFO L226 Difference]: Without dead ends: 61 [2022-04-07 22:27:31,337 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 22:27:31,338 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 22:27:31,338 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 58 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 22:27:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-07 22:27:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-07 22:27:31,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:27:31,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:31,372 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:31,372 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:31,374 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-07 22:27:31,374 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-07 22:27:31,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:31,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:31,375 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-07 22:27:31,376 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-07 22:27:31,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:31,378 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-07 22:27:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-07 22:27:31,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:31,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:31,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:27:31,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:27:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-04-07 22:27:31,381 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2022-04-07 22:27:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:27:31,381 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-04-07 22:27:31,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 22:27:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-07 22:27:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-07 22:27:31,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:27:31,382 INFO L499 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, 1, 1] [2022-04-07 22:27:31,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 22:27:31,382 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:27:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:27:31,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1328286090, now seen corresponding path program 1 times [2022-04-07 22:27:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:27:31,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072390047] [2022-04-07 22:27:31,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:27:31,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:27:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:31,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:27:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:31,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1173#true} is VALID [2022-04-07 22:27:31,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 22:27:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:31,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-07 22:27:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:31,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-07 22:27:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:31,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-07 22:27:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:31,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-07 22:27:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:31,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-07 22:27:31,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-07 22:27:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:31,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-07 22:27:31,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:27:31,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {1173#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {1173#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {1173#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {1173#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {1173#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {1173#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {1173#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,514 INFO L272 TraceCheckUtils]: 13: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-07 22:27:31,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,515 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,515 INFO L272 TraceCheckUtils]: 18: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-07 22:27:31,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,515 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [212] L43-->L44: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [215] L44-->L45: Formula: (not (= |v_main_#t~nondet4_3| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,516 INFO L272 TraceCheckUtils]: 25: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [220] L45-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-07 22:27:31,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,522 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,522 INFO L272 TraceCheckUtils]: 30: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [221] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-07 22:27:31,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,523 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1173#true} {1178#(< main_~cp~0 main_~urilen~0)} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1178#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-07 22:27:31,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {1178#(< main_~cp~0 main_~urilen~0)} [224] L47-1-->L48: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (not (= (+ (- 1) v_main_~urilen~0_13) v_main_~cp~0_8)) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} AuxVars[] AssignedVars[] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-07 22:27:31,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [244] L48-->L47-2: Formula: (not (= |v_main_#t~nondet5_3| 0)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-07 22:27:31,524 INFO L272 TraceCheckUtils]: 37: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [243] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-07 22:27:31,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,524 INFO L290 TraceCheckUtils]: 39: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,524 INFO L290 TraceCheckUtils]: 40: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,524 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-07 22:27:31,525 INFO L272 TraceCheckUtils]: 42: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [227] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1173#true} is VALID [2022-04-07 22:27:31,525 INFO L290 TraceCheckUtils]: 43: Hoare triple {1173#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1173#true} is VALID [2022-04-07 22:27:31,525 INFO L290 TraceCheckUtils]: 44: Hoare triple {1173#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,525 INFO L290 TraceCheckUtils]: 45: Hoare triple {1173#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-07 22:27:31,525 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1173#true} {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-07 22:27:31,526 INFO L290 TraceCheckUtils]: 47: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [229] L54-->L56: Formula: (not (= v_main_~cp~0_16 (+ (- 1) v_main_~urilen~0_17))) InVars {main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} OutVars{main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} AuxVars[] AssignedVars[] {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-07 22:27:31,526 INFO L272 TraceCheckUtils]: 48: Hoare triple {1195#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} [246] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1204#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:27:31,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {1204#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1205#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:27:31,527 INFO L290 TraceCheckUtils]: 50: Hoare triple {1205#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-07 22:27:31,527 INFO L290 TraceCheckUtils]: 51: Hoare triple {1174#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-07 22:27:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-07 22:27:31,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:27:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072390047] [2022-04-07 22:27:31,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072390047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:27:31,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:27:31,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 22:27:31,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518991224] [2022-04-07 22:27:31,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:27:31,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-07 22:27:31,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:27:31,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 22:27:31,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:31,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 22:27:31,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:27:31,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 22:27:31,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 22:27:31,564 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 22:27:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:32,098 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-07 22:27:32,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 22:27:32,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-07 22:27:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:27:32,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 22:27:32,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-07 22:27:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 22:27:32,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-07 22:27:32,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-07 22:27:32,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:32,155 INFO L225 Difference]: With dead ends: 68 [2022-04-07 22:27:32,155 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 22:27:32,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:27:32,156 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 22:27:32,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 59 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 22:27:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 22:27:32,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-07 22:27:32,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:27:32,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:32,202 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:32,202 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:32,204 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-07 22:27:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-07 22:27:32,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:32,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:32,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 66 states. [2022-04-07 22:27:32,205 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 66 states. [2022-04-07 22:27:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:32,207 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-07 22:27:32,207 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-07 22:27:32,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:32,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:32,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:27:32,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:27:32,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:32,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-07 22:27:32,212 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2022-04-07 22:27:32,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:27:32,213 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-07 22:27:32,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-07 22:27:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-07 22:27:32,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-07 22:27:32,214 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:27:32,214 INFO L499 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, 1, 1, 1] [2022-04-07 22:27:32,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 22:27:32,214 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:27:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:27:32,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1785526948, now seen corresponding path program 1 times [2022-04-07 22:27:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:27:32,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733185432] [2022-04-07 22:27:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:27:32,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:27:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:27:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {1605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1548#true} is VALID [2022-04-07 22:27:32,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1548#true} {1548#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 22:27:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-07 22:27:32,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-07 22:27:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-07 22:27:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-07 22:27:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-07 22:27:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-07 22:27:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [265] __VERIFIER_assertEXIT-->L56-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-07 22:27:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [266] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-07 22:27:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [267] __VERIFIER_assertEXIT-->L63-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-07 22:27:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [268] __VERIFIER_assertEXIT-->L65-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-07 22:27:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [269] __VERIFIER_assertEXIT-->L67-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-07 22:27:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-07 22:27:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:32,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [270] __VERIFIER_assertEXIT-->L68: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-07 22:27:32,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {1548#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:27:32,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1605#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1548#true} is VALID [2022-04-07 22:27:32,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {1548#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1548#true} {1548#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {1548#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {1548#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {1548#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {1548#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {1548#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {1548#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {1548#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {1548#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {1548#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L272 TraceCheckUtils]: 13: Hoare triple {1548#true} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1548#true} {1548#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L272 TraceCheckUtils]: 18: Hoare triple {1548#true} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,401 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1548#true} {1548#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {1548#true} [212] L43-->L44: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {1548#true} [215] L44-->L45: Formula: (not (= |v_main_#t~nondet4_3| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L272 TraceCheckUtils]: 25: Hoare triple {1548#true} [220] L45-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1548#true} {1548#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L272 TraceCheckUtils]: 30: Hoare triple {1548#true} [221] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 31: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 32: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1548#true} {1548#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 35: Hoare triple {1548#true} [224] L47-1-->L48: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (not (= (+ (- 1) v_main_~urilen~0_13) v_main_~cp~0_8)) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,402 INFO L290 TraceCheckUtils]: 36: Hoare triple {1548#true} [244] L48-->L47-2: Formula: (not (= |v_main_#t~nondet5_3| 0)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L272 TraceCheckUtils]: 37: Hoare triple {1548#true} [243] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L290 TraceCheckUtils]: 38: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L290 TraceCheckUtils]: 39: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L290 TraceCheckUtils]: 40: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1548#true} {1548#true} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L272 TraceCheckUtils]: 42: Hoare triple {1548#true} [227] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L290 TraceCheckUtils]: 43: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1548#true} {1548#true} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L290 TraceCheckUtils]: 47: Hoare triple {1548#true} [229] L54-->L56: Formula: (not (= v_main_~cp~0_16 (+ (- 1) v_main_~urilen~0_17))) InVars {main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} OutVars{main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L272 TraceCheckUtils]: 48: Hoare triple {1548#true} [246] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1548#true} {1548#true} [265] __VERIFIER_assertEXIT-->L56-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L272 TraceCheckUtils]: 53: Hoare triple {1548#true} [230] L56-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L290 TraceCheckUtils]: 55: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1548#true} {1548#true} [266] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {1548#true} [232] L57-->L61: Formula: (let ((.cse0 (+ v_main_~cp~0_21 1))) (and (<= 0 (+ |v_main_#t~nondet8_1| 2147483648)) (= v_main_~cp~0_20 .cse0) (not (= (+ (- 1) v_main_~urilen~0_20) .cse0)) (<= |v_main_#t~nondet8_1| 2147483647) (= v_main_~scheme~0_10 v_main_~cp~0_20))) InVars {main_~urilen~0=v_main_~urilen~0_20, main_~cp~0=v_main_~cp~0_21, main_#t~nondet8=|v_main_#t~nondet8_1|} OutVars{main_~urilen~0=v_main_~urilen~0_20, main_#t~pre7=|v_main_#t~pre7_1|, main_~scheme~0=v_main_~scheme~0_10, main_~cp~0=v_main_~cp~0_20, main_#t~nondet8=|v_main_#t~nondet8_1|} AuxVars[] AssignedVars[main_#t~pre7, main_~scheme~0, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L290 TraceCheckUtils]: 59: Hoare triple {1548#true} [247] L61-->L63: Formula: (and (= v_main_~c~0_2 0) (not (= |v_main_#t~nondet8_3| 0))) InVars {main_#t~nondet8=|v_main_#t~nondet8_3|} OutVars{main_~c~0=v_main_~c~0_2} AuxVars[] AssignedVars[main_~c~0, main_#t~nondet8] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L272 TraceCheckUtils]: 60: Hoare triple {1548#true} [253] L63-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L290 TraceCheckUtils]: 61: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L290 TraceCheckUtils]: 62: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L290 TraceCheckUtils]: 63: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,404 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1548#true} {1548#true} [267] __VERIFIER_assertEXIT-->L63-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,405 INFO L272 TraceCheckUtils]: 65: Hoare triple {1548#true} [233] L63-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,405 INFO L290 TraceCheckUtils]: 67: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,405 INFO L290 TraceCheckUtils]: 68: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,405 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1548#true} {1548#true} [268] __VERIFIER_assertEXIT-->L65-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {1548#true} [236] L65-1-->L67: Formula: (and (< (+ v_main_~c~0_4 1) v_main_~tokenlen~0_9) (not (= v_main_~cp~0_25 (+ (- 1) v_main_~urilen~0_23)))) InVars {main_~urilen~0=v_main_~urilen~0_23, main_~tokenlen~0=v_main_~tokenlen~0_9, main_~cp~0=v_main_~cp~0_25, main_~c~0=v_main_~c~0_4} OutVars{main_~urilen~0=v_main_~urilen~0_23, main_~tokenlen~0=v_main_~tokenlen~0_9, main_~cp~0=v_main_~cp~0_25, main_~c~0=v_main_~c~0_4} AuxVars[] AssignedVars[] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-07 22:27:32,409 INFO L272 TraceCheckUtils]: 71: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [249] L67-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,409 INFO L290 TraceCheckUtils]: 72: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,409 INFO L290 TraceCheckUtils]: 73: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,409 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [269] __VERIFIER_assertEXIT-->L67-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-07 22:27:32,409 INFO L272 TraceCheckUtils]: 76: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [237] L67-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1548#true} is VALID [2022-04-07 22:27:32,409 INFO L290 TraceCheckUtils]: 77: Hoare triple {1548#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1548#true} is VALID [2022-04-07 22:27:32,410 INFO L290 TraceCheckUtils]: 78: Hoare triple {1548#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,410 INFO L290 TraceCheckUtils]: 79: Hoare triple {1548#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1548#true} is VALID [2022-04-07 22:27:32,410 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1548#true} {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [270] __VERIFIER_assertEXIT-->L68: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-07 22:27:32,410 INFO L290 TraceCheckUtils]: 81: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [238] L68-->L69: Formula: (and (<= |v_main_#t~nondet9_1| 2147483647) (<= 0 (+ |v_main_#t~nondet9_1| 2147483648))) InVars {main_#t~nondet9=|v_main_#t~nondet9_1|} OutVars{main_#t~nondet9=|v_main_#t~nondet9_1|} AuxVars[] AssignedVars[] {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-07 22:27:32,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {1593#(<= (+ main_~c~0 2) main_~tokenlen~0)} [250] L69-->L71: Formula: (and (not (= |v_main_#t~nondet9_3| 0)) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_#t~nondet9=|v_main_#t~nondet9_3|, main_~c~0=v_main_~c~0_6} OutVars{main_#t~pre10=|v_main_#t~pre10_1|, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[main_#t~pre10, main_~c~0, main_#t~nondet9] {1602#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2022-04-07 22:27:32,411 INFO L272 TraceCheckUtils]: 83: Hoare triple {1602#(<= (+ main_~c~0 1) main_~tokenlen~0)} [254] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_15| (ite (< v_main_~c~0_9 v_main_~tokenlen~0_11) 1 0)) InVars {main_~tokenlen~0=v_main_~tokenlen~0_11, main_~c~0=v_main_~c~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[main_~tokenlen~0, __VERIFIER_assert_#in~cond, main_~c~0] {1603#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:27:32,412 INFO L290 TraceCheckUtils]: 84: Hoare triple {1603#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1604#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:27:32,412 INFO L290 TraceCheckUtils]: 85: Hoare triple {1604#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1549#false} is VALID [2022-04-07 22:27:32,412 INFO L290 TraceCheckUtils]: 86: Hoare triple {1549#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1549#false} is VALID [2022-04-07 22:27:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-07 22:27:32,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:27:32,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733185432] [2022-04-07 22:27:32,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733185432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:27:32,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:27:32,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 22:27:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293925018] [2022-04-07 22:27:32,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:27:32,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-07 22:27:32,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:27:32,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-07 22:27:32,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:32,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 22:27:32,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:27:32,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 22:27:32,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-07 22:27:32,445 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-07 22:27:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:32,932 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-07 22:27:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 22:27:32,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-07 22:27:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:27:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-07 22:27:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-07 22:27:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-07 22:27:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-07 22:27:32,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2022-04-07 22:27:33,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:33,005 INFO L225 Difference]: With dead ends: 74 [2022-04-07 22:27:33,005 INFO L226 Difference]: Without dead ends: 72 [2022-04-07 22:27:33,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:27:33,006 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 22:27:33,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 67 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 22:27:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-07 22:27:33,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-04-07 22:27:33,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:27:33,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:33,051 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:33,051 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:33,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:33,055 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-07 22:27:33,055 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-07 22:27:33,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:33,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:33,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 72 states. [2022-04-07 22:27:33,055 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 72 states. [2022-04-07 22:27:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:33,057 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-07 22:27:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-07 22:27:33,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:33,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:33,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:27:33,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:27:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-07 22:27:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-04-07 22:27:33,060 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2022-04-07 22:27:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:27:33,060 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-04-07 22:27:33,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-07 22:27:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-07 22:27:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-07 22:27:33,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 22:27:33,061 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 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, 1, 1, 1, 1] [2022-04-07 22:27:33,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 22:27:33,061 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 22:27:33,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 22:27:33,061 INFO L85 PathProgramCache]: Analyzing trace with hash 874819922, now seen corresponding path program 1 times [2022-04-07 22:27:33,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 22:27:33,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208787535] [2022-04-07 22:27:33,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 22:27:33,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 22:27:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 22:27:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1971#true} is VALID [2022-04-07 22:27:33,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,125 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1971#true} {1971#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-07 22:27:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-07 22:27:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-07 22:27:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-07 22:27:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-07 22:27:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-07 22:27:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-07 22:27:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [265] __VERIFIER_assertEXIT-->L56-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-07 22:27:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [266] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-07 22:27:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [267] __VERIFIER_assertEXIT-->L63-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-07 22:27:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [268] __VERIFIER_assertEXIT-->L65-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-07 22:27:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [269] __VERIFIER_assertEXIT-->L67-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-07 22:27:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [270] __VERIFIER_assertEXIT-->L68: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-04-07 22:27:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 22:27:33,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {2025#(<= 1 main_~c~0)} [271] __VERIFIER_assertEXIT-->L71-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_15| (ite (< v_main_~c~0_9 v_main_~tokenlen~0_11) 1 0)) InVars {main_~tokenlen~0=v_main_~tokenlen~0_11, main_~c~0=v_main_~c~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[main_~tokenlen~0, __VERIFIER_assert_#in~cond, main_~c~0] {2025#(<= 1 main_~c~0)} is VALID [2022-04-07 22:27:33,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {1971#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 22:27:33,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {2032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [189] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1971#true} is VALID [2022-04-07 22:27:33,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1971#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1971#true} {1971#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {1971#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {1971#true} [191] mainENTRY-->L32: Formula: (and (= |v_main_#t~nondet1_2| v_main_~urilen~0_1) (<= |v_main_#t~nondet3_2| 2147483647) (<= |v_main_#t~nondet1_2| 2147483647) (= |v_main_#t~nondet2_2| v_main_~tokenlen~0_1) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (= v_main_~scheme~0_1 |v_main_#t~nondet3_2|) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_1, main_~urilen~0=v_main_~urilen~0_1, main_~scheme~0=v_main_~scheme~0_1, main_~c~0=v_main_~c~0_1, main_~cp~0=v_main_~cp~0_1} AuxVars[] AssignedVars[main_~tokenlen~0, main_~urilen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~scheme~0, main_~c~0, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {1971#true} [194] L32-->L33: Formula: (and (<= v_main_~urilen~0_5 1000000) (<= 0 (+ 1000000 v_main_~urilen~0_5))) InVars {main_~urilen~0=v_main_~urilen~0_5} OutVars{main_~urilen~0=v_main_~urilen~0_5} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {1971#true} [197] L33-->L34: Formula: (and (<= v_main_~tokenlen~0_5 1000000) (<= 0 (+ v_main_~tokenlen~0_5 1000000))) InVars {main_~tokenlen~0=v_main_~tokenlen~0_5} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_5} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {1971#true} [199] L34-->L35: Formula: (and (<= 0 (+ v_main_~scheme~0_5 1000000)) (<= v_main_~scheme~0_5 1000000)) InVars {main_~scheme~0=v_main_~scheme~0_5} OutVars{main_~scheme~0=v_main_~scheme~0_5} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {1971#true} [200] L35-->L35-1: Formula: (< 0 v_main_~urilen~0_6) InVars {main_~urilen~0=v_main_~urilen~0_6} OutVars{main_~urilen~0=v_main_~urilen~0_6} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {1971#true} [202] L35-1-->L36: Formula: (< 0 v_main_~tokenlen~0_6) InVars {main_~tokenlen~0=v_main_~tokenlen~0_6} OutVars{main_~tokenlen~0=v_main_~tokenlen~0_6} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {1971#true} [205] L36-->L37: Formula: (<= 0 v_main_~scheme~0_6) InVars {main_~scheme~0=v_main_~scheme~0_6} OutVars{main_~scheme~0=v_main_~scheme~0_6} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {1971#true} [208] L37-->L42: Formula: (and (not (< v_main_~urilen~0_9 (+ v_main_~scheme~0_9 1))) (not (= v_main_~scheme~0_9 0)) (= v_main_~scheme~0_9 v_main_~cp~0_2)) InVars {main_~urilen~0=v_main_~urilen~0_9, main_~scheme~0=v_main_~scheme~0_9} OutVars{main_~urilen~0=v_main_~urilen~0_9, main_~cp~0=v_main_~cp~0_2, main_~scheme~0=v_main_~scheme~0_9} AuxVars[] AssignedVars[main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L272 TraceCheckUtils]: 13: Hoare triple {1971#true} [209] L42-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1971#true} {1971#true} [257] __VERIFIER_assertEXIT-->L42-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< v_main_~cp~0_32 (+ v_main_~urilen~0_26 1)) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_26, main_~cp~0=v_main_~cp~0_32} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L272 TraceCheckUtils]: 18: Hoare triple {1971#true} [210] L42-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L290 TraceCheckUtils]: 19: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L290 TraceCheckUtils]: 21: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1971#true} {1971#true} [258] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~cp~0_33) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~cp~0=v_main_~cp~0_33} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {1971#true} [212] L43-->L44: Formula: (and (<= |v_main_#t~nondet4_1| 2147483647) (<= 0 (+ |v_main_#t~nondet4_1| 2147483648))) InVars {main_#t~nondet4=|v_main_#t~nondet4_1|} OutVars{main_#t~nondet4=|v_main_#t~nondet4_1|} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {1971#true} [215] L44-->L45: Formula: (not (= |v_main_#t~nondet4_3| 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet4] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L272 TraceCheckUtils]: 25: Hoare triple {1971#true} [220] L45-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1971#true} {1971#true} [259] __VERIFIER_assertEXIT-->L45-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~cp~0_34 v_main_~urilen~0_27) 1 0)) InVars {main_~urilen~0=v_main_~urilen~0_27, main_~cp~0=v_main_~cp~0_34} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L272 TraceCheckUtils]: 30: Hoare triple {1971#true} [221] L45-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1971#true} {1971#true} [260] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~cp~0_35) 1 0)) InVars {main_~cp~0=v_main_~cp~0_35} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 35: Hoare triple {1971#true} [224] L47-1-->L48: Formula: (and (<= |v_main_#t~nondet5_1| 2147483647) (not (= (+ (- 1) v_main_~urilen~0_13) v_main_~cp~0_8)) (<= 0 (+ |v_main_#t~nondet5_1| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} OutVars{main_#t~nondet5=|v_main_#t~nondet5_1|, main_~urilen~0=v_main_~urilen~0_13, main_~cp~0=v_main_~cp~0_8} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 36: Hoare triple {1971#true} [244] L48-->L47-2: Formula: (not (= |v_main_#t~nondet5_3| 0)) InVars {main_#t~nondet5=|v_main_#t~nondet5_3|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet5] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L272 TraceCheckUtils]: 37: Hoare triple {1971#true} [243] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 38: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1971#true} {1971#true} [263] __VERIFIER_assertEXIT-->L53: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_38 v_main_~urilen~0_29) 1 0) |v___VERIFIER_assert_#in~condInParam_7|) InVars {main_~urilen~0=v_main_~urilen~0_29, main_~cp~0=v_main_~cp~0_38} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L272 TraceCheckUtils]: 42: Hoare triple {1971#true} [227] L53-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 43: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,168 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1971#true} {1971#true} [264] __VERIFIER_assertEXIT-->L54: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~cp~0_39) 1 0)) InVars {main_~cp~0=v_main_~cp~0_39} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {1971#true} [229] L54-->L56: Formula: (not (= v_main_~cp~0_16 (+ (- 1) v_main_~urilen~0_17))) InVars {main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} OutVars{main_~urilen~0=v_main_~urilen~0_17, main_~cp~0=v_main_~cp~0_16} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L272 TraceCheckUtils]: 48: Hoare triple {1971#true} [246] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L290 TraceCheckUtils]: 49: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L290 TraceCheckUtils]: 50: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1971#true} {1971#true} [265] __VERIFIER_assertEXIT-->L56-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< (+ v_main_~cp~0_40 1) v_main_~urilen~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~urilen~0=v_main_~urilen~0_30, main_~cp~0=v_main_~cp~0_40} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L272 TraceCheckUtils]: 53: Hoare triple {1971#true} [230] L56-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L290 TraceCheckUtils]: 55: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L290 TraceCheckUtils]: 56: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1971#true} {1971#true} [266] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 (+ v_main_~cp~0_41 1)) 1 0)) InVars {main_~cp~0=v_main_~cp~0_41} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,169 INFO L290 TraceCheckUtils]: 58: Hoare triple {1971#true} [232] L57-->L61: Formula: (let ((.cse0 (+ v_main_~cp~0_21 1))) (and (<= 0 (+ |v_main_#t~nondet8_1| 2147483648)) (= v_main_~cp~0_20 .cse0) (not (= (+ (- 1) v_main_~urilen~0_20) .cse0)) (<= |v_main_#t~nondet8_1| 2147483647) (= v_main_~scheme~0_10 v_main_~cp~0_20))) InVars {main_~urilen~0=v_main_~urilen~0_20, main_~cp~0=v_main_~cp~0_21, main_#t~nondet8=|v_main_#t~nondet8_1|} OutVars{main_~urilen~0=v_main_~urilen~0_20, main_#t~pre7=|v_main_#t~pre7_1|, main_~scheme~0=v_main_~scheme~0_10, main_~cp~0=v_main_~cp~0_20, main_#t~nondet8=|v_main_#t~nondet8_1|} AuxVars[] AssignedVars[main_#t~pre7, main_~scheme~0, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,170 INFO L290 TraceCheckUtils]: 59: Hoare triple {1971#true} [247] L61-->L63: Formula: (and (= v_main_~c~0_2 0) (not (= |v_main_#t~nondet8_3| 0))) InVars {main_#t~nondet8=|v_main_#t~nondet8_3|} OutVars{main_~c~0=v_main_~c~0_2} AuxVars[] AssignedVars[main_~c~0, main_#t~nondet8] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,170 INFO L272 TraceCheckUtils]: 60: Hoare triple {2008#(= main_~c~0 0)} [253] L63-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,170 INFO L290 TraceCheckUtils]: 61: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,170 INFO L290 TraceCheckUtils]: 62: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,170 INFO L290 TraceCheckUtils]: 63: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,170 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [267] __VERIFIER_assertEXIT-->L63-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_42 v_main_~urilen~0_31) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~urilen~0=v_main_~urilen~0_31, main_~cp~0=v_main_~cp~0_42} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,170 INFO L272 TraceCheckUtils]: 65: Hoare triple {2008#(= main_~c~0 0)} [233] L63-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,171 INFO L290 TraceCheckUtils]: 66: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,171 INFO L290 TraceCheckUtils]: 67: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,171 INFO L290 TraceCheckUtils]: 68: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,171 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [268] __VERIFIER_assertEXIT-->L65-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_12| (ite (<= 0 v_main_~cp~0_43) 1 0)) InVars {main_~cp~0=v_main_~cp~0_43} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_12|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,171 INFO L290 TraceCheckUtils]: 70: Hoare triple {2008#(= main_~c~0 0)} [236] L65-1-->L67: Formula: (and (< (+ v_main_~c~0_4 1) v_main_~tokenlen~0_9) (not (= v_main_~cp~0_25 (+ (- 1) v_main_~urilen~0_23)))) InVars {main_~urilen~0=v_main_~urilen~0_23, main_~tokenlen~0=v_main_~tokenlen~0_9, main_~cp~0=v_main_~cp~0_25, main_~c~0=v_main_~c~0_4} OutVars{main_~urilen~0=v_main_~urilen~0_23, main_~tokenlen~0=v_main_~tokenlen~0_9, main_~cp~0=v_main_~cp~0_25, main_~c~0=v_main_~c~0_4} AuxVars[] AssignedVars[] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,171 INFO L272 TraceCheckUtils]: 71: Hoare triple {2008#(= main_~c~0 0)} [249] L67-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,172 INFO L290 TraceCheckUtils]: 74: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,172 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [269] __VERIFIER_assertEXIT-->L67-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~cp~0_44 v_main_~urilen~0_32) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~urilen~0=v_main_~urilen~0_32, main_~cp~0=v_main_~cp~0_44} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[main_~urilen~0, __VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,172 INFO L272 TraceCheckUtils]: 76: Hoare triple {2008#(= main_~c~0 0)} [237] L67-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {1971#true} is VALID [2022-04-07 22:27:33,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,172 INFO L290 TraceCheckUtils]: 78: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,172 INFO L290 TraceCheckUtils]: 79: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,173 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1971#true} {2008#(= main_~c~0 0)} [270] __VERIFIER_assertEXIT-->L68: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~cp~0_45) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~cp~0=v_main_~cp~0_45} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~cp~0] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,173 INFO L290 TraceCheckUtils]: 81: Hoare triple {2008#(= main_~c~0 0)} [238] L68-->L69: Formula: (and (<= |v_main_#t~nondet9_1| 2147483647) (<= 0 (+ |v_main_#t~nondet9_1| 2147483648))) InVars {main_#t~nondet9=|v_main_#t~nondet9_1|} OutVars{main_#t~nondet9=|v_main_#t~nondet9_1|} AuxVars[] AssignedVars[] {2008#(= main_~c~0 0)} is VALID [2022-04-07 22:27:33,173 INFO L290 TraceCheckUtils]: 82: Hoare triple {2008#(= main_~c~0 0)} [250] L69-->L71: Formula: (and (not (= |v_main_#t~nondet9_3| 0)) (= (+ v_main_~c~0_6 1) v_main_~c~0_5)) InVars {main_#t~nondet9=|v_main_#t~nondet9_3|, main_~c~0=v_main_~c~0_6} OutVars{main_#t~pre10=|v_main_#t~pre10_1|, main_~c~0=v_main_~c~0_5} AuxVars[] AssignedVars[main_#t~pre10, main_~c~0, main_#t~nondet9] {2025#(<= 1 main_~c~0)} is VALID [2022-04-07 22:27:33,173 INFO L272 TraceCheckUtils]: 83: Hoare triple {2025#(<= 1 main_~c~0)} [254] L71-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_15| (ite (< v_main_~c~0_9 v_main_~tokenlen~0_11) 1 0)) InVars {main_~tokenlen~0=v_main_~tokenlen~0_11, main_~c~0=v_main_~c~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[main_~tokenlen~0, __VERIFIER_assert_#in~cond, main_~c~0] {1971#true} is VALID [2022-04-07 22:27:33,173 INFO L290 TraceCheckUtils]: 84: Hoare triple {1971#true} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1971#true} is VALID [2022-04-07 22:27:33,173 INFO L290 TraceCheckUtils]: 85: Hoare triple {1971#true} [214] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,173 INFO L290 TraceCheckUtils]: 86: Hoare triple {1971#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1971#true} is VALID [2022-04-07 22:27:33,174 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {1971#true} {2025#(<= 1 main_~c~0)} [271] __VERIFIER_assertEXIT-->L71-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_15| (ite (< v_main_~c~0_9 v_main_~tokenlen~0_11) 1 0)) InVars {main_~tokenlen~0=v_main_~tokenlen~0_11, main_~c~0=v_main_~c~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[main_~tokenlen~0, __VERIFIER_assert_#in~cond, main_~c~0] {2025#(<= 1 main_~c~0)} is VALID [2022-04-07 22:27:33,174 INFO L272 TraceCheckUtils]: 88: Hoare triple {2025#(<= 1 main_~c~0)} [239] L71-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~c~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_16|) InVars {main_~c~0=v_main_~c~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_16|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~c~0] {2030#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 22:27:33,175 INFO L290 TraceCheckUtils]: 89: Hoare triple {2030#(not (= |__VERIFIER_assert_#in~cond| 0))} [211] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2031#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 22:27:33,175 INFO L290 TraceCheckUtils]: 90: Hoare triple {2031#(not (= __VERIFIER_assert_~cond 0))} [213] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1972#false} is VALID [2022-04-07 22:27:33,175 INFO L290 TraceCheckUtils]: 91: Hoare triple {1972#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1972#false} is VALID [2022-04-07 22:27:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-07 22:27:33,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 22:27:33,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208787535] [2022-04-07 22:27:33,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208787535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 22:27:33,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 22:27:33,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 22:27:33,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697612928] [2022-04-07 22:27:33,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 22:27:33,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2022-04-07 22:27:33,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 22:27:33,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-07 22:27:33,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:33,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 22:27:33,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 22:27:33,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 22:27:33,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 22:27:33,208 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-07 22:27:33,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:33,821 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-07 22:27:33,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-07 22:27:33,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2022-04-07 22:27:33,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 22:27:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-07 22:27:33,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-07 22:27:33,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-07 22:27:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-07 22:27:33,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-07 22:27:33,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 22:27:33,884 INFO L225 Difference]: With dead ends: 75 [2022-04-07 22:27:33,884 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 22:27:33,885 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-07 22:27:33,885 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 22:27:33,886 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 22:27:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 22:27:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 22:27:33,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 22:27:33,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:27:33,886 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:27:33,886 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:27:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:33,886 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:27:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:27:33,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:33,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:33,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:27:33,887 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 22:27:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 22:27:33,887 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 22:27:33,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:27:33,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:33,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 22:27:33,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 22:27:33,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 22:27:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 22:27:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 22:27:33,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2022-04-07 22:27:33,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 22:27:33,887 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 22:27:33,888 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-07 22:27:33,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 22:27:33,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 22:27:33,889 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 22:27:33,895 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 22:27:33,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 22:27:34,193 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-07 22:27:34,193 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:27:34,193 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:27:34,193 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 22:27:34,194 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 83) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 83) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L885 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,194 INFO L878 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-04-07 22:27:34,194 INFO L882 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,195 INFO L882 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,195 INFO L882 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,195 INFO L882 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (<= 1 main_~cp~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2) (and .cse0 (<= 1 main_~c~0) .cse1 .cse2))) [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-07 22:27:34,195 INFO L882 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,195 INFO L878 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,196 INFO L878 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,196 INFO L882 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2022-04-07 22:27:34,196 INFO L878 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,196 INFO L882 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-07 22:27:34,196 INFO L878 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,196 INFO L882 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2022-04-07 22:27:34,196 INFO L878 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-07 22:27:34,196 INFO L882 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-04-07 22:27:34,196 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,196 INFO L878 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,196 INFO L878 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-07 22:27:34,196 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-07 22:27:34,196 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-07 22:27:34,196 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-07 22:27:34,196 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-07 22:27:34,196 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-07 22:27:34,197 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-07 22:27:34,199 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-07 22:27:34,199 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-07 22:27:34,202 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 22:27:34,203 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-07 22:27:34,204 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-07 22:27:34,205 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 22:27:34,206 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-07 22:27:34,206 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-07 22:27:34,206 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-04-07 22:27:34,206 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-07 22:27:34,206 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-04-07 22:27:34,207 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-07 22:27:34,207 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2022-04-07 22:27:34,207 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 22:27:34,207 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-07 22:27:34,207 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-07 22:27:34,207 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-07 22:27:34,207 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-07 22:27:34,207 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 22:27:34,207 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-07 22:27:34,208 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-07 22:27:34,208 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-07 22:27:34,208 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-07 22:27:34,208 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-04-07 22:27:34,208 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 22:27:34,208 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-07 22:27:34,208 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 22:27:34,208 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-07 22:27:34,208 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. [2022-04-07 22:27:34,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 10:27:34 BasicIcfg [2022-04-07 22:27:34,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 22:27:34,217 INFO L158 Benchmark]: Toolchain (without parser) took 6220.54ms. Allocated memory was 187.7MB in the beginning and 245.4MB in the end (delta: 57.7MB). Free memory was 135.6MB in the beginning and 145.1MB in the end (delta: -9.5MB). Peak memory consumption was 49.7MB. Max. memory is 8.0GB. [2022-04-07 22:27:34,217 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 22:27:34,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.27ms. Allocated memory is still 187.7MB. Free memory was 135.5MB in the beginning and 161.4MB in the end (delta: -25.9MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. [2022-04-07 22:27:34,217 INFO L158 Benchmark]: Boogie Preprocessor took 20.93ms. Allocated memory is still 187.7MB. Free memory was 161.4MB in the beginning and 159.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 22:27:34,217 INFO L158 Benchmark]: RCFGBuilder took 350.36ms. Allocated memory is still 187.7MB. Free memory was 159.7MB in the beginning and 143.3MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-07 22:27:34,217 INFO L158 Benchmark]: IcfgTransformer took 54.26ms. Allocated memory is still 187.7MB. Free memory was 143.3MB in the beginning and 140.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-07 22:27:34,218 INFO L158 Benchmark]: TraceAbstraction took 5603.42ms. Allocated memory was 187.7MB in the beginning and 245.4MB in the end (delta: 57.7MB). Free memory was 139.8MB in the beginning and 145.1MB in the end (delta: -5.3MB). Peak memory consumption was 53.2MB. Max. memory is 8.0GB. [2022-04-07 22:27:34,218 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.27ms. Allocated memory is still 187.7MB. Free memory was 135.5MB in the beginning and 161.4MB in the end (delta: -25.9MB). Peak memory consumption was 9.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.93ms. Allocated memory is still 187.7MB. Free memory was 161.4MB in the beginning and 159.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 350.36ms. Allocated memory is still 187.7MB. Free memory was 159.7MB in the beginning and 143.3MB in the end (delta: 16.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * IcfgTransformer took 54.26ms. Allocated memory is still 187.7MB. Free memory was 143.3MB in the beginning and 140.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5603.42ms. Allocated memory was 187.7MB in the beginning and 245.4MB in the end (delta: 57.7MB). Free memory was 139.8MB in the beginning and 145.1MB in the end (delta: -5.3MB). Peak memory consumption was 53.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 106 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1253 IncrementalHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 300 mSDtfsCounter, 1253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 76 PreInvPairs, 105 NumberOfFragments, 461 HoareAnnotationTreeSize, 76 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 287 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 511 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((0 < scheme + 1 && cp < urilen) && c == 0) && 1 <= cp) || (((0 < scheme + 1 && 1 <= c) && cp < urilen) && 1 <= cp) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && cp + 1 <= urilen) && 1 <= cp RESULT: Ultimate proved your program to be correct! [2022-04-07 22:27:34,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...