/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.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:13:58,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:13:58,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:13:58,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:13:58,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:13:58,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:13:58,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:13:58,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:13:58,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:13:58,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:13:58,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:13:58,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:13:58,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:13:58,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:13:58,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:13:58,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:13:58,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:13:58,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:13:58,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:13:58,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:13:58,515 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:13:58,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:13:58,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:13:58,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:13:58,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:13:58,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:13:58,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:13:58,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:13:58,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:13:58,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:13:58,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:13:58,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:13:58,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:13:58,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:13:58,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:13:58,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:13:58,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:13:58,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:13:58,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:13:58,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:13:58,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:13:58,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:13:58,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:13:58,541 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:13:58,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:13:58,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:13:58,542 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:13:58,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:13:58,542 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:13:58,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:13:58,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:13:58,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:13:58,546 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:13:58,546 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:13:58,546 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:13:58,546 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:13:58,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:13:58,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:13:58,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:13:58,547 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:13:58,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:13:58,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:13:58,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:13:58,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:13:58,548 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:13:58,548 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:13:58,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:13:58,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:13:58,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:13:58,772 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:13:58,776 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:13:58,777 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.v+cfa-reducer.c [2022-04-27 16:13:58,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f071463c1/fac612f64c034f77807bda512670ece9/FLAGc23706cef [2022-04-27 16:13:59,212 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:13:59,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-27 16:13:59,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f071463c1/fac612f64c034f77807bda512670ece9/FLAGc23706cef [2022-04-27 16:13:59,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f071463c1/fac612f64c034f77807bda512670ece9 [2022-04-27 16:13:59,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:13:59,233 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:13:59,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:13:59,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:13:59,237 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:13:59,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e8046e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59, skipping insertion in model container [2022-04-27 16:13:59,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:13:59,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:13:59,403 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.v+cfa-reducer.c[1551,1564] [2022-04-27 16:13:59,405 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.v+cfa-reducer.c[1758,1771] [2022-04-27 16:13:59,406 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.v+cfa-reducer.c[2095,2108] [2022-04-27 16:13:59,407 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.v+cfa-reducer.c[2296,2309] [2022-04-27 16:13:59,409 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.v+cfa-reducer.c[2701,2714] [2022-04-27 16:13:59,410 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.v+cfa-reducer.c[2902,2915] [2022-04-27 16:13:59,415 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.v+cfa-reducer.c[3228,3241] [2022-04-27 16:13:59,423 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.v+cfa-reducer.c[3435,3448] [2022-04-27 16:13:59,429 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.v+cfa-reducer.c[3914,3927] [2022-04-27 16:13:59,430 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.v+cfa-reducer.c[4118,4131] [2022-04-27 16:13:59,431 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.v+cfa-reducer.c[4426,4439] [2022-04-27 16:13:59,432 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.v+cfa-reducer.c[4630,4643] [2022-04-27 16:13:59,433 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.v+cfa-reducer.c[4995,5008] [2022-04-27 16:13:59,434 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.v+cfa-reducer.c[5198,5211] [2022-04-27 16:13:59,435 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.v+cfa-reducer.c[5412,5425] [2022-04-27 16:13:59,436 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.v+cfa-reducer.c[5616,5629] [2022-04-27 16:13:59,438 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.v+cfa-reducer.c[6138,6151] [2022-04-27 16:13:59,438 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.v+cfa-reducer.c[6342,6355] [2022-04-27 16:13:59,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:13:59,457 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:13:59,478 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.v+cfa-reducer.c[1551,1564] [2022-04-27 16:13:59,479 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.v+cfa-reducer.c[1758,1771] [2022-04-27 16:13:59,480 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.v+cfa-reducer.c[2095,2108] [2022-04-27 16:13:59,481 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.v+cfa-reducer.c[2296,2309] [2022-04-27 16:13:59,482 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.v+cfa-reducer.c[2701,2714] [2022-04-27 16:13:59,482 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.v+cfa-reducer.c[2902,2915] [2022-04-27 16:13:59,483 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.v+cfa-reducer.c[3228,3241] [2022-04-27 16:13:59,484 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.v+cfa-reducer.c[3435,3448] [2022-04-27 16:13:59,486 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.v+cfa-reducer.c[3914,3927] [2022-04-27 16:13:59,487 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.v+cfa-reducer.c[4118,4131] [2022-04-27 16:13:59,497 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.v+cfa-reducer.c[4426,4439] [2022-04-27 16:13:59,499 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.v+cfa-reducer.c[4630,4643] [2022-04-27 16:13:59,500 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.v+cfa-reducer.c[4995,5008] [2022-04-27 16:13:59,501 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.v+cfa-reducer.c[5198,5211] [2022-04-27 16:13:59,501 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.v+cfa-reducer.c[5412,5425] [2022-04-27 16:13:59,502 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.v+cfa-reducer.c[5616,5629] [2022-04-27 16:13:59,503 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.v+cfa-reducer.c[6138,6151] [2022-04-27 16:13:59,504 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.v+cfa-reducer.c[6342,6355] [2022-04-27 16:13:59,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:13:59,513 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:13:59,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59 WrapperNode [2022-04-27 16:13:59,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:13:59,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:13:59,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:13:59,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:13:59,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,551 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:13:59,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:13:59,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:13:59,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:13:59,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:13:59,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:13:59,602 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:13:59,606 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:13:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:13:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:13:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:13:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:13:59,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:13:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:13:59,624 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:13:59,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:13:59,670 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:13:59,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:13:59,910 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:13:59,917 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:13:59,917 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 16:13:59,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:13:59 BoogieIcfgContainer [2022-04-27 16:13:59,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:13:59,919 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:13:59,919 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:13:59,920 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:13:59,922 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:13:59" (1/1) ... [2022-04-27 16:13:59,923 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:13:59,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:13:59 BasicIcfg [2022-04-27 16:13:59,988 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:13:59,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:13:59,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:13:59,990 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:13:59,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:13:59" (1/4) ... [2022-04-27 16:13:59,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f0a175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:13:59, skipping insertion in model container [2022-04-27 16:13:59,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:13:59" (2/4) ... [2022-04-27 16:13:59,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f0a175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:13:59, skipping insertion in model container [2022-04-27 16:13:59,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:13:59" (3/4) ... [2022-04-27 16:13:59,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f0a175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:13:59, skipping insertion in model container [2022-04-27 16:13:59,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:13:59" (4/4) ... [2022-04-27 16:13:59,992 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.cJordan [2022-04-27 16:14:00,003 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:14:00,004 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-27 16:14:00,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:14:00,052 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@414b8292, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@65ede7ff [2022-04-27 16:14:00,052 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-27 16:14:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:14:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 16:14:00,069 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:00,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:14:00,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:00,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:00,073 INFO L85 PathProgramCache]: Analyzing trace with hash 317693851, now seen corresponding path program 1 times [2022-04-27 16:14:00,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:00,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597720826] [2022-04-27 16:14:00,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:00,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:00,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {90#true} is VALID [2022-04-27 16:14:00,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:00,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {90#true} is VALID [2022-04-27 16:14:00,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {90#true} is VALID [2022-04-27 16:14:00,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-27 16:14:00,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {90#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {95#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 16:14:00,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {95#(not (= main_~__VERIFIER_assert__cond~0 0))} [257] L83-->L85: Formula: (= v_main_~__VERIFIER_assert__cond~0_3 0) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_3} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-27 16:14:00,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {91#false} [259] L85-->mainErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-27 16:14:00,280 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:00,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:00,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597720826] [2022-04-27 16:14:00,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597720826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:00,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:00,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:14:00,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813997395] [2022-04-27 16:14:00,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:00,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 16:14:00,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:00,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:00,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:14:00,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:00,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:14:00,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:14:00,336 INFO L87 Difference]: Start difference. First operand has 87 states, 64 states have (on average 1.875) internal successors, (120), 82 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:00,584 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-04-27 16:14:00,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 16:14:00,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 16:14:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2022-04-27 16:14:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2022-04-27 16:14:00,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 124 transitions. [2022-04-27 16:14:00,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:00,715 INFO L225 Difference]: With dead ends: 87 [2022-04-27 16:14:00,715 INFO L226 Difference]: Without dead ends: 80 [2022-04-27 16:14:00,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:00,721 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 170 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:00,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 105 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:14:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-27 16:14:00,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-27 16:14:00,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:00,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,742 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,742 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:00,745 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-27 16:14:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-27 16:14:00,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:00,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:00,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-27 16:14:00,747 INFO L87 Difference]: Start difference. First operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-27 16:14:00,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:00,751 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-27 16:14:00,751 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-27 16:14:00,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:00,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:00,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:00,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 76 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-27 16:14:00,755 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-04-27 16:14:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:00,755 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-27 16:14:00,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-27 16:14:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 16:14:00,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:00,756 INFO L195 NwaCegarLoop]: trace histogram [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:00,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:14:00,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:00,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1258576075, now seen corresponding path program 1 times [2022-04-27 16:14:00,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:00,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865132254] [2022-04-27 16:14:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:00,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:00,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:00,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {428#true} is VALID [2022-04-27 16:14:00,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,848 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {437#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:00,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {428#true} is VALID [2022-04-27 16:14:00,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {428#true} is VALID [2022-04-27 16:14:00,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {428#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {428#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {428#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {428#true} is VALID [2022-04-27 16:14:00,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {428#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {433#(< 0 (+ main_~main__scheme~0 1))} is VALID [2022-04-27 16:14:00,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {433#(< 0 (+ main_~main__scheme~0 1))} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {434#(not (<= main_~main__scheme~0 0))} is VALID [2022-04-27 16:14:00,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {434#(not (<= main_~main__scheme~0 0))} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {435#(<= 1 main_~main__cp~0)} is VALID [2022-04-27 16:14:00,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {435#(<= 1 main_~main__cp~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {436#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-27 16:14:00,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {436#(not (= main_~__VERIFIER_assert__cond~1 0))} [261] L95-->L97: Formula: (= v_main_~__VERIFIER_assert__cond~1_3 0) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_3} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-27 16:14:00,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {429#false} [263] L97-->mainErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {429#false} is VALID [2022-04-27 16:14:00,852 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:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:00,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865132254] [2022-04-27 16:14:00,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865132254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:00,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:00,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:14:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646725571] [2022-04-27 16:14:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:00,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 16:14:00,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:00,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:00,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:00,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:14:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:00,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:14:00,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:14:00,868 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:01,129 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-27 16:14:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:14:01,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 16:14:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 16:14:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-04-27 16:14:01,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 82 transitions. [2022-04-27 16:14:01,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:01,222 INFO L225 Difference]: With dead ends: 78 [2022-04-27 16:14:01,222 INFO L226 Difference]: Without dead ends: 78 [2022-04-27 16:14:01,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:14:01,223 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 319 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:01,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 74 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-27 16:14:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-27 16:14:01,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:01,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,227 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,228 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:01,230 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-27 16:14:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-27 16:14:01,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:01,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:01,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-27 16:14:01,231 INFO L87 Difference]: Start difference. First operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-27 16:14:01,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:01,233 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-27 16:14:01,233 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-27 16:14:01,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:01,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:01,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:01,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 74 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-27 16:14:01,235 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-04-27 16:14:01,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:01,236 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-27 16:14:01,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-27 16:14:01,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 16:14:01,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:01,236 INFO L195 NwaCegarLoop]: trace histogram [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:01,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:14:01,236 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:01,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:01,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1689129137, now seen corresponding path program 1 times [2022-04-27 16:14:01,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:01,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684345043] [2022-04-27 16:14:01,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:01,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:01,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:01,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {767#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {760#true} is VALID [2022-04-27 16:14:01,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {760#true} {760#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {767#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:01,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {767#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {760#true} is VALID [2022-04-27 16:14:01,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {760#true} is VALID [2022-04-27 16:14:01,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {760#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {760#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {760#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {760#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {760#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {760#true} is VALID [2022-04-27 16:14:01,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:01,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:01,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:01,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {765#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {766#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-27 16:14:01,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {766#(not (= main_~__VERIFIER_assert__cond~2 0))} [267] L111-->L113: Formula: (= v_main_~__VERIFIER_assert__cond~2_3 0) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} OutVars{main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_3} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-27 16:14:01,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {761#false} [270] L113-->mainErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {761#false} is VALID [2022-04-27 16:14:01,296 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:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684345043] [2022-04-27 16:14:01,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684345043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:01,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:01,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:14:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106374746] [2022-04-27 16:14:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:01,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:14:01,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:01,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,310 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:01,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:14:01,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:01,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:14:01,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:14:01,311 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:01,594 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-27 16:14:01,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:14:01,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 16:14:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-04-27 16:14:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2022-04-27 16:14:01,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 105 transitions. [2022-04-27 16:14:01,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:01,685 INFO L225 Difference]: With dead ends: 99 [2022-04-27 16:14:01,685 INFO L226 Difference]: Without dead ends: 99 [2022-04-27 16:14:01,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:14:01,686 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 207 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:01,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 78 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-27 16:14:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-04-27 16:14:01,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:01,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,690 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,690 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:01,692 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-27 16:14:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-27 16:14:01,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:01,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:01,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-27 16:14:01,693 INFO L87 Difference]: Start difference. First operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-27 16:14:01,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:01,695 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-27 16:14:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-27 16:14:01,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:01,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:01,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:01,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-27 16:14:01,698 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-04-27 16:14:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:01,698 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-27 16:14:01,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-27 16:14:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 16:14:01,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:01,698 INFO L195 NwaCegarLoop]: trace histogram [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:01,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:14:01,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr3ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:01,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash -823394398, now seen corresponding path program 1 times [2022-04-27 16:14:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:01,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751703734] [2022-04-27 16:14:01,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:01,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:01,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:01,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {1157#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1149#true} is VALID [2022-04-27 16:14:01,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {1149#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1149#true} {1149#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {1149#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1157#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:01,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {1157#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1149#true} is VALID [2022-04-27 16:14:01,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {1149#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1149#true} {1149#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {1149#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {1149#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {1149#true} is VALID [2022-04-27 16:14:01,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {1149#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {1149#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {1149#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {1149#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {1149#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {1149#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {1149#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {1149#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {1149#true} is VALID [2022-04-27 16:14:01,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {1154#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 16:14:01,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {1154#(<= 0 main_~main__scheme~0)} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {1154#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 16:14:01,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {1154#(<= 0 main_~main__scheme~0)} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {1155#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:01,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {1155#(<= 0 main_~main__cp~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1155#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:01,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {1155#(<= 0 main_~main__cp~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {1155#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:01,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {1155#(<= 0 main_~main__cp~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1155#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:01,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {1155#(<= 0 main_~main__cp~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1156#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-27 16:14:01,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {1156#(not (= main_~__VERIFIER_assert__cond~3 0))} [272] L123-->L125: Formula: (= v_main_~__VERIFIER_assert__cond~3_3 0) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_3} AuxVars[] AssignedVars[] {1150#false} is VALID [2022-04-27 16:14:01,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {1150#false} [274] L125-->mainErr3ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1150#false} is VALID [2022-04-27 16:14:01,803 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:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:01,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751703734] [2022-04-27 16:14:01,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751703734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:01,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:01,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81369834] [2022-04-27 16:14:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:01,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 16:14:01,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:01,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:01,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:01,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:01,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:01,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:01,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:01,818 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:02,038 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 16:14:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:14:02,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 16:14:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-27 16:14:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-27 16:14:02,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-27 16:14:02,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:02,121 INFO L225 Difference]: With dead ends: 74 [2022-04-27 16:14:02,121 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 16:14:02,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:14:02,122 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:02,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 70 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 16:14:02,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-27 16:14:02,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:02,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,141 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,141 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:02,143 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 16:14:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 16:14:02,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:02,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:02,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 16:14:02,143 INFO L87 Difference]: Start difference. First operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 16:14:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:02,145 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 16:14:02,145 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 16:14:02,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:02,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:02,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:02,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:02,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-27 16:14:02,147 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-04-27 16:14:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:02,147 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-27 16:14:02,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 16:14:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 16:14:02,147 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:02,148 INFO L195 NwaCegarLoop]: trace histogram [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:02,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 16:14:02,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1183023144, now seen corresponding path program 1 times [2022-04-27 16:14:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:02,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989850074] [2022-04-27 16:14:02,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:02,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {1470#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1462#true} is VALID [2022-04-27 16:14:02,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {1462#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1462#true} {1462#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {1462#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1470#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:02,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {1470#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1462#true} is VALID [2022-04-27 16:14:02,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {1462#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {1462#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {1462#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {1462#true} is VALID [2022-04-27 16:14:02,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {1462#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {1462#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {1462#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {1462#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {1462#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {1462#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {1462#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {1462#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {1462#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {1462#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {1462#true} is VALID [2022-04-27 16:14:02,252 INFO L290 TraceCheckUtils]: 16: Hoare triple {1462#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {1462#true} is VALID [2022-04-27 16:14:02,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {1462#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1462#true} is VALID [2022-04-27 16:14:02,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {1462#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {1462#true} is VALID [2022-04-27 16:14:02,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {1462#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1467#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-27 16:14:02,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {1467#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:02,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:02,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:02,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {1468#(not (<= main_~main__urilen~0 main_~main__cp~0))} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {1469#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-27 16:14:02,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {1469#(not (= main_~__VERIFIER_assert__cond~16 0))} [281] L372-->L374: Formula: (= v_main_~__VERIFIER_assert__cond~16_3 0) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} AuxVars[] AssignedVars[] {1463#false} is VALID [2022-04-27 16:14:02,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {1463#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1463#false} is VALID [2022-04-27 16:14:02,255 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:02,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:02,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989850074] [2022-04-27 16:14:02,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989850074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:02,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:02,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:02,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288971260] [2022-04-27 16:14:02,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:02,256 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 16:14:02,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:02,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:02,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:02,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:02,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:02,272 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:02,803 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-27 16:14:02,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:14:02,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 16:14:02,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2022-04-27 16:14:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2022-04-27 16:14:02,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 146 transitions. [2022-04-27 16:14:02,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:02,918 INFO L225 Difference]: With dead ends: 139 [2022-04-27 16:14:02,918 INFO L226 Difference]: Without dead ends: 139 [2022-04-27 16:14:02,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:14:02,919 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:02,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 125 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:14:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-27 16:14:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-27 16:14:02,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:02,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,923 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,923 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:02,927 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-27 16:14:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-27 16:14:02,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:02,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:02,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-27 16:14:02,928 INFO L87 Difference]: Start difference. First operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 139 states. [2022-04-27 16:14:02,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:02,931 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-27 16:14:02,931 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-27 16:14:02,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:02,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:02,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:02,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-27 16:14:02,934 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-04-27 16:14:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:02,934 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-27 16:14:02,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-27 16:14:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 16:14:02,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:02,934 INFO L195 NwaCegarLoop]: trace histogram [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:02,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 16:14:02,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1182992326, now seen corresponding path program 1 times [2022-04-27 16:14:02,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:02,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547296854] [2022-04-27 16:14:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:02,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:03,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {1985#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1977#true} is VALID [2022-04-27 16:14:03,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {1977#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,013 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1977#true} {1977#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {1977#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1985#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:03,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {1985#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {1977#true} is VALID [2022-04-27 16:14:03,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {1977#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1977#true} {1977#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {1977#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {1977#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {1977#true} is VALID [2022-04-27 16:14:03,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {1977#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1977#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {1977#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {1977#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {1977#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {1977#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {1977#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {1977#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {1977#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {1977#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {1977#true} is VALID [2022-04-27 16:14:03,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {1977#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {1977#true} is VALID [2022-04-27 16:14:03,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {1977#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {1977#true} is VALID [2022-04-27 16:14:03,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {1977#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {1977#true} is VALID [2022-04-27 16:14:03,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {1977#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {1982#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-27 16:14:03,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {1982#(or (and (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~2 0) (<= main_~main__urilen~0 main_~main__cp~0)))} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:03,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:03,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} [277] L392-->L401: Formula: (= v_main_~main__cp~0_29 (+ (- 1) v_main_~main__urilen~0_24)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} AuxVars[] AssignedVars[] {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:03,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {1983#(not (<= main_~main__urilen~0 main_~main__cp~0))} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {1984#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 16:14:03,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {1984#(not (= main_~__VERIFIER_assert__cond~4 0))} [283] L143-->L145: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {1978#false} is VALID [2022-04-27 16:14:03,019 INFO L290 TraceCheckUtils]: 25: Hoare triple {1978#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1978#false} is VALID [2022-04-27 16:14:03,019 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:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:03,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547296854] [2022-04-27 16:14:03,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547296854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:03,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:03,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054761339] [2022-04-27 16:14:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 16:14:03,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:03,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:03,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:03,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:03,035 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:03,408 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-27 16:14:03,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:14:03,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 16:14:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-04-27 16:14:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2022-04-27 16:14:03,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 113 transitions. [2022-04-27 16:14:03,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:03,495 INFO L225 Difference]: With dead ends: 106 [2022-04-27 16:14:03,495 INFO L226 Difference]: Without dead ends: 106 [2022-04-27 16:14:03,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:14:03,496 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 220 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:03,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 81 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:03,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-27 16:14:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-04-27 16:14:03,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:03,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,499 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,499 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:03,501 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-27 16:14:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-27 16:14:03,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:03,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:03,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-27 16:14:03,502 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 106 states. [2022-04-27 16:14:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:03,504 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-27 16:14:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-27 16:14:03,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:03,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:03,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:03,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 75 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-27 16:14:03,505 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-04-27 16:14:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:03,506 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-27 16:14:03,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,506 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-27 16:14:03,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 16:14:03,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:03,506 INFO L195 NwaCegarLoop]: trace histogram [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:03,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 16:14:03,506 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr17ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1980989516, now seen corresponding path program 1 times [2022-04-27 16:14:03,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:03,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682075649] [2022-04-27 16:14:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:03,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:03,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:03,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {2404#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {2396#true} is VALID [2022-04-27 16:14:03,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,592 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2396#true} {2396#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2404#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:03,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {2404#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {2396#true} is VALID [2022-04-27 16:14:03,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {2396#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2396#true} {2396#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {2396#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {2396#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {2396#true} is VALID [2022-04-27 16:14:03,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {2396#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {2396#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {2396#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {2396#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {2396#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {2396#true} is VALID [2022-04-27 16:14:03,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {2396#true} is VALID [2022-04-27 16:14:03,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {2396#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2396#true} is VALID [2022-04-27 16:14:03,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {2396#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {2396#true} is VALID [2022-04-27 16:14:03,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {2396#true} is VALID [2022-04-27 16:14:03,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {2401#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-27 16:14:03,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {2401#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {2402#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:03,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {2402#(<= 0 main_~main__cp~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {2402#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:03,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {2402#(<= 0 main_~main__cp~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {2402#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:03,597 INFO L290 TraceCheckUtils]: 24: Hoare triple {2402#(<= 0 main_~main__cp~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {2403#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-27 16:14:03,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {2403#(not (= main_~__VERIFIER_assert__cond~17 0))} [287] L384-->L386: Formula: (= v_main_~__VERIFIER_assert__cond~17_3 0) InVars {main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} OutVars{main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_3} AuxVars[] AssignedVars[] {2397#false} is VALID [2022-04-27 16:14:03,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} [293] L386-->mainErr17ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2397#false} is VALID [2022-04-27 16:14:03,597 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:03,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:03,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682075649] [2022-04-27 16:14:03,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682075649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:03,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:03,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:03,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965611512] [2022-04-27 16:14:03,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:03,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 16:14:03,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:03,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:03,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:03,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:03,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:03,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:03,613 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:03,947 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-27 16:14:03,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:14:03,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 16:14:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 16:14:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:03,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-27 16:14:03,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-27 16:14:04,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:04,053 INFO L225 Difference]: With dead ends: 119 [2022-04-27 16:14:04,053 INFO L226 Difference]: Without dead ends: 119 [2022-04-27 16:14:04,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:14:04,054 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 215 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:04,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 104 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:04,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-27 16:14:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-04-27 16:14:04,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:04,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,057 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,057 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:04,059 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-27 16:14:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-27 16:14:04,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:04,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:04,060 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-27 16:14:04,060 INFO L87 Difference]: Start difference. First operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 119 states. [2022-04-27 16:14:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:04,062 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-27 16:14:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-27 16:14:04,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:04,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:04,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:04,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 73 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-27 16:14:04,064 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-04-27 16:14:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:04,064 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-27 16:14:04,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-27 16:14:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 16:14:04,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:04,065 INFO L195 NwaCegarLoop]: trace histogram [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:04,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 16:14:04,065 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr5ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1981944876, now seen corresponding path program 1 times [2022-04-27 16:14:04,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:04,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463478105] [2022-04-27 16:14:04,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:04,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:04,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:04,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {2855#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {2847#true} is VALID [2022-04-27 16:14:04,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {2847#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2847#true} {2847#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {2847#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2855#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:04,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {2855#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {2847#true} is VALID [2022-04-27 16:14:04,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {2847#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2847#true} {2847#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {2847#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {2847#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {2847#true} is VALID [2022-04-27 16:14:04,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {2847#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {2847#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {2847#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {2847#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {2847#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {2847#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {2847#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {2847#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {2847#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {2847#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {2847#true} is VALID [2022-04-27 16:14:04,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {2847#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {2847#true} is VALID [2022-04-27 16:14:04,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {2847#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {2847#true} is VALID [2022-04-27 16:14:04,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {2847#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {2847#true} is VALID [2022-04-27 16:14:04,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {2847#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {2847#true} is VALID [2022-04-27 16:14:04,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {2847#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {2852#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-27 16:14:04,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {2852#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~3 0)) (and (= main_~__VERIFIER_assert__cond~3 1) (<= 0 main_~main__cp~0)))} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {2853#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:04,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {2853#(<= 0 main_~main__cp~0)} [277] L392-->L401: Formula: (= v_main_~main__cp~0_29 (+ (- 1) v_main_~main__urilen~0_24)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} AuxVars[] AssignedVars[] {2853#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:04,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {2853#(<= 0 main_~main__cp~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {2853#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:04,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {2853#(<= 0 main_~main__cp~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {2854#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-27 16:14:04,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {2854#(not (= main_~__VERIFIER_assert__cond~5 0))} [291] L155-->L157: Formula: (= v_main_~__VERIFIER_assert__cond~5_3 0) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_3} AuxVars[] AssignedVars[] {2848#false} is VALID [2022-04-27 16:14:04,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {2848#false} [295] L157-->mainErr5ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2848#false} is VALID [2022-04-27 16:14:04,130 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:04,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:04,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463478105] [2022-04-27 16:14:04,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463478105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:04,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:04,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701813075] [2022-04-27 16:14:04,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:04,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 16:14:04,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:04,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:04,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:04,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:04,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:04,146 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:04,383 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-27 16:14:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:14:04,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 16:14:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 16:14:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 16:14:04,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-27 16:14:04,440 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:04,440 INFO L225 Difference]: With dead ends: 75 [2022-04-27 16:14:04,441 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 16:14:04,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:14:04,441 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 197 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:04,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 70 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 16:14:04,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-27 16:14:04,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:04,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,444 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,444 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:04,446 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-27 16:14:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-27 16:14:04,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:04,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:04,446 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-27 16:14:04,446 INFO L87 Difference]: Start difference. First operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-27 16:14:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:04,447 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-27 16:14:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-27 16:14:04,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:04,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:04,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:04,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 71 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-27 16:14:04,449 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-04-27 16:14:04,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:04,449 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-27 16:14:04,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,449 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-27 16:14:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 16:14:04,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:04,450 INFO L195 NwaCegarLoop]: trace histogram [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:04,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 16:14:04,455 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:04,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:04,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1978555952, now seen corresponding path program 1 times [2022-04-27 16:14:04,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:04,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348767982] [2022-04-27 16:14:04,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:04,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:04,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:04,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {3170#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3164#true} is VALID [2022-04-27 16:14:04,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {3164#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3164#true} {3164#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {3164#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3170#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:04,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {3170#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3164#true} is VALID [2022-04-27 16:14:04,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {3164#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3164#true} {3164#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {3164#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {3164#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3164#true} is VALID [2022-04-27 16:14:04,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {3164#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {3164#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {3164#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {3164#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {3164#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {3164#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {3164#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {3164#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {3164#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {3164#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {3164#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {3164#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {3164#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {3164#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {3164#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3164#true} is VALID [2022-04-27 16:14:04,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {3164#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3164#true} is VALID [2022-04-27 16:14:04,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {3164#true} [277] L392-->L401: Formula: (= v_main_~main__cp~0_29 (+ (- 1) v_main_~main__urilen~0_24)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_24, main_~main__cp~0=v_main_~main__cp~0_29} AuxVars[] AssignedVars[] {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-27 16:14:04,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-27 16:14:04,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-27 16:14:04,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-27 16:14:04,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {3169#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3165#false} is VALID [2022-04-27 16:14:04,528 INFO L290 TraceCheckUtils]: 27: Hoare triple {3165#false} [299] L175-->L177: Formula: (= v_main_~__VERIFIER_assert__cond~6_3 0) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} OutVars{main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} AuxVars[] AssignedVars[] {3165#false} is VALID [2022-04-27 16:14:04,528 INFO L290 TraceCheckUtils]: 28: Hoare triple {3165#false} [301] L177-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3165#false} is VALID [2022-04-27 16:14:04,528 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:04,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:04,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348767982] [2022-04-27 16:14:04,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348767982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:04,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:04,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:14:04,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926280775] [2022-04-27 16:14:04,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:04,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 16:14:04,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:04,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:04,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:14:04,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:04,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:14:04,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:14:04,545 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:04,720 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-04-27 16:14:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:14:04,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 16:14:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-27 16:14:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-04-27 16:14:04,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2022-04-27 16:14:04,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:04,776 INFO L225 Difference]: With dead ends: 79 [2022-04-27 16:14:04,776 INFO L226 Difference]: Without dead ends: 75 [2022-04-27 16:14:04,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:04,777 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:04,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-27 16:14:04,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-27 16:14:04,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:04,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,780 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,780 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:04,781 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-27 16:14:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-27 16:14:04,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:04,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:04,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-27 16:14:04,782 INFO L87 Difference]: Start difference. First operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-27 16:14:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:04,783 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-27 16:14:04,783 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-27 16:14:04,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:04,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:04,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:04,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:04,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 60 states have (on average 1.25) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-27 16:14:04,784 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-04-27 16:14:04,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:04,785 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-27 16:14:04,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-27 16:14:04,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 16:14:04,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:04,785 INFO L195 NwaCegarLoop]: trace histogram [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:04,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 16:14:04,785 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:04,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:04,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1860757727, now seen corresponding path program 1 times [2022-04-27 16:14:04,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:04,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856998384] [2022-04-27 16:14:04,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:04,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:04,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {3487#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3479#true} is VALID [2022-04-27 16:14:04,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {3479#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3479#true} {3479#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {3479#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3487#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:04,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {3487#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3479#true} is VALID [2022-04-27 16:14:04,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {3479#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3479#true} {3479#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {3479#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {3479#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3479#true} is VALID [2022-04-27 16:14:04,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {3479#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {3479#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {3479#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {3479#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {3479#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {3479#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {3479#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {3479#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {3479#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3479#true} is VALID [2022-04-27 16:14:04,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {3479#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:04,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:04,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:04,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:04,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:04,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3484#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:04,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {3484#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 16:14:04,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 16:14:04,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 16:14:04,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 16:14:04,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-27 16:14:04,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {3485#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {3486#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-27 16:14:04,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {3486#(not (= main_~__VERIFIER_assert__cond~6 0))} [299] L175-->L177: Formula: (= v_main_~__VERIFIER_assert__cond~6_3 0) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} OutVars{main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_3} AuxVars[] AssignedVars[] {3480#false} is VALID [2022-04-27 16:14:04,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {3480#false} [301] L177-->mainErr6ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3480#false} is VALID [2022-04-27 16:14:04,857 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:04,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:04,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856998384] [2022-04-27 16:14:04,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856998384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:04,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:04,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:04,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882099884] [2022-04-27 16:14:04,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:04,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 16:14:04,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:04,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:04,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:04,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:04,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:04,883 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:05,137 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 16:14:05,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:14:05,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 16:14:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:05,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-27 16:14:05,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:05,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-27 16:14:05,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-27 16:14:05,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:05,193 INFO L225 Difference]: With dead ends: 74 [2022-04-27 16:14:05,193 INFO L226 Difference]: Without dead ends: 74 [2022-04-27 16:14:05,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:14:05,194 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:05,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 62 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-27 16:14:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-27 16:14:05,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:05,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:05,196 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:05,196 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:05,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:05,197 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 16:14:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 16:14:05,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:05,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:05,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 16:14:05,198 INFO L87 Difference]: Start difference. First operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-27 16:14:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:05,199 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-27 16:14:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-27 16:14:05,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:05,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:05,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:05,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-27 16:14:05,200 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-04-27 16:14:05,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:05,200 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-27 16:14:05,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:05,200 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-27 16:14:05,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 16:14:05,201 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:05,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:14:05,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 16:14:05,201 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr16ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:05,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:05,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1486248991, now seen corresponding path program 1 times [2022-04-27 16:14:05,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:05,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093895290] [2022-04-27 16:14:05,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:05,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:05,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:05,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {3801#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3793#true} is VALID [2022-04-27 16:14:05,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {3793#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,255 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3793#true} {3793#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {3793#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3801#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:05,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {3801#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3793#true} is VALID [2022-04-27 16:14:05,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {3793#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3793#true} {3793#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {3793#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {3793#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3793#true} is VALID [2022-04-27 16:14:05,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {3793#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {3793#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {3793#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {3793#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3800#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-27 16:14:05,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {3800#(not (= main_~__VERIFIER_assert__cond~16 0))} [281] L372-->L374: Formula: (= v_main_~__VERIFIER_assert__cond~16_3 0) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-27 16:14:05,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {3794#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-27 16:14:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:14:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:05,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093895290] [2022-04-27 16:14:05,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093895290] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:14:05,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104006822] [2022-04-27 16:14:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:05,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:14:05,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:14:05,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:14:05,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:14:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:05,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:14:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:05,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:14:05,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {3793#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {3793#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3793#true} is VALID [2022-04-27 16:14:05,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {3793#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3793#true} {3793#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {3793#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {3793#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {3793#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {3793#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {3793#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {3793#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,500 INFO L290 TraceCheckUtils]: 19: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3886#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-27 16:14:05,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {3886#(<= 1 main_~__VERIFIER_assert__cond~16)} [281] L372-->L374: Formula: (= v_main_~__VERIFIER_assert__cond~16_3 0) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-27 16:14:05,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {3794#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-27 16:14:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:14:05,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:14:05,627 INFO L290 TraceCheckUtils]: 29: Hoare triple {3794#false} [285] L374-->mainErr16ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-27 16:14:05,627 INFO L290 TraceCheckUtils]: 28: Hoare triple {3886#(<= 1 main_~__VERIFIER_assert__cond~16)} [281] L372-->L374: Formula: (= v_main_~__VERIFIER_assert__cond~16_3 0) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_3} AuxVars[] AssignedVars[] {3794#false} is VALID [2022-04-27 16:14:05,628 INFO L290 TraceCheckUtils]: 27: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3886#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-27 16:14:05,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {3799#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {3798#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {3798#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {3793#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {3793#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {3793#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {3793#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {3793#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {3793#true} is VALID [2022-04-27 16:14:05,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {3793#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3793#true} {3793#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {3793#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {3793#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {3793#true} is VALID [2022-04-27 16:14:05,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {3793#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3793#true} is VALID [2022-04-27 16:14:05,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:14:05,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104006822] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:14:05,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:14:05,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-27 16:14:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729616859] [2022-04-27 16:14:05,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:14:05,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 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 30 [2022-04-27 16:14:05,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:05,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 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:05,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:05,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:14:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:05,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:14:05,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:14:05,652 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 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:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:06,107 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-27 16:14:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:14:06,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 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 30 [2022-04-27 16:14:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 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:06,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-27 16:14:06,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 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:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-27 16:14:06,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-27 16:14:06,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:06,199 INFO L225 Difference]: With dead ends: 109 [2022-04-27 16:14:06,199 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 16:14:06,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:14:06,200 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 146 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:06,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 97 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:14:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 16:14:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-04-27 16:14:06,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:06,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,202 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,202 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:06,203 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-27 16:14:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-27 16:14:06,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:06,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:06,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 16:14:06,204 INFO L87 Difference]: Start difference. First operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 16:14:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:06,205 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-27 16:14:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-27 16:14:06,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:06,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:06,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:06,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-27 16:14:06,207 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-04-27 16:14:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:06,207 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-27 16:14:06,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (3), 2 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:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-27 16:14:06,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 16:14:06,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:06,207 INFO L195 NwaCegarLoop]: trace histogram [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:06,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:14:06,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-27 16:14:06,411 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:06,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1848916017, now seen corresponding path program 1 times [2022-04-27 16:14:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:06,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846509816] [2022-04-27 16:14:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:06,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:06,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {4395#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4387#true} is VALID [2022-04-27 16:14:06,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {4387#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,576 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4387#true} {4387#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {4387#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4395#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:06,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {4395#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4387#true} is VALID [2022-04-27 16:14:06,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {4387#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4387#true} {4387#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {4387#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {4387#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {4387#true} is VALID [2022-04-27 16:14:06,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {4387#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {4387#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {4387#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {4387#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {4387#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {4387#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {4387#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {4387#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {4387#true} is VALID [2022-04-27 16:14:06,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {4387#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {4392#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 16:14:06,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {4392#(<= 0 main_~main__scheme~0)} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {4392#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 16:14:06,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {4392#(<= 0 main_~main__scheme~0)} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {4393#(<= 0 main_~main__cp~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {4393#(<= 0 main_~main__cp~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {4393#(<= 0 main_~main__cp~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {4393#(<= 0 main_~main__cp~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {4393#(<= 0 main_~main__cp~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {4393#(<= 0 main_~main__cp~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {4393#(<= 0 main_~main__cp~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {4393#(<= 0 main_~main__cp~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {4393#(<= 0 main_~main__cp~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {4393#(<= 0 main_~main__cp~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {4393#(<= 0 main_~main__cp~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {4393#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:06,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {4393#(<= 0 main_~main__cp~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {4394#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-27 16:14:06,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {4394#(not (= main_~__VERIFIER_assert__cond~7 0))} [303] L187-->L189: Formula: (= v_main_~__VERIFIER_assert__cond~7_3 0) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_3} AuxVars[] AssignedVars[] {4388#false} is VALID [2022-04-27 16:14:06,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {4388#false} [305] L189-->mainErr7ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4388#false} is VALID [2022-04-27 16:14:06,584 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:06,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:06,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846509816] [2022-04-27 16:14:06,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846509816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:06,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:06,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:06,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012335356] [2022-04-27 16:14:06,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:06,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 16:14:06,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:06,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:06,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:06,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:06,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:06,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:06,605 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:06,802 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 16:14:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:14:06,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 16:14:06,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-27 16:14:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-27 16:14:06,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2022-04-27 16:14:06,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:06,856 INFO L225 Difference]: With dead ends: 68 [2022-04-27 16:14:06,856 INFO L226 Difference]: Without dead ends: 68 [2022-04-27 16:14:06,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:14:06,856 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:06,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 60 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-27 16:14:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-27 16:14:06,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:06,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,858 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,858 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:06,859 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 16:14:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 16:14:06,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:06,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:06,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 16:14:06,860 INFO L87 Difference]: Start difference. First operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 16:14:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:06,861 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 16:14:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 16:14:06,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:06,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:06,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:06,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-27 16:14:06,862 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-04-27 16:14:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:06,862 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-27 16:14:06,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 16:14:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 16:14:06,862 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:06,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:14:06,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 16:14:06,863 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:06,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:06,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1170891010, now seen corresponding path program 1 times [2022-04-27 16:14:06,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:06,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636006857] [2022-04-27 16:14:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:06,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:06,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {4684#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4676#true} is VALID [2022-04-27 16:14:06,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {4676#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,914 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4676#true} {4676#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {4676#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4684#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:06,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {4684#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4676#true} is VALID [2022-04-27 16:14:06,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {4676#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4676#true} {4676#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {4676#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {4676#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {4676#true} is VALID [2022-04-27 16:14:06,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {4676#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {4676#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {4676#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {4676#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {4676#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {4676#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {4676#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {4676#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {4676#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {4676#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:06,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {4676#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:06,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {4683#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-27 16:14:06,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {4683#(not (= main_~__VERIFIER_assert__cond~4 0))} [283] L143-->L145: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-27 16:14:06,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {4677#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-27 16:14:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:14:06,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:06,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636006857] [2022-04-27 16:14:06,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636006857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:14:06,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57029685] [2022-04-27 16:14:06,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:06,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:14:06,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:14:06,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:14:06,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 16:14:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:06,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 16:14:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:06,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:14:07,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {4676#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {4676#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4676#true} is VALID [2022-04-27 16:14:07,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {4676#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4676#true} {4676#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {4676#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {4676#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {4676#true} is VALID [2022-04-27 16:14:07,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {4676#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {4676#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {4676#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {4676#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {4676#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {4676#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {4676#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {4676#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {4676#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {4676#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {4676#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {4772#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-27 16:14:07,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {4772#(<= 1 main_~__VERIFIER_assert__cond~4)} [283] L143-->L145: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-27 16:14:07,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {4677#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-27 16:14:07,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:14:07,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:14:07,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {4677#false} [289] L145-->mainErr4ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-27 16:14:07,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {4772#(<= 1 main_~__VERIFIER_assert__cond~4)} [283] L143-->L145: Formula: (= v_main_~__VERIFIER_assert__cond~4_3 0) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} OutVars{main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_3} AuxVars[] AssignedVars[] {4677#false} is VALID [2022-04-27 16:14:07,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {4772#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-27 16:14:07,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [288] L384-->L392: Formula: (and (= v_main_~main__cp~0_27 (+ v_main_~main__cp~0_28 1)) (not (= v_main_~__VERIFIER_assert__cond~17_4 0))) InVars {main_~main__cp~0=v_main_~main__cp~0_28, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} OutVars{main_~main__cp~0=v_main_~main__cp~0_27, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_4} AuxVars[] AssignedVars[main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [282] L372-->L384: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~16_4 0)) (= v_main_~__tmp_18~0_1 v_main_~__VERIFIER_assert__cond~17_1) (= v_main_~__tmp_18~0_1 (ite (<= 0 v_main_~main__cp~0_26) 1 0))) InVars {main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~main__cp~0=v_main_~main__cp~0_26} OutVars{main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_4, main_~__tmp_18~0=v_main_~__tmp_18~0_1, main_~__VERIFIER_assert__cond~17=v_main_~__VERIFIER_assert__cond~17_1, main_~main__cp~0=v_main_~main__cp~0_26} AuxVars[] AssignedVars[main_~__tmp_18~0, main_~__VERIFIER_assert__cond~17] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [279] L135-->L372: Formula: (and (= v_main_~main____CPAchecker_TMP_1~0_4 0) (= v_main_~__tmp_17~0_1 (ite (< v_main_~main__cp~0_25 v_main_~main__urilen~0_23) 1 0)) (= v_main_~__tmp_17~0_1 v_main_~__VERIFIER_assert__cond~16_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_23, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_23, main_~__VERIFIER_assert__cond~16=v_main_~__VERIFIER_assert__cond~16_1, main_~__tmp_17~0=v_main_~__tmp_17~0_1, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_4, main_~main__cp~0=v_main_~main__cp~0_25} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~16, main_~__tmp_17~0] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {4682#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {4681#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {4676#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {4681#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {4676#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {4676#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {4676#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {4676#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {4676#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {4676#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {4676#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {4676#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {4676#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {4676#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {4676#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {4676#true} is VALID [2022-04-27 16:14:07,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {4676#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4676#true} {4676#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {4676#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {4676#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {4676#true} is VALID [2022-04-27 16:14:07,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {4676#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4676#true} is VALID [2022-04-27 16:14:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:14:07,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57029685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:14:07,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:14:07,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-27 16:14:07,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815970233] [2022-04-27 16:14:07,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:14:07,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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 31 [2022-04-27 16:14:07,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:07,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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:07,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:07,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:14:07,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:07,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:14:07,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:14:07,215 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:07,422 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-27 16:14:07,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:14:07,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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 31 [2022-04-27 16:14:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-27 16:14:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-04-27 16:14:07,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 66 transitions. [2022-04-27 16:14:07,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:07,483 INFO L225 Difference]: With dead ends: 67 [2022-04-27 16:14:07,483 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 16:14:07,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:14:07,484 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 201 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:07,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 56 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:07,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 16:14:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-27 16:14:07,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:07,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:07,485 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:07,486 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:07,486 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-27 16:14:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-27 16:14:07,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:07,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:07,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 16:14:07,487 INFO L87 Difference]: Start difference. First operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-27 16:14:07,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:07,488 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-27 16:14:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-27 16:14:07,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:07,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:07,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:07,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-27 16:14:07,489 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-04-27 16:14:07,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:07,489 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-27 16:14:07,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (3), 2 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:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-27 16:14:07,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 16:14:07,490 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:07,490 INFO L195 NwaCegarLoop]: trace histogram [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:07,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 16:14:07,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-27 16:14:07,706 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1897188956, now seen corresponding path program 1 times [2022-04-27 16:14:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:07,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716457941] [2022-04-27 16:14:07,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:07,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:07,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:07,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {5150#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5142#true} is VALID [2022-04-27 16:14:07,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {5142#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5142#true} {5142#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {5142#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5150#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:07,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {5150#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5142#true} is VALID [2022-04-27 16:14:07,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {5142#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5142#true} {5142#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {5142#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {5142#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {5142#true} is VALID [2022-04-27 16:14:07,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {5142#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {5142#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {5142#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {5142#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {5142#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {5142#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {5142#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {5142#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {5142#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {5142#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {5142#true} is VALID [2022-04-27 16:14:07,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {5142#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,796 INFO L290 TraceCheckUtils]: 24: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {5148#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {5147#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:07,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {5147#(< main_~main__cp~0 main_~main__urilen~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {5149#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-27 16:14:07,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {5149#(not (= main_~__VERIFIER_assert__cond~8 0))} [311] L212-->L214: Formula: (= v_main_~__VERIFIER_assert__cond~8_3 0) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} OutVars{main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_3} AuxVars[] AssignedVars[] {5143#false} is VALID [2022-04-27 16:14:07,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {5143#false} [313] L214-->mainErr8ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5143#false} is VALID [2022-04-27 16:14:07,799 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:07,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:07,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716457941] [2022-04-27 16:14:07,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716457941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:07,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:07,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:07,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587323541] [2022-04-27 16:14:07,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:07,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-27 16:14:07,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:07,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:07,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:07,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:07,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:07,822 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:08,058 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-27 16:14:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:14:08,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-27 16:14:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-27 16:14:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-27 16:14:08,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-27 16:14:08,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:08,127 INFO L225 Difference]: With dead ends: 61 [2022-04-27 16:14:08,127 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 16:14:08,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-27 16:14:08,128 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:08,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:08,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 16:14:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-27 16:14:08,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:08,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,130 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,130 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:08,131 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-27 16:14:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-27 16:14:08,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:08,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:08,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-27 16:14:08,131 INFO L87 Difference]: Start difference. First operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-27 16:14:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:08,132 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-27 16:14:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-27 16:14:08,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:08,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:08,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:08,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-27 16:14:08,133 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-04-27 16:14:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:08,133 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-27 16:14:08,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-27 16:14:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 16:14:08,134 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:08,134 INFO L195 NwaCegarLoop]: trace histogram [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:08,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 16:14:08,135 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr9ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:08,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1316685848, now seen corresponding path program 1 times [2022-04-27 16:14:08,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:08,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624094184] [2022-04-27 16:14:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:08,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:08,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {5413#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5404#true} is VALID [2022-04-27 16:14:08,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {5404#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5404#true} {5404#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {5404#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5413#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:08,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {5413#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5404#true} is VALID [2022-04-27 16:14:08,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {5404#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5404#true} {5404#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {5404#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {5404#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {5404#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {5404#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {5404#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {5404#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {5404#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {5404#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {5404#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {5404#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {5404#true} is VALID [2022-04-27 16:14:08,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {5404#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {5409#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 16:14:08,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {5409#(<= 0 main_~main__scheme~0)} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {5409#(<= 0 main_~main__scheme~0)} is VALID [2022-04-27 16:14:08,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {5409#(<= 0 main_~main__scheme~0)} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {5410#(<= 0 main_~main__cp~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {5410#(<= 0 main_~main__cp~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {5410#(<= 0 main_~main__cp~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {5410#(<= 0 main_~main__cp~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {5410#(<= 0 main_~main__cp~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {5410#(<= 0 main_~main__cp~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {5410#(<= 0 main_~main__cp~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {5410#(<= 0 main_~main__cp~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {5410#(<= 0 main_~main__cp~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {5410#(<= 0 main_~main__cp~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {5410#(<= 0 main_~main__cp~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {5410#(<= 0 main_~main__cp~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {5410#(<= 0 main_~main__cp~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {5410#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {5410#(<= 0 main_~main__cp~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {5411#(<= 1 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {5411#(<= 1 main_~main__cp~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {5411#(<= 1 main_~main__cp~0)} is VALID [2022-04-27 16:14:08,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {5411#(<= 1 main_~main__cp~0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {5412#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-27 16:14:08,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {5412#(not (= main_~__VERIFIER_assert__cond~9 0))} [315] L224-->L226: Formula: (= v_main_~__VERIFIER_assert__cond~9_3 0) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_3} AuxVars[] AssignedVars[] {5405#false} is VALID [2022-04-27 16:14:08,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {5405#false} [317] L226-->mainErr9ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5405#false} is VALID [2022-04-27 16:14:08,199 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:08,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:08,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624094184] [2022-04-27 16:14:08,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624094184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:08,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:08,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 16:14:08,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672183382] [2022-04-27 16:14:08,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:08,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 16:14:08,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:08,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:08,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:14:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:14:08,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:14:08,217 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:08,423 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-27 16:14:08,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:14:08,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 16:14:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-27 16:14:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-27 16:14:08,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-27 16:14:08,460 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:08,460 INFO L225 Difference]: With dead ends: 69 [2022-04-27 16:14:08,460 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 16:14:08,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:14:08,461 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 177 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:08,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 57 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 16:14:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-04-27 16:14:08,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:08,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,462 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,462 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:08,463 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-27 16:14:08,463 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-27 16:14:08,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:08,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:08,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-27 16:14:08,464 INFO L87 Difference]: Start difference. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-27 16:14:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:08,464 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-27 16:14:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-27 16:14:08,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:08,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:08,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:08,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 54 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-27 16:14:08,465 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-04-27 16:14:08,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:08,466 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-27 16:14:08,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,466 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-27 16:14:08,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 16:14:08,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:08,466 INFO L195 NwaCegarLoop]: trace histogram [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:08,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 16:14:08,466 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:08,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:08,467 INFO L85 PathProgramCache]: Analyzing trace with hash -546914678, now seen corresponding path program 1 times [2022-04-27 16:14:08,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:08,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707588336] [2022-04-27 16:14:08,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:08,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:08,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:08,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {5697#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5689#true} is VALID [2022-04-27 16:14:08,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {5689#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5689#true} {5689#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {5689#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5697#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:08,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {5697#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {5689#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5689#true} {5689#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {5689#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {5689#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {5689#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {5689#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {5689#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {5689#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {5689#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {5689#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {5689#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {5689#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {5689#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {5689#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {5689#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {5689#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {5689#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {5689#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {5689#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {5689#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {5689#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {5689#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {5689#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {5689#true} is VALID [2022-04-27 16:14:08,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {5689#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {5689#true} is VALID [2022-04-27 16:14:08,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {5689#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {5689#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {5689#true} is VALID [2022-04-27 16:14:08,541 INFO L290 TraceCheckUtils]: 28: Hoare triple {5689#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {5689#true} is VALID [2022-04-27 16:14:08,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {5689#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {5689#true} is VALID [2022-04-27 16:14:08,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {5689#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {5689#true} is VALID [2022-04-27 16:14:08,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {5689#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {5694#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-27 16:14:08,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {5694#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:08,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:08,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:08,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {5695#(not (<= main_~main__urilen~0 main_~main__cp~0))} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {5696#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 16:14:08,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {5696#(not (= main_~__VERIFIER_assert__cond~10 0))} [323] L241-->L243: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {5690#false} is VALID [2022-04-27 16:14:08,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {5690#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5690#false} is VALID [2022-04-27 16:14:08,543 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:08,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:08,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707588336] [2022-04-27 16:14:08,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707588336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:08,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:08,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:08,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835912164] [2022-04-27 16:14:08,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:08,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 16:14:08,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:08,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:08,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:08,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:08,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:08,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:08,563 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:08,920 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-27 16:14:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:14:08,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-27 16:14:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-27 16:14:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:08,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-04-27 16:14:08,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-04-27 16:14:09,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:09,022 INFO L225 Difference]: With dead ends: 89 [2022-04-27 16:14:09,022 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 16:14:09,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:14:09,022 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 178 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:09,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 60 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 16:14:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-04-27 16:14:09,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:09,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,024 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,024 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:09,025 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-27 16:14:09,026 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-27 16:14:09,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:09,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:09,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-27 16:14:09,026 INFO L87 Difference]: Start difference. First operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-27 16:14:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:09,027 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-27 16:14:09,027 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-27 16:14:09,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:09,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:09,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:09,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:09,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 57 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-27 16:14:09,030 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-04-27 16:14:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:09,030 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-27 16:14:09,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-27 16:14:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-27 16:14:09,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:09,031 INFO L195 NwaCegarLoop]: trace histogram [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:09,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 16:14:09,031 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr11ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:09,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:09,031 INFO L85 PathProgramCache]: Analyzing trace with hash 225515518, now seen corresponding path program 1 times [2022-04-27 16:14:09,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:09,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817029883] [2022-04-27 16:14:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:09,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:09,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:09,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {6047#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6039#true} is VALID [2022-04-27 16:14:09,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {6039#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6039#true} {6039#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,098 INFO L272 TraceCheckUtils]: 0: Hoare triple {6039#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6047#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:09,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {6047#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6039#true} is VALID [2022-04-27 16:14:09,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {6039#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6039#true} {6039#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {6039#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {6039#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {6039#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {6039#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {6039#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {6039#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {6039#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {6039#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {6039#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {6039#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {6039#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {6039#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {6039#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {6039#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {6039#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {6039#true} is VALID [2022-04-27 16:14:09,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {6039#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {6039#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {6039#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {6039#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 23: Hoare triple {6039#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {6039#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {6039#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {6039#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {6039#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {6039#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {6039#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {6039#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {6039#true} is VALID [2022-04-27 16:14:09,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {6039#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {6039#true} is VALID [2022-04-27 16:14:09,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {6039#true} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6044#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-27 16:14:09,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {6044#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {6045#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:09,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {6045#(<= 0 main_~main__cp~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {6045#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:09,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {6045#(<= 0 main_~main__cp~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {6045#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:09,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {6045#(<= 0 main_~main__cp~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {6046#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-27 16:14:09,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {6046#(not (= main_~__VERIFIER_assert__cond~11 0))} [327] L253-->L255: Formula: (= v_main_~__VERIFIER_assert__cond~11_3 0) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_3} AuxVars[] AssignedVars[] {6040#false} is VALID [2022-04-27 16:14:09,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {6040#false} [329] L255-->mainErr11ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6040#false} is VALID [2022-04-27 16:14:09,103 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:09,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:09,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817029883] [2022-04-27 16:14:09,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817029883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:09,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:09,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:09,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699043705] [2022-04-27 16:14:09,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:09,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 16:14:09,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:09,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:09,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:09,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:09,120 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:09,333 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-27 16:14:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:14:09,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-27 16:14:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-27 16:14:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2022-04-27 16:14:09,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2022-04-27 16:14:09,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:09,377 INFO L225 Difference]: With dead ends: 59 [2022-04-27 16:14:09,377 INFO L226 Difference]: Without dead ends: 59 [2022-04-27 16:14:09,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:14:09,377 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 110 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:09,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 67 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-27 16:14:09,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-27 16:14:09,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:09,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,379 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,379 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:09,382 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-27 16:14:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-27 16:14:09,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:09,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:09,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-27 16:14:09,383 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-27 16:14:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:09,384 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-27 16:14:09,384 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-27 16:14:09,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:09,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:09,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:09,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-27 16:14:09,385 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-04-27 16:14:09,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:09,385 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-27 16:14:09,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-27 16:14:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 16:14:09,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:09,386 INFO L195 NwaCegarLoop]: trace histogram [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:09,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 16:14:09,386 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr12ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1972090370, now seen corresponding path program 1 times [2022-04-27 16:14:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:09,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383522092] [2022-04-27 16:14:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:09,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:09,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:09,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {6299#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6292#true} is VALID [2022-04-27 16:14:09,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {6292#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6292#true} {6292#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {6292#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6299#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:09,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {6299#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6292#true} is VALID [2022-04-27 16:14:09,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {6292#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6292#true} {6292#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {6292#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {6292#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {6292#true} is VALID [2022-04-27 16:14:09,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {6292#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {6292#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {6292#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {6292#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {6292#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {6292#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {6292#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {6292#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {6292#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {6292#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {6292#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {6292#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {6292#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {6292#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {6292#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {6292#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {6292#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {6292#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {6292#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {6292#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {6292#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {6292#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {6292#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6292#true} is VALID [2022-04-27 16:14:09,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {6292#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {6292#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {6292#true} is VALID [2022-04-27 16:14:09,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {6292#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {6292#true} is VALID [2022-04-27 16:14:09,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {6292#true} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6292#true} is VALID [2022-04-27 16:14:09,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {6292#true} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {6292#true} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {6292#true} is VALID [2022-04-27 16:14:09,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {6292#true} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-27 16:14:09,439 INFO L290 TraceCheckUtils]: 36: Hoare triple {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-27 16:14:09,439 INFO L290 TraceCheckUtils]: 37: Hoare triple {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-27 16:14:09,439 INFO L290 TraceCheckUtils]: 38: Hoare triple {6297#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6298#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-27 16:14:09,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {6298#(not (= main_~__VERIFIER_assert__cond~12 0))} [333] L270-->L272: Formula: (= v_main_~__VERIFIER_assert__cond~12_3 0) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} OutVars{main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_3} AuxVars[] AssignedVars[] {6293#false} is VALID [2022-04-27 16:14:09,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {6293#false} [336] L272-->mainErr12ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6293#false} is VALID [2022-04-27 16:14:09,440 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:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:09,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383522092] [2022-04-27 16:14:09,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383522092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:09,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:09,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 16:14:09,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679757680] [2022-04-27 16:14:09,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:09,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 16:14:09,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:09,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:09,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 16:14:09,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:09,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 16:14:09,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:14:09,459 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:09,655 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 16:14:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:14:09,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 16:14:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 16:14:09,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-27 16:14:09,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-27 16:14:09,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:09,713 INFO L225 Difference]: With dead ends: 68 [2022-04-27 16:14:09,713 INFO L226 Difference]: Without dead ends: 68 [2022-04-27 16:14:09,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:14:09,713 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:09,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 77 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-27 16:14:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-27 16:14:09,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:09,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,715 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,715 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:09,716 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 16:14:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 16:14:09,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:09,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:09,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 16:14:09,717 INFO L87 Difference]: Start difference. First operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-27 16:14:09,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:09,718 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-27 16:14:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-27 16:14:09,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:09,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:09,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:09,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-27 16:14:09,719 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-04-27 16:14:09,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:09,719 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-27 16:14:09,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-27 16:14:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 16:14:09,719 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:09,719 INFO L195 NwaCegarLoop]: trace histogram [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:09,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 16:14:09,719 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:09,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1005260689, now seen corresponding path program 1 times [2022-04-27 16:14:09,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:09,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148032465] [2022-04-27 16:14:09,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:09,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:09,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {6580#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6572#true} is VALID [2022-04-27 16:14:09,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {6572#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6572#true} {6572#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {6572#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6580#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:09,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {6580#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6572#true} is VALID [2022-04-27 16:14:09,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {6572#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6572#true} {6572#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {6572#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {6572#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {6572#true} is VALID [2022-04-27 16:14:09,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {6572#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {6572#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {6572#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {6572#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {6572#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {6572#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {6572#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {6572#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {6572#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {6572#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {6572#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {6572#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {6572#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {6572#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {6572#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {6572#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {6572#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {6572#true} is VALID [2022-04-27 16:14:09,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {6572#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {6572#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {6572#true} is VALID [2022-04-27 16:14:09,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {6572#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6572#true} is VALID [2022-04-27 16:14:09,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {6572#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {6572#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6572#true} is VALID [2022-04-27 16:14:09,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {6572#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6572#true} is VALID [2022-04-27 16:14:09,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {6572#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {6572#true} is VALID [2022-04-27 16:14:09,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {6572#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {6572#true} is VALID [2022-04-27 16:14:09,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {6572#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {6577#(= main_~main__c~0 0)} is VALID [2022-04-27 16:14:09,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {6577#(= main_~main__c~0 0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6577#(= main_~main__c~0 0)} is VALID [2022-04-27 16:14:09,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {6577#(= main_~main__c~0 0)} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {6577#(= main_~main__c~0 0)} is VALID [2022-04-27 16:14:09,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {6577#(= main_~main__c~0 0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {6577#(= main_~main__c~0 0)} is VALID [2022-04-27 16:14:09,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {6577#(= main_~main__c~0 0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {6577#(= main_~main__c~0 0)} is VALID [2022-04-27 16:14:09,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {6577#(= main_~main__c~0 0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {6577#(= main_~main__c~0 0)} is VALID [2022-04-27 16:14:09,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {6577#(= main_~main__c~0 0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {6577#(= main_~main__c~0 0)} is VALID [2022-04-27 16:14:09,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {6577#(= main_~main__c~0 0)} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6578#(<= 1 main_~main__c~0)} is VALID [2022-04-27 16:14:09,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {6578#(<= 1 main_~main__c~0)} [334] L270-->L282: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= (ite (<= 0 v_main_~main__c~0_6) 1 0) v_main_~__tmp_14~0_1) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__c~0=v_main_~main__c~0_6} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__c~0=v_main_~main__c~0_6, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6579#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-27 16:14:09,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {6579#(not (= main_~__VERIFIER_assert__cond~13 0))} [338] L282-->L284: Formula: (= v_main_~__VERIFIER_assert__cond~13_3 0) InVars {main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} OutVars{main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_3} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-04-27 16:14:09,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {6573#false} [340] L284-->mainErr13ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-04-27 16:14:09,768 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:09,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:09,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148032465] [2022-04-27 16:14:09,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148032465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:09,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:09,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:09,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465355508] [2022-04-27 16:14:09,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:09,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 16:14:09,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:09,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:09,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:09,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:09,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:09,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:09,788 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:10,050 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-27 16:14:10,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:14:10,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 16:14:10,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:10,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 16:14:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-04-27 16:14:10,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-04-27 16:14:10,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:10,095 INFO L225 Difference]: With dead ends: 64 [2022-04-27 16:14:10,095 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 16:14:10,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:14:10,096 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 91 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:10,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 74 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 16:14:10,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-27 16:14:10,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:10,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,097 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,097 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:10,098 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-27 16:14:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-27 16:14:10,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:10,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:10,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-27 16:14:10,099 INFO L87 Difference]: Start difference. First operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-27 16:14:10,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:10,099 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-27 16:14:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-27 16:14:10,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:10,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:10,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:10,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-27 16:14:10,101 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-04-27 16:14:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:10,101 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-27 16:14:10,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-27 16:14:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 16:14:10,101 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:10,101 INFO L195 NwaCegarLoop]: trace histogram [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:10,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 16:14:10,102 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:10,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:10,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1098311654, now seen corresponding path program 1 times [2022-04-27 16:14:10,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:10,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635277348] [2022-04-27 16:14:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:10,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:10,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {6844#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6836#true} is VALID [2022-04-27 16:14:10,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {6836#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,153 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6836#true} {6836#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {6836#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6844#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:10,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {6844#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {6836#true} is VALID [2022-04-27 16:14:10,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {6836#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6836#true} {6836#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {6836#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {6836#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {6836#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {6836#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {6836#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {6836#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {6836#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {6836#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {6836#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {6836#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {6836#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {6836#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {6836#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {6836#true} is VALID [2022-04-27 16:14:10,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {6836#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {6836#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {6836#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {6836#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {6836#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {6836#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {6836#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {6836#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {6836#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {6836#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {6836#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {6836#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {6836#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {6836#true} is VALID [2022-04-27 16:14:10,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {6836#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {6836#true} is VALID [2022-04-27 16:14:10,156 INFO L290 TraceCheckUtils]: 31: Hoare triple {6836#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {6841#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} is VALID [2022-04-27 16:14:10,156 INFO L290 TraceCheckUtils]: 32: Hoare triple {6841#(or (and (= main_~__VERIFIER_assert__cond~8 1) (not (<= main_~main__urilen~0 main_~main__cp~0))) (and (= main_~__VERIFIER_assert__cond~8 0) (<= main_~main__urilen~0 main_~main__cp~0)))} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:10,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:10,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:10,157 INFO L290 TraceCheckUtils]: 35: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:10,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:10,158 INFO L290 TraceCheckUtils]: 37: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:10,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:10,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [334] L270-->L282: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= (ite (<= 0 v_main_~main__c~0_6) 1 0) v_main_~__tmp_14~0_1) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__c~0=v_main_~main__c~0_6} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__c~0=v_main_~main__c~0_6, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:10,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {6842#(not (<= main_~main__urilen~0 main_~main__cp~0))} [339] L282-->L294: Formula: (and (= (ite (< v_main_~main__cp~0_20 v_main_~main__urilen~0_21) 1 0) v_main_~__tmp_15~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__cp~0=v_main_~main__cp~0_20} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__cp~0=v_main_~main__cp~0_20} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {6843#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 16:14:10,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {6843#(not (= main_~__VERIFIER_assert__cond~14 0))} [342] L294-->L296: Formula: (= v_main_~__VERIFIER_assert__cond~14_3 0) InVars {main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} OutVars{main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} AuxVars[] AssignedVars[] {6837#false} is VALID [2022-04-27 16:14:10,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {6837#false} [344] L296-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6837#false} is VALID [2022-04-27 16:14:10,159 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:10,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:10,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635277348] [2022-04-27 16:14:10,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635277348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:10,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:10,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057495727] [2022-04-27 16:14:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:10,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 16:14:10,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:10,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:10,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:10,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:10,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:10,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:10,183 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:10,547 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-27 16:14:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:14:10,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-27 16:14:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-27 16:14:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2022-04-27 16:14:10,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2022-04-27 16:14:10,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:10,615 INFO L225 Difference]: With dead ends: 86 [2022-04-27 16:14:10,615 INFO L226 Difference]: Without dead ends: 86 [2022-04-27 16:14:10,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:14:10,616 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:10,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 62 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-27 16:14:10,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-04-27 16:14:10,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:10,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,617 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,618 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:10,618 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-27 16:14:10,619 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-27 16:14:10,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:10,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:10,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-27 16:14:10,619 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-27 16:14:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:10,620 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-27 16:14:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-27 16:14:10,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:10,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:10,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:10,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-27 16:14:10,621 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-04-27 16:14:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:10,621 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-27 16:14:10,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-27 16:14:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 16:14:10,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:10,621 INFO L195 NwaCegarLoop]: trace histogram [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:10,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 16:14:10,622 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:10,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash -312075723, now seen corresponding path program 1 times [2022-04-27 16:14:10,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:10,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718351142] [2022-04-27 16:14:10,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:10,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:10,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {7184#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7176#true} is VALID [2022-04-27 16:14:10,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {7176#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,694 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7176#true} {7176#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {7176#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7184#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:10,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {7184#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {7176#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7176#true} {7176#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {7176#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {7176#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {7176#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {7176#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {7176#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {7176#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {7176#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {7176#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {7176#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {7176#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {7176#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {7176#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {7176#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7176#true} is VALID [2022-04-27 16:14:10,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {7176#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7176#true} is VALID [2022-04-27 16:14:10,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {7176#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7176#true} is VALID [2022-04-27 16:14:10,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {7176#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7176#true} is VALID [2022-04-27 16:14:10,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {7176#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7176#true} is VALID [2022-04-27 16:14:10,696 INFO L290 TraceCheckUtils]: 21: Hoare triple {7176#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {7176#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7176#true} is VALID [2022-04-27 16:14:10,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {7176#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {7176#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7176#true} is VALID [2022-04-27 16:14:10,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {7176#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7176#true} is VALID [2022-04-27 16:14:10,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {7176#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {7176#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7176#true} is VALID [2022-04-27 16:14:10,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {7176#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7176#true} is VALID [2022-04-27 16:14:10,702 INFO L290 TraceCheckUtils]: 29: Hoare triple {7176#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7176#true} is VALID [2022-04-27 16:14:10,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {7176#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7176#true} is VALID [2022-04-27 16:14:10,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {7176#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7176#true} is VALID [2022-04-27 16:14:10,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {7176#true} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7181#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} is VALID [2022-04-27 16:14:10,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {7181#(or (and (not (<= 0 main_~main__cp~0)) (= main_~__VERIFIER_assert__cond~9 0)) (and (= main_~__VERIFIER_assert__cond~9 1) (<= 0 main_~main__cp~0)))} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:10,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {7182#(<= 0 main_~main__cp~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:10,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {7182#(<= 0 main_~main__cp~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:10,704 INFO L290 TraceCheckUtils]: 36: Hoare triple {7182#(<= 0 main_~main__cp~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:10,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {7182#(<= 0 main_~main__cp~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:10,705 INFO L290 TraceCheckUtils]: 38: Hoare triple {7182#(<= 0 main_~main__cp~0)} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:10,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {7182#(<= 0 main_~main__cp~0)} [334] L270-->L282: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= (ite (<= 0 v_main_~main__c~0_6) 1 0) v_main_~__tmp_14~0_1) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__c~0=v_main_~main__c~0_6} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__c~0=v_main_~main__c~0_6, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:10,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {7182#(<= 0 main_~main__cp~0)} [339] L282-->L294: Formula: (and (= (ite (< v_main_~main__cp~0_20 v_main_~main__urilen~0_21) 1 0) v_main_~__tmp_15~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__cp~0=v_main_~main__cp~0_20} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__cp~0=v_main_~main__cp~0_20} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {7182#(<= 0 main_~main__cp~0)} is VALID [2022-04-27 16:14:10,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {7182#(<= 0 main_~main__cp~0)} [343] L294-->L306: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~14_4 0)) (= v_main_~__tmp_16~0_1 (ite (<= 0 v_main_~main__cp~0_21) 1 0)) (= v_main_~__tmp_16~0_1 v_main_~__VERIFIER_assert__cond~15_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_21, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_1, main_~__tmp_16~0=v_main_~__tmp_16~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_4, main_~main__cp~0=v_main_~main__cp~0_21} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~15, main_~__tmp_16~0] {7183#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-27 16:14:10,706 INFO L290 TraceCheckUtils]: 42: Hoare triple {7183#(not (= main_~__VERIFIER_assert__cond~15 0))} [346] L306-->L308: Formula: (= v_main_~__VERIFIER_assert__cond~15_3 0) InVars {main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_3} OutVars{main_~__VERIFIER_assert__cond~15=v_main_~__VERIFIER_assert__cond~15_3} AuxVars[] AssignedVars[] {7177#false} is VALID [2022-04-27 16:14:10,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {7177#false} [348] L308-->mainErr15ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7177#false} is VALID [2022-04-27 16:14:10,706 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:10,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:10,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718351142] [2022-04-27 16:14:10,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718351142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:10,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:10,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:10,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875947876] [2022-04-27 16:14:10,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:10,709 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-27 16:14:10,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:10,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:10,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:10,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:10,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:10,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:10,732 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:10,970 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 16:14:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:14:10,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-27 16:14:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-27 16:14:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:10,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-04-27 16:14:10,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2022-04-27 16:14:11,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:11,015 INFO L225 Difference]: With dead ends: 71 [2022-04-27 16:14:11,015 INFO L226 Difference]: Without dead ends: 71 [2022-04-27 16:14:11,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:14:11,016 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:11,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 69 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:11,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-27 16:14:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2022-04-27 16:14:11,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:11,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:11,018 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:11,018 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:11,019 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 16:14:11,019 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 16:14:11,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:11,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:11,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-27 16:14:11,019 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-27 16:14:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:11,020 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-27 16:14:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-27 16:14:11,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:11,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:11,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:11,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-27 16:14:11,021 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-04-27 16:14:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:11,022 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-27 16:14:11,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-27 16:14:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 16:14:11,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:11,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:14:11,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 16:14:11,023 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash -283140749, now seen corresponding path program 1 times [2022-04-27 16:14:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:11,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190107999] [2022-04-27 16:14:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:11,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:11,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {7472#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7464#true} is VALID [2022-04-27 16:14:11,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {7464#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7464#true} {7464#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {7464#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7472#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:11,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {7472#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7464#true} is VALID [2022-04-27 16:14:11,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {7464#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7464#true} {7464#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {7464#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {7464#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {7464#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {7464#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {7464#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {7464#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {7464#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {7464#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {7464#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {7464#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {7464#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {7464#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {7464#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,093 INFO L290 TraceCheckUtils]: 18: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,093 INFO L290 TraceCheckUtils]: 19: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,093 INFO L290 TraceCheckUtils]: 20: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,094 INFO L290 TraceCheckUtils]: 23: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [332] L262-->L327: Formula: (= v_main_~main____CPAchecker_TMP_3~0_4 0) InVars {main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [335] L327-->L315: Formula: (= v_main_~main__cp~0_22 (+ v_main_~main__cp~0_23 1)) InVars {main_~main__cp~0=v_main_~main__cp~0_23} OutVars{main_~main__cp~0=v_main_~main__cp~0_22} AuxVars[] AssignedVars[main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,115 INFO L290 TraceCheckUtils]: 41: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7471#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-27 16:14:11,115 INFO L290 TraceCheckUtils]: 42: Hoare triple {7471#(not (= main_~__VERIFIER_assert__cond~10 0))} [323] L241-->L243: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-27 16:14:11,115 INFO L290 TraceCheckUtils]: 43: Hoare triple {7465#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-27 16:14:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:14:11,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:11,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190107999] [2022-04-27 16:14:11,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190107999] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:14:11,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051110329] [2022-04-27 16:14:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:11,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:14:11,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:14:11,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:14:11,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 16:14:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:11,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 16:14:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:11,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:14:11,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {7464#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {7464#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {7464#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7464#true} {7464#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {7464#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {7464#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {7464#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {7464#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {7464#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {7464#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {7464#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {7464#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {7464#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {7464#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {7464#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {7464#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {7464#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,407 INFO L290 TraceCheckUtils]: 27: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [332] L262-->L327: Formula: (= v_main_~main____CPAchecker_TMP_3~0_4 0) InVars {main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [335] L327-->L315: Formula: (= v_main_~main__cp~0_22 (+ v_main_~main__cp~0_23 1)) InVars {main_~main__cp~0=v_main_~main__cp~0_23} OutVars{main_~main__cp~0=v_main_~main__cp~0_22} AuxVars[] AssignedVars[main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7599#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-27 16:14:11,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {7599#(<= 1 main_~__VERIFIER_assert__cond~10)} [323] L241-->L243: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-27 16:14:11,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {7465#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-27 16:14:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:14:11,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:14:11,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {7465#false} [325] L243-->mainErr10ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-27 16:14:11,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {7599#(<= 1 main_~__VERIFIER_assert__cond~10)} [323] L241-->L243: Formula: (= v_main_~__VERIFIER_assert__cond~10_3 0) InVars {main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} OutVars{main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_3} AuxVars[] AssignedVars[] {7465#false} is VALID [2022-04-27 16:14:11,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7599#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-27 16:14:11,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,562 INFO L290 TraceCheckUtils]: 39: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [335] L327-->L315: Formula: (= v_main_~main__cp~0_22 (+ v_main_~main__cp~0_23 1)) InVars {main_~main__cp~0=v_main_~main__cp~0_23} OutVars{main_~main__cp~0=v_main_~main__cp~0_22} AuxVars[] AssignedVars[main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,562 INFO L290 TraceCheckUtils]: 38: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [332] L262-->L327: Formula: (= v_main_~main____CPAchecker_TMP_3~0_4 0) InVars {main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,562 INFO L290 TraceCheckUtils]: 37: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,563 INFO L290 TraceCheckUtils]: 31: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,564 INFO L290 TraceCheckUtils]: 30: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,564 INFO L290 TraceCheckUtils]: 29: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,564 INFO L290 TraceCheckUtils]: 28: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7470#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {7469#(< main_~main__cp~0 main_~main__urilen~0)} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {7464#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7469#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-27 16:14:11,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {7464#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {7464#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {7464#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {7464#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {7464#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {7464#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {7464#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {7464#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {7464#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {7464#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {7464#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {7464#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7464#true} {7464#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {7464#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {7464#true} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7464#true} is VALID [2022-04-27 16:14:11,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {7464#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7464#true} is VALID [2022-04-27 16:14:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:14:11,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051110329] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:14:11,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:14:11,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-27 16:14:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109527302] [2022-04-27 16:14:11,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:14:11,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 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 44 [2022-04-27 16:14:11,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:11,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 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:11,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:11,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:14:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:14:11,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 16:14:11,592 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 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:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:11,792 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-27 16:14:11,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:14:11,792 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 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 44 [2022-04-27 16:14:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:11,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 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:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 16:14:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 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:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 53 transitions. [2022-04-27 16:14:11,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 53 transitions. [2022-04-27 16:14:11,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:11,839 INFO L225 Difference]: With dead ends: 56 [2022-04-27 16:14:11,839 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 16:14:11,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 16:14:11,840 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 78 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:11,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 52 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:11,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 16:14:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 16:14:11,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:11,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:11,842 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:11,843 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:11,843 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-27 16:14:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-27 16:14:11,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:11,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:11,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-27 16:14:11,844 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-27 16:14:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:11,844 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-04-27 16:14:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-27 16:14:11,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:11,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:11,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:11,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0769230769230769) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-27 16:14:11,845 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-04-27 16:14:11,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:11,845 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-27 16:14:11,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (3), 2 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:11,846 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-27 16:14:11,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 16:14:11,846 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:14:11,846 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:14:11,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 16:14:12,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:14:12,051 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr14ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-27 16:14:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:14:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1506676067, now seen corresponding path program 1 times [2022-04-27 16:14:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:14:12,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653658011] [2022-04-27 16:14:12,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:14:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:14:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:14:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:14:12,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {7977#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7969#true} is VALID [2022-04-27 16:14:12,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {7969#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7969#true} {7969#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {7969#true} [228] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7977#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {7977#(and (= ~__return_main~0 |old(~__return_main~0)|) (= |old(~__return_375~0)| ~__return_375~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [230] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= v_~__return_375~0_2 0) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= v_~__return_main~0_30 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 41 (select |v_#length_1| 2)))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~__return_main~0=v_~__return_main~0_30, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ~__return_375~0=v_~__return_375~0_2, #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[~__return_main~0, ~__return_375~0, #NULL.offset, #NULL.base] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {7969#true} [233] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7969#true} {7969#true} [350] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {7969#true} [229] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {7969#true} [232] mainENTRY-->L23: Formula: (and (= |v_main_#t~nondet4_2| v_main_~main__urilen~0_1) (<= |v_main_#t~nondet5_2| 2147483647) (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= |v_main_#t~nondet6_2| v_main_~main__scheme~0_1) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= |v_main_#t~nondet5_2| v_main_~main__tokenlen~0_1)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|, main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_1, main_~main__c~0=v_main_~main__c~0_1, main_~main__scheme~0=v_main_~main__scheme~0_1, main_~main__cp~0=v_main_~main__cp~0_1} AuxVars[] AssignedVars[main_~main__urilen~0, main_#t~nondet5, main_#t~nondet4, main_~main__c~0, main_#t~nondet6, main_~main__tokenlen~0, main_~main__scheme~0, main_~main__cp~0] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {7969#true} [235] L23-->L29: Formula: (<= v_main_~main__urilen~0_5 1000000) InVars {main_~main__urilen~0=v_main_~main__urilen~0_5} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_5} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {7969#true} [238] L29-->L35: Formula: (<= 0 (+ 1000000 v_main_~main__urilen~0_7)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_7} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 8: Hoare triple {7969#true} [240] L35-->L41: Formula: (<= v_main_~main__tokenlen~0_5 1000000) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_5} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {7969#true} [242] L41-->L47: Formula: (<= 0 (+ 1000000 v_main_~main__tokenlen~0_7)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_7} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {7969#true} [244] L47-->L53: Formula: (<= v_main_~main__scheme~0_5 1000000) InVars {main_~main__scheme~0=v_main_~main__scheme~0_5} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_5} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 11: Hoare triple {7969#true} [246] L53-->L59: Formula: (<= 0 (+ v_main_~main__scheme~0_7 1000000)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_7} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_7} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {7969#true} [247] L59-->L61: Formula: (< 0 v_main_~main__urilen~0_8) InVars {main_~main__urilen~0=v_main_~main__urilen~0_8} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_8} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {7969#true} [249] L61-->L63: Formula: (< 0 v_main_~main__tokenlen~0_8) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_8} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {7969#true} [251] L63-->L65: Formula: (<= 0 v_main_~main__scheme~0_8) InVars {main_~main__scheme~0=v_main_~main__scheme~0_8} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_8} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {7969#true} [254] L65-->L71: Formula: (not (= v_main_~main__scheme~0_10 0)) InVars {main_~main__scheme~0=v_main_~main__scheme~0_10} OutVars{main_~main__scheme~0=v_main_~main__scheme~0_10} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {7969#true} [256] L71-->L83: Formula: (and (= v_main_~main__scheme~0_12 v_main_~main__cp~0_2) (= v_main_~__tmp_1~0_1 v_main_~__VERIFIER_assert__cond~0_1) (not (< v_main_~main__urilen~0_10 (+ v_main_~main__scheme~0_12 1))) (= v_main_~__tmp_1~0_1 (ite (< v_main_~main__cp~0_2 (+ v_main_~main__urilen~0_10 1)) 1 0))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_1, main_~main__urilen~0=v_main_~main__urilen~0_10, main_~main__scheme~0=v_main_~main__scheme~0_12, main_~main__cp~0=v_main_~main__cp~0_2, main_~__tmp_1~0=v_main_~__tmp_1~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~0, main_~__tmp_1~0, main_~main__cp~0] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {7969#true} [258] L83-->L95: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~0_4 0)) (= v_main_~__tmp_2~0_1 v_main_~__VERIFIER_assert__cond~1_1) (= v_main_~__tmp_2~0_1 (ite (<= 1 v_main_~main__cp~0_3) 1 0))) InVars {main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~main__cp~0=v_main_~main__cp~0_3} OutVars{main_~__VERIFIER_assert__cond~0=v_main_~__VERIFIER_assert__cond~0_4, main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_1, main_~main__cp~0=v_main_~main__cp~0_3, main_~__tmp_2~0=v_main_~__tmp_2~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~1, main_~__tmp_2~0] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {7969#true} [262] L95-->L104: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~1_4 0)) (<= 0 (+ |v_main_#t~nondet7_2| 2147483648)) (<= |v_main_#t~nondet7_2| 2147483647) (= v_main_~main____CPAchecker_TMP_0~0_1 |v_main_#t~nondet7_2|)) InVars {main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{main_~__VERIFIER_assert__cond~1=v_main_~__VERIFIER_assert__cond~1_4, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_1} AuxVars[] AssignedVars[main_#t~nondet7, main_~main____CPAchecker_TMP_0~0] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {7969#true} [265] L104-->L111: Formula: (and (not (= v_main_~main____CPAchecker_TMP_0~0_3 0)) (= (ite (< v_main_~main__cp~0_4 v_main_~main__urilen~0_11) 1 0) v_main_~__tmp_3~0_1) (= v_main_~__tmp_3~0_1 v_main_~__VERIFIER_assert__cond~2_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_11, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~main__cp~0=v_main_~main__cp~0_4} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_11, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_1, main_~main____CPAchecker_TMP_0~0=v_main_~main____CPAchecker_TMP_0~0_3, main_~__tmp_3~0=v_main_~__tmp_3~0_1, main_~main__cp~0=v_main_~main__cp~0_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~2, main_~__tmp_3~0] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {7969#true} [268] L111-->L123: Formula: (and (= v_main_~__tmp_4~0_1 v_main_~__VERIFIER_assert__cond~3_1) (not (= v_main_~__VERIFIER_assert__cond~2_4 0)) (= v_main_~__tmp_4~0_1 (ite (<= 0 v_main_~main__cp~0_5) 1 0))) InVars {main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~main__cp~0=v_main_~main__cp~0_5} OutVars{main_~__tmp_4~0=v_main_~__tmp_4~0_1, main_~__VERIFIER_assert__cond~2=v_main_~__VERIFIER_assert__cond~2_4, main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_1, main_~main__cp~0=v_main_~main__cp~0_5} AuxVars[] AssignedVars[main_~__tmp_4~0, main_~__VERIFIER_assert__cond~3] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {7969#true} [273] L123-->L392: Formula: (not (= v_main_~__VERIFIER_assert__cond~3_4 0)) InVars {main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} OutVars{main_~__VERIFIER_assert__cond~3=v_main_~__VERIFIER_assert__cond~3_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {7969#true} [276] L392-->L135: Formula: (and (<= |v_main_#t~nondet8_2| 2147483647) (<= 0 (+ |v_main_#t~nondet8_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_1~0_1 |v_main_#t~nondet8_2|) (not (= v_main_~main__cp~0_6 (+ (- 1) v_main_~main__urilen~0_12)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_12, main_#t~nondet8=|v_main_#t~nondet8_2|, main_~main__cp~0=v_main_~main__cp~0_6} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_12, main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_1, main_~main__cp~0=v_main_~main__cp~0_6} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_1~0, main_#t~nondet8] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {7969#true} [278] L135-->L401: Formula: (not (= v_main_~main____CPAchecker_TMP_1~0_3 0)) InVars {main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} OutVars{main_~main____CPAchecker_TMP_1~0=v_main_~main____CPAchecker_TMP_1~0_3} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {7969#true} [280] L401-->L143: Formula: (and (= v_main_~__tmp_5~0_1 (ite (< v_main_~main__cp~0_7 v_main_~main__urilen~0_13) 1 0)) (= v_main_~__tmp_5~0_1 v_main_~__VERIFIER_assert__cond~4_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_13, main_~main__cp~0=v_main_~main__cp~0_7} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_13, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_1, main_~__tmp_5~0=v_main_~__tmp_5~0_1, main_~main__cp~0=v_main_~main__cp~0_7} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~4, main_~__tmp_5~0] {7969#true} is VALID [2022-04-27 16:14:12,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {7969#true} [284] L143-->L155: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~4_4 0)) (= v_main_~__tmp_6~0_1 (ite (<= 0 v_main_~main__cp~0_8) 1 0)) (= v_main_~__tmp_6~0_1 v_main_~__VERIFIER_assert__cond~5_1)) InVars {main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~main__cp~0=v_main_~main__cp~0_8} OutVars{main_~__tmp_6~0=v_main_~__tmp_6~0_1, main_~__VERIFIER_assert__cond~4=v_main_~__VERIFIER_assert__cond~4_4, main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_1, main_~main__cp~0=v_main_~main__cp~0_8} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~5, main_~__tmp_6~0] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {7969#true} [292] L155-->L162: Formula: (not (= v_main_~__VERIFIER_assert__cond~5_4 0)) InVars {main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} OutVars{main_~__VERIFIER_assert__cond~5=v_main_~__VERIFIER_assert__cond~5_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {7969#true} [298] L162-->L175: Formula: (and (= (ite (< (+ v_main_~main__cp~0_10 1) v_main_~main__urilen~0_15) 1 0) v_main_~__tmp_7~0_1) (= v_main_~__tmp_7~0_1 v_main_~__VERIFIER_assert__cond~6_1) (not (= v_main_~main__cp~0_10 (+ (- 1) v_main_~main__urilen~0_15)))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_15, main_~main__cp~0=v_main_~main__cp~0_10} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_15, main_~__tmp_7~0=v_main_~__tmp_7~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_1, main_~main__cp~0=v_main_~main__cp~0_10} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~6, main_~__tmp_7~0] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {7969#true} [300] L175-->L187: Formula: (and (= v_main_~__tmp_8~0_1 v_main_~__VERIFIER_assert__cond~7_1) (= v_main_~__tmp_8~0_1 (ite (<= 0 (+ v_main_~main__cp~0_11 1)) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~6_4 0))) InVars {main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11} OutVars{main_~__tmp_8~0=v_main_~__tmp_8~0_1, main_~__VERIFIER_assert__cond~6=v_main_~__VERIFIER_assert__cond~6_4, main_~main__cp~0=v_main_~main__cp~0_11, main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~7, main_~__tmp_8~0] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 29: Hoare triple {7969#true} [304] L187-->L194: Formula: (not (= v_main_~__VERIFIER_assert__cond~7_4 0)) InVars {main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} OutVars{main_~__VERIFIER_assert__cond~7=v_main_~__VERIFIER_assert__cond~7_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {7969#true} [308] L194-->L204: Formula: (let ((.cse0 (+ v_main_~main__cp~0_14 1))) (and (not (= (+ (- 1) v_main_~main__urilen~0_17) .cse0)) (= v_main_~main__cp~0_13 .cse0) (<= 0 (+ |v_main_#t~nondet9_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_2~0_1 |v_main_#t~nondet9_2|) (<= |v_main_#t~nondet9_2| 2147483647) (= v_main_~main__cp~0_13 v_main_~main__scheme~0_13))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_17, main_#t~nondet9=|v_main_#t~nondet9_2|, main_~main__cp~0=v_main_~main__cp~0_14} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_17, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_1, main_~main__scheme~0=v_main_~main__scheme~0_13, main_~main__cp~0=v_main_~main__cp~0_13} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_2~0, main_~main__scheme~0, main_#t~nondet9, main_~main__cp~0] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {7969#true} [309] L204-->L212: Formula: (and (= v_main_~__tmp_9~0_1 (ite (< v_main_~main__cp~0_15 v_main_~main__urilen~0_18) 1 0)) (not (= v_main_~main____CPAchecker_TMP_2~0_3 0)) (= 0 v_main_~main__c~0_2) (= v_main_~__tmp_9~0_1 v_main_~__VERIFIER_assert__cond~8_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__cp~0=v_main_~main__cp~0_15} OutVars{main_~__tmp_9~0=v_main_~__tmp_9~0_1, main_~main__urilen~0=v_main_~main__urilen~0_18, main_~main____CPAchecker_TMP_2~0=v_main_~main____CPAchecker_TMP_2~0_3, main_~main__c~0=v_main_~main__c~0_2, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_1, main_~main__cp~0=v_main_~main__cp~0_15} AuxVars[] AssignedVars[main_~__tmp_9~0, main_~main__c~0, main_~__VERIFIER_assert__cond~8] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {7969#true} [312] L212-->L224: Formula: (and (= v_main_~__tmp_10~0_1 (ite (<= 0 v_main_~main__cp~0_16) 1 0)) (= v_main_~__tmp_10~0_1 v_main_~__VERIFIER_assert__cond~9_1) (not (= v_main_~__VERIFIER_assert__cond~8_4 0))) InVars {main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_1, main_~__VERIFIER_assert__cond~8=v_main_~__VERIFIER_assert__cond~8_4, main_~main__cp~0=v_main_~main__cp~0_16, main_~__tmp_10~0=v_main_~__tmp_10~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~9, main_~__tmp_10~0] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {7969#true} [316] L224-->L315: Formula: (not (= v_main_~__VERIFIER_assert__cond~9_4 0)) InVars {main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} OutVars{main_~__VERIFIER_assert__cond~9=v_main_~__VERIFIER_assert__cond~9_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {7969#true} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {7969#true} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7969#true} is VALID [2022-04-27 16:14:12,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {7969#true} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7969#true} is VALID [2022-04-27 16:14:12,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {7969#true} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7969#true} is VALID [2022-04-27 16:14:12,115 INFO L290 TraceCheckUtils]: 38: Hoare triple {7969#true} [332] L262-->L327: Formula: (= v_main_~main____CPAchecker_TMP_3~0_4 0) InVars {main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} OutVars{main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_4} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,115 INFO L290 TraceCheckUtils]: 39: Hoare triple {7969#true} [335] L327-->L315: Formula: (= v_main_~main__cp~0_22 (+ v_main_~main__cp~0_23 1)) InVars {main_~main__cp~0=v_main_~main__cp~0_23} OutVars{main_~main__cp~0=v_main_~main__cp~0_22} AuxVars[] AssignedVars[main_~main__cp~0] {7969#true} is VALID [2022-04-27 16:14:12,115 INFO L290 TraceCheckUtils]: 40: Hoare triple {7969#true} [319] L315-->L234: Formula: (not (= v_main_~main__cp~0_17 (+ (- 1) v_main_~main__urilen~0_19))) InVars {main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_19, main_~main__cp~0=v_main_~main__cp~0_17} AuxVars[] AssignedVars[] {7969#true} is VALID [2022-04-27 16:14:12,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {7969#true} [321] L234-->L241: Formula: (and (= v_main_~__tmp_11~0_1 v_main_~__VERIFIER_assert__cond~10_1) (= (ite (< v_main_~main__cp~0_18 v_main_~main__urilen~0_20) 1 0) v_main_~__tmp_11~0_1) (< (+ v_main_~main__c~0_3 1) v_main_~main__tokenlen~0_9)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__c~0=v_main_~main__c~0_3, main_~main__cp~0=v_main_~main__cp~0_18} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_20, main_~main__c~0=v_main_~main__c~0_3, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_1, main_~main__tokenlen~0=v_main_~main__tokenlen~0_9, main_~main__cp~0=v_main_~main__cp~0_18, main_~__tmp_11~0=v_main_~__tmp_11~0_1} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~10, main_~__tmp_11~0] {7974#(or (and (= main_~__VERIFIER_assert__cond~10 0) (<= main_~main__urilen~0 main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~10 1) (not (<= main_~main__urilen~0 main_~main__cp~0))))} is VALID [2022-04-27 16:14:12,116 INFO L290 TraceCheckUtils]: 42: Hoare triple {7974#(or (and (= main_~__VERIFIER_assert__cond~10 0) (<= main_~main__urilen~0 main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~10 1) (not (<= main_~main__urilen~0 main_~main__cp~0))))} [324] L241-->L253: Formula: (and (= v_main_~__tmp_12~0_1 (ite (<= 0 v_main_~main__cp~0_19) 1 0)) (not (= v_main_~__VERIFIER_assert__cond~10_4 0)) (= v_main_~__tmp_12~0_1 v_main_~__VERIFIER_assert__cond~11_1)) InVars {main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_1, main_~__tmp_12~0=v_main_~__tmp_12~0_1, main_~main__cp~0=v_main_~main__cp~0_19, main_~__VERIFIER_assert__cond~10=v_main_~__VERIFIER_assert__cond~10_4} AuxVars[] AssignedVars[main_~__VERIFIER_assert__cond~11, main_~__tmp_12~0] {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:12,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} [328] L253-->L262: Formula: (and (<= 0 (+ |v_main_#t~nondet10_2| 2147483648)) (= v_main_~main____CPAchecker_TMP_3~0_1 |v_main_#t~nondet10_2|) (not (= v_main_~__VERIFIER_assert__cond~11_4 0)) (<= |v_main_#t~nondet10_2| 2147483647)) InVars {main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_#t~nondet10=|v_main_#t~nondet10_2|} OutVars{main_~__VERIFIER_assert__cond~11=v_main_~__VERIFIER_assert__cond~11_4, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_1} AuxVars[] AssignedVars[main_~main____CPAchecker_TMP_3~0, main_#t~nondet10] {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:12,117 INFO L290 TraceCheckUtils]: 44: Hoare triple {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} [331] L262-->L270: Formula: (and (= v_main_~__tmp_13~0_1 v_main_~__VERIFIER_assert__cond~12_1) (not (= v_main_~main____CPAchecker_TMP_3~0_3 0)) (= (+ v_main_~main__c~0_5 1) v_main_~main__c~0_4) (= (ite (< v_main_~main__c~0_4 v_main_~main__tokenlen~0_10) 1 0) v_main_~__tmp_13~0_1)) InVars {main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_5, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} OutVars{main_~main__tokenlen~0=v_main_~main__tokenlen~0_10, main_~main__c~0=v_main_~main__c~0_4, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_1, main_~__tmp_13~0=v_main_~__tmp_13~0_1, main_~main____CPAchecker_TMP_3~0=v_main_~main____CPAchecker_TMP_3~0_3} AuxVars[] AssignedVars[main_~main__c~0, main_~__VERIFIER_assert__cond~12, main_~__tmp_13~0] {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:12,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} [334] L270-->L282: Formula: (and (not (= v_main_~__VERIFIER_assert__cond~12_4 0)) (= (ite (<= 0 v_main_~main__c~0_6) 1 0) v_main_~__tmp_14~0_1) (= v_main_~__tmp_14~0_1 v_main_~__VERIFIER_assert__cond~13_1)) InVars {main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4, main_~main__c~0=v_main_~main__c~0_6} OutVars{main_~__tmp_14~0=v_main_~__tmp_14~0_1, main_~main__c~0=v_main_~main__c~0_6, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_1, main_~__VERIFIER_assert__cond~12=v_main_~__VERIFIER_assert__cond~12_4} AuxVars[] AssignedVars[main_~__tmp_14~0, main_~__VERIFIER_assert__cond~13] {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-27 16:14:12,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {7975#(not (<= main_~main__urilen~0 main_~main__cp~0))} [339] L282-->L294: Formula: (and (= (ite (< v_main_~main__cp~0_20 v_main_~main__urilen~0_21) 1 0) v_main_~__tmp_15~0_1) (not (= v_main_~__VERIFIER_assert__cond~13_4 0)) (= v_main_~__tmp_15~0_1 v_main_~__VERIFIER_assert__cond~14_1)) InVars {main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~main__cp~0=v_main_~main__cp~0_20} OutVars{main_~main__urilen~0=v_main_~main__urilen~0_21, main_~__VERIFIER_assert__cond~13=v_main_~__VERIFIER_assert__cond~13_4, main_~__tmp_15~0=v_main_~__tmp_15~0_1, main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_1, main_~main__cp~0=v_main_~main__cp~0_20} AuxVars[] AssignedVars[main_~__tmp_15~0, main_~__VERIFIER_assert__cond~14] {7976#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-27 16:14:12,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {7976#(not (= main_~__VERIFIER_assert__cond~14 0))} [342] L294-->L296: Formula: (= v_main_~__VERIFIER_assert__cond~14_3 0) InVars {main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} OutVars{main_~__VERIFIER_assert__cond~14=v_main_~__VERIFIER_assert__cond~14_3} AuxVars[] AssignedVars[] {7970#false} is VALID [2022-04-27 16:14:12,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {7970#false} [344] L296-->mainErr14ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7970#false} is VALID [2022-04-27 16:14:12,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 16:14:12,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:14:12,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653658011] [2022-04-27 16:14:12,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653658011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:14:12,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:14:12,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:14:12,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49276390] [2022-04-27 16:14:12,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:14:12,119 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 16:14:12,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:14:12,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:12,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:12,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:14:12,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:14:12,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:14:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:14:12,143 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:12,438 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-27 16:14:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:14:12,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-27 16:14:12,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:14:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-27 16:14:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-27 16:14:12,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-27 16:14:12,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:14:12,495 INFO L225 Difference]: With dead ends: 73 [2022-04-27 16:14:12,495 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:14:12,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:14:12,495 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 88 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:14:12,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 55 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:14:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:14:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:14:12,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:14:12,496 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:12,496 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:12,496 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:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:12,496 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:14:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:14:12,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:12,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:12,497 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:12,497 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:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:14:12,497 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:14:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:14:12,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:12,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:14:12,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:14:12,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:14:12,497 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:12,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:14:12,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-27 16:14:12,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:14:12,497 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:14:12,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:14:12,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:14:12,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:14:12,499 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-27 16:14:12,500 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-27 16:14:12,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-27 16:14:12,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-27 16:14:12,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-27 16:14:12,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-27 16:14:12,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-27 16:14:12,501 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-27 16:14:12,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 16:14:12,503 INFO L356 BasicCegarLoop]: Path program histogram: [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:12,504 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:14:12,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:14:12 BasicIcfg [2022-04-27 16:14:12,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:14:12,506 INFO L158 Benchmark]: Toolchain (without parser) took 13273.43ms. Allocated memory was 164.6MB in the beginning and 286.3MB in the end (delta: 121.6MB). Free memory was 113.5MB in the beginning and 231.2MB in the end (delta: -117.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 16:14:12,506 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 164.6MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:14:12,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.15ms. Allocated memory is still 164.6MB. Free memory was 113.3MB in the beginning and 130.3MB in the end (delta: -16.9MB). Peak memory consumption was 5.4MB. Max. memory is 8.0GB. [2022-04-27 16:14:12,507 INFO L158 Benchmark]: Boogie Preprocessor took 56.90ms. Allocated memory is still 164.6MB. Free memory was 130.3MB in the beginning and 128.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:14:12,507 INFO L158 Benchmark]: RCFGBuilder took 346.19ms. Allocated memory is still 164.6MB. Free memory was 128.4MB in the beginning and 108.9MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-27 16:14:12,507 INFO L158 Benchmark]: IcfgTransformer took 69.19ms. Allocated memory is still 164.6MB. Free memory was 108.9MB in the beginning and 105.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 16:14:12,507 INFO L158 Benchmark]: TraceAbstraction took 12517.22ms. Allocated memory was 164.6MB in the beginning and 286.3MB in the end (delta: 121.6MB). Free memory was 104.7MB in the beginning and 231.2MB in the end (delta: -126.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:14:12,508 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.10ms. Allocated memory is still 164.6MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.15ms. Allocated memory is still 164.6MB. Free memory was 113.3MB in the beginning and 130.3MB in the end (delta: -16.9MB). Peak memory consumption was 5.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.90ms. Allocated memory is still 164.6MB. Free memory was 130.3MB in the beginning and 128.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 346.19ms. Allocated memory is still 164.6MB. Free memory was 128.4MB in the beginning and 108.9MB in the end (delta: 19.5MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * IcfgTransformer took 69.19ms. Allocated memory is still 164.6MB. Free memory was 108.9MB in the beginning and 105.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 12517.22ms. Allocated memory was 164.6MB in the beginning and 286.3MB in the end (delta: 121.6MB). Free memory was 104.7MB in the beginning and 231.2MB in the end (delta: -126.5MB). There was no memory consumed. 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: 85]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 113]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 125]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 374]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 145]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 386]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 157]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 177]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 189]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 214]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 226]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 243]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 255]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 272]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 284]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 296]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 308]: 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 3 procedures, 87 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3717 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3717 mSDsluCounter, 1687 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 360 mSDsCounter, 192 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2598 IncrementalHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 192 mSolverCounterUnsat, 1327 mSDtfsCounter, 2598 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, InterpolantAutomatonStates: 153, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 298 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 855 NumberOfCodeBlocks, 855 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 931 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 12 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 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 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:14:12,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...