/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:14:14,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:14:14,985 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:14:15,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:14:15,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:14:15,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:14:15,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:14:15,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:14:15,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:14:15,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:14:15,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:14:15,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:14:15,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:14:15,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:14:15,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:14:15,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:14:15,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:14:15,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:14:15,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:14:15,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:14:15,048 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:14:15,049 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:14:15,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:14:15,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:14:15,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:14:15,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:14:15,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:14:15,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:14:15,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:14:15,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:14:15,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:14:15,058 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:14:15,059 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:14:15,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:14:15,059 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:14:15,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:14:15,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:14:15,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:14:15,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:14:15,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:14:15,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:14:15,062 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:14:15,063 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:14:15,070 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:14:15,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:14:15,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:14:15,072 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:14:15,072 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:14:15,072 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:14:15,072 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:14:15,072 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:14:15,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:14:15,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:14:15,073 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:14:15,073 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:14:15,073 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:14:15,073 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:14:15,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:14:15,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:14:15,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:14:15,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:14:15,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:14:15,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:14:15,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:14:15,074 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:14:15,074 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-27 16:14:15,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:14:15,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:14:15,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:14:15,268 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:14:15,268 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:14:15,269 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-27 16:14:15,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a9d4cfd/22560790a53b48979119b830e32d00f8/FLAG38a3ceefd [2022-04-27 16:14:15,612 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:14:15,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-04-27 16:14:15,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a9d4cfd/22560790a53b48979119b830e32d00f8/FLAG38a3ceefd [2022-04-27 16:14:16,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a9d4cfd/22560790a53b48979119b830e32d00f8 [2022-04-27 16:14:16,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:14:16,056 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:14:16,057 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:14:16,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:14:16,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:14:16,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@316a187f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16, skipping insertion in model container [2022-04-27 16:14:16,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:14:16,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:14:16,222 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-27 16:14:16,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:14:16,248 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:14:16,258 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-27 16:14:16,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:14:16,280 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:14:16,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16 WrapperNode [2022-04-27 16:14:16,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:14:16,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:14:16,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:14:16,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:14:16,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:14:16,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:14:16,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:14:16,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:14:16,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:14:16,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:14:16,356 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-27 16:14:16,363 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-27 16:14:16,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:14:16,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:14:16,393 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:14:16,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:14:16,393 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:14:16,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:14:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:14:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:14:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:14:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:14:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:14:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:14:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:14:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:14:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:14:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:14:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:14:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:14:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:14:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:14:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:14:16,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:14:16,449 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:14:16,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:14:16,707 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:14:16,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:14:16,712 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:14:16,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:14:16 BoogieIcfgContainer [2022-04-27 16:14:16,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:14:16,714 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:14:16,714 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:14:16,714 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:14:16,724 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:14:16" (1/1) ... [2022-04-27 16:14:16,725 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:14:16,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:14:16 BasicIcfg [2022-04-27 16:14:16,771 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:14:16,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:14:16,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:14:16,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:14:16,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:14:16" (1/4) ... [2022-04-27 16:14:16,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232138d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:14:16, skipping insertion in model container [2022-04-27 16:14:16,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:14:16" (2/4) ... [2022-04-27 16:14:16,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232138d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:14:16, skipping insertion in model container [2022-04-27 16:14:16,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:14:16" (3/4) ... [2022-04-27 16:14:16,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232138d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:14:16, skipping insertion in model container [2022-04-27 16:14:16,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:14:16" (4/4) ... [2022-04-27 16:14:16,783 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.iJordan [2022-04-27 16:14:16,805 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:14:16,805 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:14:16,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:14:16,873 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6453fca8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@21c2d78c [2022-04-27 16:14:16,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:14:16,883 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-27 16:14:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:14:16,890 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:16,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:14:16,891 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:14:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash -505878006, now seen corresponding path program 1 times [2022-04-27 16:14:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:16,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351213615] [2022-04-27 16:14:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:17,179 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-27 16:14:17,179 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-27 16:14:17,179 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-27 16:14:17,183 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-27 16:14:17,183 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-27 16:14:17,184 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-27 16:14:17,184 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-27 16:14:17,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57#true} is VALID [2022-04-27 16:14:17,184 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-27 16:14:17,185 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-27 16:14:17,185 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-27 16:14:17,185 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-27 16:14:17,185 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-27 16:14:17,185 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-27 16:14:17,185 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-27 16:14:17,188 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-27 16:14:17,189 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-27 16:14:17,189 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-27 16:14:17,190 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-27 16:14:17,190 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-27 16:14:17,190 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-27 16:14:17,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:17,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351213615] [2022-04-27 16:14:17,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351213615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:17,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:17,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:17,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583000959] [2022-04-27 16:14:17,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:17,200 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-27 16:14:17,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:17,204 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-27 16:14:17,228 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-27 16:14:17,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:17,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:17,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:17,257 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-27 16:14:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:18,124 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-27 16:14:18,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:14:18,124 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-27 16:14:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:18,126 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-27 16:14:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-04-27 16:14:18,135 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-27 16:14:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-04-27 16:14:18,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 117 transitions. [2022-04-27 16:14:18,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:18,265 INFO L225 Difference]: With dead ends: 72 [2022-04-27 16:14:18,266 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 16:14:18,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:14:18,270 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:18,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 82 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 16:14:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 16:14:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-04-27 16:14:18,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:18,298 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-27 16:14:18,298 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-27 16:14:18,299 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-27 16:14:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:18,307 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-27 16:14:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-27 16:14:18,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:18,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:18,309 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-27 16:14:18,310 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-27 16:14:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:18,322 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-27 16:14:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-27 16:14:18,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:18,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:18,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:18,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:18,325 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-27 16:14:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-04-27 16:14:18,330 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2022-04-27 16:14:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:18,331 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-04-27 16:14:18,331 INFO L496 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-27 16:14:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-04-27 16:14:18,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 16:14:18,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:18,332 INFO L195 NwaCegarLoop]: 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-27 16:14:18,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:14:18,332 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:14:18,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:18,333 INFO L85 PathProgramCache]: Analyzing trace with hash 722598363, now seen corresponding path program 1 times [2022-04-27 16:14:18,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:18,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647150265] [2022-04-27 16:14:18,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:18,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:18,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#(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] {333#true} is VALID [2022-04-27 16:14:18,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-04-27 16:14:18,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {333#true} {333#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-04-27 16:14:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 16:14:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:18,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#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] {333#true} is VALID [2022-04-27 16:14:18,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#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[] {333#true} is VALID [2022-04-27 16:14:18,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {333#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-04-27 16:14:18,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {333#true} {339#(<= 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] {339#(<= 1 main_~cp~0)} is VALID [2022-04-27 16:14:18,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {333#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:18,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#(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] {333#true} is VALID [2022-04-27 16:14:18,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {333#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-04-27 16:14:18,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {333#true} {333#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-04-27 16:14:18,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {333#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-04-27 16:14:18,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {333#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] {333#true} is VALID [2022-04-27 16:14:18,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {333#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[] {333#true} is VALID [2022-04-27 16:14:18,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {333#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[] {333#true} is VALID [2022-04-27 16:14:18,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#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[] {333#true} is VALID [2022-04-27 16:14:18,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {333#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[] {333#true} is VALID [2022-04-27 16:14:18,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {333#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[] {333#true} is VALID [2022-04-27 16:14:18,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {333#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[] {338#(< 0 (+ main_~scheme~0 1))} is VALID [2022-04-27 16:14:18,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {338#(< 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] {339#(<= 1 main_~cp~0)} is VALID [2022-04-27 16:14:18,421 INFO L272 TraceCheckUtils]: 13: Hoare triple {339#(<= 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] {333#true} is VALID [2022-04-27 16:14:18,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {333#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] {333#true} is VALID [2022-04-27 16:14:18,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {333#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[] {333#true} is VALID [2022-04-27 16:14:18,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {333#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {333#true} is VALID [2022-04-27 16:14:18,422 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {333#true} {339#(<= 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] {339#(<= 1 main_~cp~0)} is VALID [2022-04-27 16:14:18,423 INFO L272 TraceCheckUtils]: 18: Hoare triple {339#(<= 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] {344#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:14:18,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {344#(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] {345#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:14:18,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {345#(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[] {334#false} is VALID [2022-04-27 16:14:18,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {334#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {334#false} is VALID [2022-04-27 16:14:18,424 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-27 16:14:18,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:18,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647150265] [2022-04-27 16:14:18,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647150265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:18,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:18,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:14:18,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547244733] [2022-04-27 16:14:18,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:18,426 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-27 16:14:18,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:18,427 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-27 16:14:18,442 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-27 16:14:18,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:14:18,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:18,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:14:18,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:14:18,443 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-27 16:14:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:19,153 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-27 16:14:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:14:19,153 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-27 16:14:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:19,154 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-27 16:14:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-27 16:14:19,157 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-27 16:14:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-27 16:14:19,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2022-04-27 16:14:19,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:19,243 INFO L225 Difference]: With dead ends: 61 [2022-04-27 16:14:19,244 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 16:14:19,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:14:19,248 INFO L413 NwaCegarLoop]: 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-27 16:14:19,248 INFO L414 NwaCegarLoop]: 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-27 16:14:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 16:14:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 16:14:19,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:19,263 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-27 16:14:19,264 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-27 16:14:19,265 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-27 16:14:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:19,269 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-27 16:14:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 16:14:19,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:19,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:19,270 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-27 16:14:19,270 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-27 16:14:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:19,273 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-27 16:14:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 16:14:19,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:19,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:19,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:19,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:19,274 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-27 16:14:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-27 16:14:19,277 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2022-04-27 16:14:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:19,277 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-27 16:14:19,277 INFO L496 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-27 16:14:19,277 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-27 16:14:19,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-27 16:14:19,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:19,278 INFO L195 NwaCegarLoop]: 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-27 16:14:19,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:14:19,279 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:14:19,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:19,279 INFO L85 PathProgramCache]: Analyzing trace with hash 349034817, now seen corresponding path program 1 times [2022-04-27 16:14:19,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:19,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430830543] [2022-04-27 16:14:19,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:19,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {633#(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] {603#true} is VALID [2022-04-27 16:14:19,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {603#true} {603#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 16:14:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#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] {603#true} is VALID [2022-04-27 16:14:19,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 16:14:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#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] {603#true} is VALID [2022-04-27 16:14:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 16:14:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#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] {603#true} is VALID [2022-04-27 16:14:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 16:14:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#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] {603#true} is VALID [2022-04-27 16:14:19,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-27 16:14:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {624#(= (+ (- 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] {624#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 16:14:19,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-27 16:14:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {624#(= (+ (- 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] {624#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 16:14:19,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {603#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:19,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {633#(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] {603#true} is VALID [2022-04-27 16:14:19,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {603#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {603#true} {603#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {603#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,367 INFO L272 TraceCheckUtils]: 13: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,368 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {603#true} {603#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] {603#true} is VALID [2022-04-27 16:14:19,368 INFO L272 TraceCheckUtils]: 18: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,369 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {603#true} {603#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] {603#true} is VALID [2022-04-27 16:14:19,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,369 INFO L272 TraceCheckUtils]: 25: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,370 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {603#true} {603#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] {603#true} is VALID [2022-04-27 16:14:19,370 INFO L272 TraceCheckUtils]: 30: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,371 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {603#true} {603#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] {603#true} is VALID [2022-04-27 16:14:19,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {603#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[] {624#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 16:14:19,372 INFO L272 TraceCheckUtils]: 36: Hoare triple {624#(= (+ (- 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] {603#true} is VALID [2022-04-27 16:14:19,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,373 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {603#true} {624#(= (+ (- 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] {624#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 16:14:19,373 INFO L272 TraceCheckUtils]: 41: Hoare triple {624#(= (+ (- 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] {603#true} is VALID [2022-04-27 16:14:19,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {603#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] {603#true} is VALID [2022-04-27 16:14:19,373 INFO L290 TraceCheckUtils]: 43: Hoare triple {603#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[] {603#true} is VALID [2022-04-27 16:14:19,373 INFO L290 TraceCheckUtils]: 44: Hoare triple {603#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#true} is VALID [2022-04-27 16:14:19,374 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {603#true} {624#(= (+ (- 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] {624#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-27 16:14:19,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {624#(= (+ (- 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[] {604#false} is VALID [2022-04-27 16:14:19,375 INFO L272 TraceCheckUtils]: 47: Hoare triple {604#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] {604#false} is VALID [2022-04-27 16:14:19,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {604#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] {604#false} is VALID [2022-04-27 16:14:19,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {604#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[] {604#false} is VALID [2022-04-27 16:14:19,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {604#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {604#false} is VALID [2022-04-27 16:14:19,376 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-27 16:14:19,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:19,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430830543] [2022-04-27 16:14:19,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430830543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:19,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:19,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:14:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270665006] [2022-04-27 16:14:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:19,377 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-27 16:14:19,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:19,378 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-27 16:14:19,402 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-27 16:14:19,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:14:19,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:19,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:14:19,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:14:19,403 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-27 16:14:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:19,684 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2022-04-27 16:14:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:14:19,684 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-27 16:14:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:19,685 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-27 16:14:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-27 16:14:19,687 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-27 16:14:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-04-27 16:14:19,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 74 transitions. [2022-04-27 16:14:19,763 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-27 16:14:19,765 INFO L225 Difference]: With dead ends: 64 [2022-04-27 16:14:19,765 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 16:14:19,765 INFO L412 NwaCegarLoop]: 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-27 16:14:19,766 INFO L413 NwaCegarLoop]: 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-27 16:14:19,766 INFO L414 NwaCegarLoop]: 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-27 16:14:19,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 16:14:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-27 16:14:19,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:19,771 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-27 16:14:19,771 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-27 16:14:19,772 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-27 16:14:19,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:19,775 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-27 16:14:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-27 16:14:19,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:19,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:19,776 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-27 16:14:19,777 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-27 16:14:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:19,779 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-27 16:14:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-27 16:14:19,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:19,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:19,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:19,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:19,781 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-27 16:14:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-04-27 16:14:19,783 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2022-04-27 16:14:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:19,783 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-04-27 16:14:19,784 INFO L496 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-27 16:14:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-27 16:14:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 16:14:19,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:19,785 INFO L195 NwaCegarLoop]: 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-27 16:14:19,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:14:19,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:14:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1328286090, now seen corresponding path program 1 times [2022-04-27 16:14:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:19,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723728459] [2022-04-27 16:14:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {918#(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] {885#true} is VALID [2022-04-27 16:14:19,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {885#true} {885#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 16:14:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {890#(< 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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 16:14:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {890#(< 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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 16:14:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {890#(< 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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 16:14:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {890#(< 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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 16:14:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {907#(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] {907#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 16:14:19,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 16:14:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:19,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {907#(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] {907#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 16:14:19,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {885#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:19,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {918#(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] {885#true} is VALID [2022-04-27 16:14:19,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {885#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {885#true} {885#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {885#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {885#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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,912 INFO L272 TraceCheckUtils]: 13: Hoare triple {890#(< 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] {885#true} is VALID [2022-04-27 16:14:19,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,913 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {885#true} {890#(< 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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,913 INFO L272 TraceCheckUtils]: 18: Hoare triple {890#(< 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] {885#true} is VALID [2022-04-27 16:14:19,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,914 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {885#true} {890#(< 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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {890#(< 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[] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {890#(< 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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,915 INFO L272 TraceCheckUtils]: 25: Hoare triple {890#(< 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] {885#true} is VALID [2022-04-27 16:14:19,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,916 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {885#true} {890#(< 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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,916 INFO L272 TraceCheckUtils]: 30: Hoare triple {890#(< 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] {885#true} is VALID [2022-04-27 16:14:19,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,916 INFO L290 TraceCheckUtils]: 32: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,917 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {885#true} {890#(< 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] {890#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-27 16:14:19,917 INFO L290 TraceCheckUtils]: 35: Hoare triple {890#(< 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[] {907#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 16:14:19,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {907#(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] {907#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 16:14:19,918 INFO L272 TraceCheckUtils]: 37: Hoare triple {907#(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] {885#true} is VALID [2022-04-27 16:14:19,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,918 INFO L290 TraceCheckUtils]: 40: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,918 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {885#true} {907#(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] {907#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 16:14:19,919 INFO L272 TraceCheckUtils]: 42: Hoare triple {907#(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] {885#true} is VALID [2022-04-27 16:14:19,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {885#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] {885#true} is VALID [2022-04-27 16:14:19,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {885#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[] {885#true} is VALID [2022-04-27 16:14:19,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {885#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {885#true} is VALID [2022-04-27 16:14:19,919 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {885#true} {907#(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] {907#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 16:14:19,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {907#(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[] {907#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-27 16:14:19,921 INFO L272 TraceCheckUtils]: 48: Hoare triple {907#(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] {916#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:14:19,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {916#(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] {917#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:14:19,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {917#(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[] {886#false} is VALID [2022-04-27 16:14:19,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {886#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {886#false} is VALID [2022-04-27 16:14:19,922 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-27 16:14:19,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:19,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723728459] [2022-04-27 16:14:19,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723728459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:19,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:19,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:14:19,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068873904] [2022-04-27 16:14:19,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:19,923 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-27 16:14:19,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:19,924 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-27 16:14:19,949 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-27 16:14:19,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:14:19,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:19,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:14:19,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:14:19,950 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-27 16:14:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:20,534 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-27 16:14:20,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:14:20,534 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-27 16:14:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:20,535 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-27 16:14:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-27 16:14:20,537 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-27 16:14:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-27 16:14:20,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2022-04-27 16:14:20,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:20,615 INFO L225 Difference]: With dead ends: 66 [2022-04-27 16:14:20,615 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 16:14:20,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:14:20,617 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:20,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 59 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:14:20,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 16:14:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-27 16:14:20,621 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:20,621 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-27 16:14:20,621 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-27 16:14:20,622 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-27 16:14:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:20,625 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-27 16:14:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-27 16:14:20,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:20,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:20,626 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-27 16:14:20,626 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-27 16:14:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:20,629 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-27 16:14:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-27 16:14:20,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:20,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:20,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:20,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:20,629 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-27 16:14:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-27 16:14:20,632 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2022-04-27 16:14:20,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:20,632 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-27 16:14:20,632 INFO L496 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-27 16:14:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-27 16:14:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-27 16:14:20,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:20,634 INFO L195 NwaCegarLoop]: 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-27 16:14:20,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 16:14:20,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:14:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1785526948, now seen corresponding path program 1 times [2022-04-27 16:14:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:20,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377883671] [2022-04-27 16:14:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {1252#(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] {1195#true} is VALID [2022-04-27 16:14:20,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1195#true} {1195#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 16:14:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 16:14:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 16:14:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 16:14:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 16:14:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 16:14:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 16:14:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 16:14:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 16:14:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 16:14:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-27 16:14:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1240#(<= (+ 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] {1240#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 16:14:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-27 16:14:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:20,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1240#(<= (+ 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] {1240#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 16:14:20,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {1195#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:20,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1252#(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] {1195#true} is VALID [2022-04-27 16:14:20,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {1195#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1195#true} {1195#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {1195#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,751 INFO L272 TraceCheckUtils]: 13: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,751 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,751 INFO L272 TraceCheckUtils]: 18: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L272 TraceCheckUtils]: 25: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L272 TraceCheckUtils]: 30: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,753 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,753 INFO L272 TraceCheckUtils]: 37: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,754 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,754 INFO L272 TraceCheckUtils]: 42: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,754 INFO L290 TraceCheckUtils]: 43: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,754 INFO L290 TraceCheckUtils]: 44: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,754 INFO L290 TraceCheckUtils]: 45: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,754 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,754 INFO L272 TraceCheckUtils]: 48: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,755 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,755 INFO L272 TraceCheckUtils]: 53: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,755 INFO L290 TraceCheckUtils]: 54: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,755 INFO L290 TraceCheckUtils]: 55: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,755 INFO L290 TraceCheckUtils]: 56: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,755 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,755 INFO L290 TraceCheckUtils]: 58: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L290 TraceCheckUtils]: 59: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L272 TraceCheckUtils]: 60: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L290 TraceCheckUtils]: 61: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L290 TraceCheckUtils]: 62: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L290 TraceCheckUtils]: 63: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L272 TraceCheckUtils]: 65: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L290 TraceCheckUtils]: 66: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L290 TraceCheckUtils]: 67: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,756 INFO L290 TraceCheckUtils]: 68: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,757 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1195#true} {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,757 INFO L290 TraceCheckUtils]: 70: Hoare triple {1195#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[] {1240#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 16:14:20,757 INFO L272 TraceCheckUtils]: 71: Hoare triple {1240#(<= (+ 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] {1195#true} is VALID [2022-04-27 16:14:20,758 INFO L290 TraceCheckUtils]: 72: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,758 INFO L290 TraceCheckUtils]: 73: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,758 INFO L290 TraceCheckUtils]: 74: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,759 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1195#true} {1240#(<= (+ 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] {1240#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 16:14:20,759 INFO L272 TraceCheckUtils]: 76: Hoare triple {1240#(<= (+ 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] {1195#true} is VALID [2022-04-27 16:14:20,759 INFO L290 TraceCheckUtils]: 77: Hoare triple {1195#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] {1195#true} is VALID [2022-04-27 16:14:20,759 INFO L290 TraceCheckUtils]: 78: Hoare triple {1195#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[] {1195#true} is VALID [2022-04-27 16:14:20,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {1195#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1195#true} is VALID [2022-04-27 16:14:20,759 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1195#true} {1240#(<= (+ 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] {1240#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 16:14:20,760 INFO L290 TraceCheckUtils]: 81: Hoare triple {1240#(<= (+ 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[] {1240#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-27 16:14:20,761 INFO L290 TraceCheckUtils]: 82: Hoare triple {1240#(<= (+ 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] {1249#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2022-04-27 16:14:20,761 INFO L272 TraceCheckUtils]: 83: Hoare triple {1249#(<= (+ 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] {1250#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:14:20,762 INFO L290 TraceCheckUtils]: 84: Hoare triple {1250#(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] {1251#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:14:20,762 INFO L290 TraceCheckUtils]: 85: Hoare triple {1251#(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[] {1196#false} is VALID [2022-04-27 16:14:20,762 INFO L290 TraceCheckUtils]: 86: Hoare triple {1196#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1196#false} is VALID [2022-04-27 16:14:20,763 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-27 16:14:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:20,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377883671] [2022-04-27 16:14:20,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377883671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:20,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:20,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:14:20,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790698785] [2022-04-27 16:14:20,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:20,764 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-27 16:14:20,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:20,764 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-27 16:14:20,802 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-27 16:14:20,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:14:20,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:20,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:14:20,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:14:20,803 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-27 16:14:21,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:21,354 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-27 16:14:21,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:14:21,354 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-27 16:14:21,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:21,355 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-27 16:14:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-27 16:14:21,357 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-27 16:14:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-04-27 16:14:21,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-04-27 16:14:21,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:21,428 INFO L225 Difference]: With dead ends: 72 [2022-04-27 16:14:21,429 INFO L226 Difference]: Without dead ends: 72 [2022-04-27 16:14:21,429 INFO L412 NwaCegarLoop]: 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-27 16:14:21,430 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:21,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 67 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 16:14:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-27 16:14:21,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-04-27 16:14:21,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:21,434 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-27 16:14:21,434 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-27 16:14:21,435 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-27 16:14:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:21,437 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-27 16:14:21,438 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-27 16:14:21,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:21,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:21,438 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-27 16:14:21,438 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-27 16:14:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:21,444 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-27 16:14:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-27 16:14:21,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:21,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:21,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:21,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:21,444 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-27 16:14:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-04-27 16:14:21,447 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2022-04-27 16:14:21,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:21,447 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-04-27 16:14:21,447 INFO L496 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-27 16:14:21,447 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-27 16:14:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-27 16:14:21,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:21,448 INFO L195 NwaCegarLoop]: 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-27 16:14:21,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 16:14:21,449 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:14:21,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash 874819922, now seen corresponding path program 1 times [2022-04-27 16:14:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:21,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864160985] [2022-04-27 16:14:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {1611#(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] {1550#true} is VALID [2022-04-27 16:14:21,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1550#true} {1550#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 16:14:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-27 16:14:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-27 16:14:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-27 16:14:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-27 16:14:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-27 16:14:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-27 16:14:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 16:14:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 16:14:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1587#(= 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] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-27 16:14:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1587#(= 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] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-27 16:14:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1587#(= 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] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-27 16:14:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1587#(= 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] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-04-27 16:14:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:21,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1604#(<= 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] {1604#(<= 1 main_~c~0)} is VALID [2022-04-27 16:14:21,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {1550#true} [187] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:21,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {1611#(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] {1550#true} is VALID [2022-04-27 16:14:21,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1550#true} [192] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1550#true} {1550#true} [255] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {1550#true} [188] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L272 TraceCheckUtils]: 13: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L272 TraceCheckUtils]: 18: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L290 TraceCheckUtils]: 23: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L272 TraceCheckUtils]: 25: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,600 INFO L272 TraceCheckUtils]: 30: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,601 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L290 TraceCheckUtils]: 35: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L272 TraceCheckUtils]: 37: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L272 TraceCheckUtils]: 42: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L272 TraceCheckUtils]: 48: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L290 TraceCheckUtils]: 50: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L272 TraceCheckUtils]: 53: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L290 TraceCheckUtils]: 55: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L290 TraceCheckUtils]: 56: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1550#true} {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,603 INFO L290 TraceCheckUtils]: 58: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {1550#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] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,604 INFO L272 TraceCheckUtils]: 60: Hoare triple {1587#(= 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] {1550#true} is VALID [2022-04-27 16:14:21,604 INFO L290 TraceCheckUtils]: 61: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,604 INFO L290 TraceCheckUtils]: 62: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,605 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1550#true} {1587#(= 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] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,605 INFO L272 TraceCheckUtils]: 65: Hoare triple {1587#(= 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] {1550#true} is VALID [2022-04-27 16:14:21,605 INFO L290 TraceCheckUtils]: 66: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,605 INFO L290 TraceCheckUtils]: 67: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,606 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1550#true} {1587#(= 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] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {1587#(= 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[] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,606 INFO L272 TraceCheckUtils]: 71: Hoare triple {1587#(= 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] {1550#true} is VALID [2022-04-27 16:14:21,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,606 INFO L290 TraceCheckUtils]: 73: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,606 INFO L290 TraceCheckUtils]: 74: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,606 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1550#true} {1587#(= 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] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,607 INFO L272 TraceCheckUtils]: 76: Hoare triple {1587#(= 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] {1550#true} is VALID [2022-04-27 16:14:21,607 INFO L290 TraceCheckUtils]: 77: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,607 INFO L290 TraceCheckUtils]: 78: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,607 INFO L290 TraceCheckUtils]: 79: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,607 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1550#true} {1587#(= 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] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,607 INFO L290 TraceCheckUtils]: 81: Hoare triple {1587#(= 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[] {1587#(= main_~c~0 0)} is VALID [2022-04-27 16:14:21,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {1587#(= 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] {1604#(<= 1 main_~c~0)} is VALID [2022-04-27 16:14:21,608 INFO L272 TraceCheckUtils]: 83: Hoare triple {1604#(<= 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] {1550#true} is VALID [2022-04-27 16:14:21,608 INFO L290 TraceCheckUtils]: 84: Hoare triple {1550#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] {1550#true} is VALID [2022-04-27 16:14:21,608 INFO L290 TraceCheckUtils]: 85: Hoare triple {1550#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[] {1550#true} is VALID [2022-04-27 16:14:21,608 INFO L290 TraceCheckUtils]: 86: Hoare triple {1550#true} [219] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1550#true} is VALID [2022-04-27 16:14:21,609 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {1550#true} {1604#(<= 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] {1604#(<= 1 main_~c~0)} is VALID [2022-04-27 16:14:21,609 INFO L272 TraceCheckUtils]: 88: Hoare triple {1604#(<= 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] {1609#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:14:21,610 INFO L290 TraceCheckUtils]: 89: Hoare triple {1609#(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] {1610#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:14:21,610 INFO L290 TraceCheckUtils]: 90: Hoare triple {1610#(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[] {1551#false} is VALID [2022-04-27 16:14:21,610 INFO L290 TraceCheckUtils]: 91: Hoare triple {1551#false} [217] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1551#false} is VALID [2022-04-27 16:14:21,610 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-27 16:14:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:21,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864160985] [2022-04-27 16:14:21,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864160985] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:21,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:21,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:14:21,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941940716] [2022-04-27 16:14:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:21,612 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-27 16:14:21,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:21,613 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-27 16:14:21,656 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-27 16:14:21,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:14:21,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:21,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:14:21,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:14:21,657 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-27 16:14:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:22,215 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-27 16:14:22,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:14:22,215 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-27 16:14:22,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:22,216 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-27 16:14:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-27 16:14:22,217 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-27 16:14:22,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2022-04-27 16:14:22,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 79 transitions. [2022-04-27 16:14:22,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:22,276 INFO L225 Difference]: With dead ends: 73 [2022-04-27 16:14:22,276 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:14:22,276 INFO L412 NwaCegarLoop]: 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-27 16:14:22,277 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:22,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:14:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:14:22,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:14:22,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:22,278 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-27 16:14:22,278 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-27 16:14:22,278 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-27 16:14:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:22,278 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:14:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:14:22,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:22,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:22,278 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-27 16:14:22,278 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-27 16:14:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:22,278 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:14:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:14:22,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:22,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:22,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:22,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:22,278 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-27 16:14:22,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:14:22,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2022-04-27 16:14:22,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:22,279 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:14:22,279 INFO L496 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-27 16:14:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:14:22,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:22,281 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:14:22,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 16:14:22,283 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-04-27 16:14:22,284 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:14:22,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:14:22 BasicIcfg [2022-04-27 16:14:22,286 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:14:22,287 INFO L158 Benchmark]: Toolchain (without parser) took 6230.56ms. Allocated memory was 215.0MB in the beginning and 266.3MB in the end (delta: 51.4MB). Free memory was 166.6MB in the beginning and 104.9MB in the end (delta: 61.7MB). Peak memory consumption was 113.1MB. Max. memory is 8.0GB. [2022-04-27 16:14:22,287 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory was 182.4MB in the beginning and 182.3MB in the end (delta: 71.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:14:22,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.36ms. Allocated memory is still 215.0MB. Free memory was 166.4MB in the beginning and 190.0MB in the end (delta: -23.7MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-27 16:14:22,287 INFO L158 Benchmark]: Boogie Preprocessor took 26.29ms. Allocated memory is still 215.0MB. Free memory was 190.0MB in the beginning and 187.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:14:22,288 INFO L158 Benchmark]: RCFGBuilder took 404.89ms. Allocated memory is still 215.0MB. Free memory was 187.9MB in the beginning and 171.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-27 16:14:22,288 INFO L158 Benchmark]: IcfgTransformer took 57.83ms. Allocated memory is still 215.0MB. Free memory was 171.1MB in the beginning and 168.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 16:14:22,288 INFO L158 Benchmark]: TraceAbstraction took 5513.68ms. Allocated memory was 215.0MB in the beginning and 266.3MB in the end (delta: 51.4MB). Free memory was 167.8MB in the beginning and 104.9MB in the end (delta: 62.9MB). Peak memory consumption was 115.9MB. Max. memory is 8.0GB. [2022-04-27 16:14:22,289 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 215.0MB. Free memory was 182.4MB in the beginning and 182.3MB in the end (delta: 71.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.36ms. Allocated memory is still 215.0MB. Free memory was 166.4MB in the beginning and 190.0MB in the end (delta: -23.7MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.29ms. Allocated memory is still 215.0MB. Free memory was 190.0MB in the beginning and 187.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 404.89ms. Allocated memory is still 215.0MB. Free memory was 187.9MB in the beginning and 171.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * IcfgTransformer took 57.83ms. Allocated memory is still 215.0MB. Free memory was 171.1MB in the beginning and 168.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5513.68ms. Allocated memory was 215.0MB in the beginning and 266.3MB in the end (delta: 51.4MB). Free memory was 167.8MB in the beginning and 104.9MB in the end (delta: 62.9MB). Peak memory consumption was 115.9MB. 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.4s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 277 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 1.6s 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.3s 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 16:14:22,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...