/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.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-28 03:09:20,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:09:20,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:09:20,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:09:20,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:09:20,157 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:09:20,158 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:09:20,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:09:20,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:09:20,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:09:20,161 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:09:20,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:09:20,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:09:20,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:09:20,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:09:20,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:09:20,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:09:20,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:09:20,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:09:20,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:09:20,169 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:09:20,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:09:20,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:09:20,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:09:20,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:09:20,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:09:20,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:09:20,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:09:20,174 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:09:20,175 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:09:20,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:09:20,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:09:20,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:09:20,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:09:20,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:09:20,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:09:20,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:09:20,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:09:20,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:09:20,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:09:20,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:09:20,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:09:20,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:09:20,186 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:09:20,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:09:20,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:09:20,187 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:09:20,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:09:20,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:09:20,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:09:20,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:09:20,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:09:20,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:09:20,188 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:09:20,189 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:09:20,189 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:09:20,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:09:20,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:09:20,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:09:20,190 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:09:20,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:09:20,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:09:20,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:09:20,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:09:20,191 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:09:20,191 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:09:20,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:09:20,191 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:09:20,192 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 03:09:20,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:09:20,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:09:20,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:09:20,396 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:09:20,397 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:09:20,398 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-28 03:09:20,448 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4df02dd/3017447ef76e4f02a80b19f2bf72ff7d/FLAG795512a1b [2022-04-28 03:09:20,777 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:09:20,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-04-28 03:09:20,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4df02dd/3017447ef76e4f02a80b19f2bf72ff7d/FLAG795512a1b [2022-04-28 03:09:20,789 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4df02dd/3017447ef76e4f02a80b19f2bf72ff7d [2022-04-28 03:09:20,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:09:20,791 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:09:20,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:09:20,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:09:20,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:09:20,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:09:20" (1/1) ... [2022-04-28 03:09:20,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b835a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:20, skipping insertion in model container [2022-04-28 03:09:20,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:09:20" (1/1) ... [2022-04-28 03:09:20,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:09:20,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:09:20,982 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-28 03:09:20,992 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-28 03:09:20,994 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-28 03:09:20,995 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-28 03:09:20,996 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-28 03:09:20,997 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-28 03:09:20,998 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-28 03:09:20,999 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-28 03:09:21,001 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-28 03:09:21,002 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-28 03:09:21,004 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-28 03:09:21,005 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-28 03:09:21,006 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-28 03:09:21,010 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-28 03:09:21,014 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-28 03:09:21,021 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-28 03:09:21,025 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-28 03:09:21,026 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-28 03:09:21,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:09:21,033 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:09:21,042 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-28 03:09:21,045 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-28 03:09:21,046 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-28 03:09:21,047 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-28 03:09:21,048 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-28 03:09:21,048 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-28 03:09:21,049 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-28 03:09:21,050 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-28 03:09:21,052 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-28 03:09:21,052 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-28 03:09:21,053 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-28 03:09:21,054 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-28 03:09:21,055 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-28 03:09:21,056 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-28 03:09:21,057 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-28 03:09:21,058 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-28 03:09:21,059 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-28 03:09:21,060 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-28 03:09:21,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:09:21,069 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:09:21,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21 WrapperNode [2022-04-28 03:09:21,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:09:21,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:09:21,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:09:21,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:09:21,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21" (1/1) ... [2022-04-28 03:09:21,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21" (1/1) ... [2022-04-28 03:09:21,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21" (1/1) ... [2022-04-28 03:09:21,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21" (1/1) ... [2022-04-28 03:09:21,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21" (1/1) ... [2022-04-28 03:09:21,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21" (1/1) ... [2022-04-28 03:09:21,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21" (1/1) ... [2022-04-28 03:09:21,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:09:21,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:09:21,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:09:21,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:09:21,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21" (1/1) ... [2022-04-28 03:09:21,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:09:21,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:21,121 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-28 03:09:21,122 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-28 03:09:21,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:09:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:09:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:09:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:09:21,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:09:21,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:09:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:09:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:09:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:09:21,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:09:21,189 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:09:21,190 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:09:21,436 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:09:21,443 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:09:21,443 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-28 03:09:21,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:09:21 BoogieIcfgContainer [2022-04-28 03:09:21,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:09:21,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:09:21,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:09:21,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:09:21,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:09:20" (1/3) ... [2022-04-28 03:09:21,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a777ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:09:21, skipping insertion in model container [2022-04-28 03:09:21,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:09:21" (2/3) ... [2022-04-28 03:09:21,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a777ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:09:21, skipping insertion in model container [2022-04-28 03:09:21,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:09:21" (3/3) ... [2022-04-28 03:09:21,451 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-04-28 03:09:21,460 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:09:21,461 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-04-28 03:09:21,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:09:21,494 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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@572beae7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d68a92 [2022-04-28 03:09:21,494 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-04-28 03:09:21,503 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-28 03:09:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:09:21,507 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:21,508 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-28 03:09:21,508 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-28 03:09:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:21,512 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 1 times [2022-04-28 03:09:21,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:21,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1540710264] [2022-04-28 03:09:21,523 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:21,523 INFO L85 PathProgramCache]: Analyzing trace with hash 129930232, now seen corresponding path program 2 times [2022-04-28 03:09:21,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:21,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672176264] [2022-04-28 03:09:21,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:21,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:21,695 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2022-04-28 03:09:21,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID [2022-04-28 03:09:21,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID [2022-04-28 03:09:21,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {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-28 03:09:21,698 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2022-04-28 03:09:21,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2022-04-28 03:09:21,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #225#return; {90#true} is VALID [2022-04-28 03:09:21,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret11 := main(); {90#true} is VALID [2022-04-28 03:09:21,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {90#true} is VALID [2022-04-28 03:09:21,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} assume !!(~main__urilen~0 <= 1000000); {90#true} is VALID [2022-04-28 03:09:21,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} assume !!(~main__urilen~0 >= -1000000); {90#true} is VALID [2022-04-28 03:09:21,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} assume !!(~main__tokenlen~0 <= 1000000); {90#true} is VALID [2022-04-28 03:09:21,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} assume !!(~main__tokenlen~0 >= -1000000); {90#true} is VALID [2022-04-28 03:09:21,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} assume !!(~main__scheme~0 <= 1000000); {90#true} is VALID [2022-04-28 03:09:21,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} assume !!(~main__scheme~0 >= -1000000); {90#true} is VALID [2022-04-28 03:09:21,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#true} assume ~main__urilen~0 > 0; {90#true} is VALID [2022-04-28 03:09:21,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#true} assume ~main__tokenlen~0 > 0; {90#true} is VALID [2022-04-28 03:09:21,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#true} assume ~main__scheme~0 >= 0; {90#true} is VALID [2022-04-28 03:09:21,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#true} assume !(0 == ~main__scheme~0); {90#true} is VALID [2022-04-28 03:09:21,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {90#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {95#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-28 03:09:21,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {95#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {91#false} is VALID [2022-04-28 03:09:21,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID [2022-04-28 03:09:21,702 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-28 03:09:21,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:21,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672176264] [2022-04-28 03:09:21,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672176264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:21,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:21,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:09:21,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:21,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1540710264] [2022-04-28 03:09:21,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1540710264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:21,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:21,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:09:21,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647811320] [2022-04-28 03:09:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:21,709 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-28 03:09:21,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:21,712 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-28 03:09:21,731 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-28 03:09:21,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:09:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:21,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:09:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:09:21,747 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-28 03:09:21,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:21,979 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2022-04-28 03:09:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:09:21,981 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-28 03:09:21,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:21,986 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-28 03:09:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-28 03:09:21,998 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-28 03:09:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-04-28 03:09:22,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2022-04-28 03:09:22,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:22,116 INFO L225 Difference]: With dead ends: 93 [2022-04-28 03:09:22,116 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 03:09:22,118 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-28 03:09:22,124 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-28 03:09:22,125 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-28 03:09:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 03:09:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-28 03:09:22,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:22,159 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-28 03:09:22,161 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-28 03:09:22,163 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-28 03:09:22,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:22,169 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-28 03:09:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-28 03:09:22,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:22,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:22,170 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-28 03:09:22,171 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-28 03:09:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:22,179 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-28 03:09:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-28 03:09:22,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:22,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:22,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:22,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:22,181 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-28 03:09:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-28 03:09:22,189 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2022-04-28 03:09:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:22,190 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-28 03:09:22,190 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-28 03:09:22,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 83 transitions. [2022-04-28 03:09:22,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-28 03:09:22,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:09:22,277 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:22,277 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-28 03:09:22,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:09:22,278 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-28 03:09:22,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 1 times [2022-04-28 03:09:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:22,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [479747866] [2022-04-28 03:09:22,281 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash -267127005, now seen corresponding path program 2 times [2022-04-28 03:09:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:22,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338327397] [2022-04-28 03:09:22,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:22,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:22,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:22,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {616#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {607#true} is VALID [2022-04-28 03:09:22,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {607#true} assume true; {607#true} is VALID [2022-04-28 03:09:22,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {607#true} {607#true} #225#return; {607#true} is VALID [2022-04-28 03:09:22,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {607#true} call ULTIMATE.init(); {616#(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-28 03:09:22,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {616#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {607#true} is VALID [2022-04-28 03:09:22,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {607#true} assume true; {607#true} is VALID [2022-04-28 03:09:22,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {607#true} {607#true} #225#return; {607#true} is VALID [2022-04-28 03:09:22,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {607#true} call #t~ret11 := main(); {607#true} is VALID [2022-04-28 03:09:22,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {607#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {607#true} is VALID [2022-04-28 03:09:22,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {607#true} assume !!(~main__urilen~0 <= 1000000); {607#true} is VALID [2022-04-28 03:09:22,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {607#true} assume !!(~main__urilen~0 >= -1000000); {607#true} is VALID [2022-04-28 03:09:22,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {607#true} assume !!(~main__tokenlen~0 <= 1000000); {607#true} is VALID [2022-04-28 03:09:22,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {607#true} assume !!(~main__tokenlen~0 >= -1000000); {607#true} is VALID [2022-04-28 03:09:22,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {607#true} assume !!(~main__scheme~0 <= 1000000); {607#true} is VALID [2022-04-28 03:09:22,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {607#true} assume !!(~main__scheme~0 >= -1000000); {607#true} is VALID [2022-04-28 03:09:22,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {607#true} assume ~main__urilen~0 > 0; {607#true} is VALID [2022-04-28 03:09:22,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {607#true} assume ~main__tokenlen~0 > 0; {607#true} is VALID [2022-04-28 03:09:22,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {607#true} assume ~main__scheme~0 >= 0; {612#(< 0 (+ main_~main__scheme~0 1))} is VALID [2022-04-28 03:09:22,406 INFO L290 TraceCheckUtils]: 15: Hoare triple {612#(< 0 (+ main_~main__scheme~0 1))} assume !(0 == ~main__scheme~0); {613#(not (<= main_~main__scheme~0 0))} is VALID [2022-04-28 03:09:22,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {613#(not (<= main_~main__scheme~0 0))} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {614#(<= 1 main_~main__cp~0)} is VALID [2022-04-28 03:09:22,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {615#(not (= main_~__VERIFIER_assert__cond~1 0))} is VALID [2022-04-28 03:09:22,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {615#(not (= main_~__VERIFIER_assert__cond~1 0))} assume 0 == ~__VERIFIER_assert__cond~1; {608#false} is VALID [2022-04-28 03:09:22,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {608#false} assume !false; {608#false} is VALID [2022-04-28 03:09:22,415 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-28 03:09:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:22,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338327397] [2022-04-28 03:09:22,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338327397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:22,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:22,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:22,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:22,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [479747866] [2022-04-28 03:09:22,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [479747866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:22,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:22,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808491285] [2022-04-28 03:09:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:22,418 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-28 03:09:22,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:22,419 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-28 03:09:22,431 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-28 03:09:22,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:22,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:22,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:22,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:22,432 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-28 03:09:22,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:22,776 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-28 03:09:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:22,776 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-28 03:09:22,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:22,776 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-28 03:09:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-28 03:09:22,778 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-28 03:09:22,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2022-04-28 03:09:22,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2022-04-28 03:09:22,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:22,853 INFO L225 Difference]: With dead ends: 80 [2022-04-28 03:09:22,853 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 03:09:22,853 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-28 03:09:22,854 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-28 03:09:22,854 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-28 03:09:22,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 03:09:22,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 03:09:22,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:22,911 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-28 03:09:22,911 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-28 03:09:22,911 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-28 03:09:22,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:22,913 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 03:09:22,913 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 03:09:22,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:22,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:22,914 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-28 03:09:22,914 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-28 03:09:22,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:22,916 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-04-28 03:09:22,916 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 03:09:22,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:22,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:22,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:22,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:22,916 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-28 03:09:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-04-28 03:09:22,918 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2022-04-28 03:09:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:22,918 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-04-28 03:09:22,918 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-28 03:09:22,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 81 transitions. [2022-04-28 03:09:22,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-04-28 03:09:22,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:09:22,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:22,976 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-28 03:09:22,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:09:22,976 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-28 03:09:22,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 1 times [2022-04-28 03:09:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:22,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690497325] [2022-04-28 03:09:22,977 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:22,977 INFO L85 PathProgramCache]: Analyzing trace with hash 989082342, now seen corresponding path program 2 times [2022-04-28 03:09:22,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:22,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950033257] [2022-04-28 03:09:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:22,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:23,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:23,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {1106#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1099#true} is VALID [2022-04-28 03:09:23,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 03:09:23,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1099#true} {1099#true} #225#return; {1099#true} is VALID [2022-04-28 03:09:23,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1106#(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-28 03:09:23,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {1106#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1099#true} is VALID [2022-04-28 03:09:23,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 03:09:23,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #225#return; {1099#true} is VALID [2022-04-28 03:09:23,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret11 := main(); {1099#true} is VALID [2022-04-28 03:09:23,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {1099#true} is VALID [2022-04-28 03:09:23,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume !!(~main__urilen~0 <= 1000000); {1099#true} is VALID [2022-04-28 03:09:23,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} assume !!(~main__urilen~0 >= -1000000); {1099#true} is VALID [2022-04-28 03:09:23,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} assume !!(~main__tokenlen~0 <= 1000000); {1099#true} is VALID [2022-04-28 03:09:23,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#true} assume !!(~main__tokenlen~0 >= -1000000); {1099#true} is VALID [2022-04-28 03:09:23,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {1099#true} assume !!(~main__scheme~0 <= 1000000); {1099#true} is VALID [2022-04-28 03:09:23,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {1099#true} assume !!(~main__scheme~0 >= -1000000); {1099#true} is VALID [2022-04-28 03:09:23,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {1099#true} assume ~main__urilen~0 > 0; {1099#true} is VALID [2022-04-28 03:09:23,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#true} assume ~main__tokenlen~0 > 0; {1099#true} is VALID [2022-04-28 03:09:23,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#true} assume ~main__scheme~0 >= 0; {1099#true} is VALID [2022-04-28 03:09:23,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {1099#true} assume !(0 == ~main__scheme~0); {1099#true} is VALID [2022-04-28 03:09:23,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:23,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:23,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:23,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1105#(not (= main_~__VERIFIER_assert__cond~2 0))} is VALID [2022-04-28 03:09:23,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {1105#(not (= main_~__VERIFIER_assert__cond~2 0))} assume 0 == ~__VERIFIER_assert__cond~2; {1100#false} is VALID [2022-04-28 03:09:23,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-28 03:09:23,034 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-28 03:09:23,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:23,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950033257] [2022-04-28 03:09:23,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950033257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:23,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:23,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:23,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:23,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690497325] [2022-04-28 03:09:23,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690497325] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:23,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:23,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:23,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738028095] [2022-04-28 03:09:23,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:23,035 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-28 03:09:23,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:23,035 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-28 03:09:23,047 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-28 03:09:23,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:09:23,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:23,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:09:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:23,048 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-28 03:09:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:23,373 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-04-28 03:09:23,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:23,373 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-28 03:09:23,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:23,374 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-28 03:09:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-28 03:09:23,375 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-28 03:09:23,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-04-28 03:09:23,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 106 transitions. [2022-04-28 03:09:23,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:23,455 INFO L225 Difference]: With dead ends: 101 [2022-04-28 03:09:23,455 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 03:09:23,455 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-28 03:09:23,456 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-28 03:09:23,456 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-28 03:09:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 03:09:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2022-04-28 03:09:23,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:23,531 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-28 03:09:23,531 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-28 03:09:23,531 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-28 03:09:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:23,533 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-28 03:09:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-28 03:09:23,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:23,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:23,534 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-28 03:09:23,534 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-28 03:09:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:23,536 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2022-04-28 03:09:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-28 03:09:23,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:23,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:23,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:23,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:23,537 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-28 03:09:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-04-28 03:09:23,538 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2022-04-28 03:09:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:23,539 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-04-28 03:09:23,539 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-28 03:09:23,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 79 transitions. [2022-04-28 03:09:23,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-04-28 03:09:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:09:23,604 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:23,604 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-28 03:09:23,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:09:23,605 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-28 03:09:23,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:23,605 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 1 times [2022-04-28 03:09:23,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:23,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [206547197] [2022-04-28 03:09:23,606 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 596784644, now seen corresponding path program 2 times [2022-04-28 03:09:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:23,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123976738] [2022-04-28 03:09:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:23,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {1675#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1667#true} is VALID [2022-04-28 03:09:23,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1667#true} assume true; {1667#true} is VALID [2022-04-28 03:09:23,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1667#true} {1667#true} #225#return; {1667#true} is VALID [2022-04-28 03:09:23,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {1667#true} call ULTIMATE.init(); {1675#(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-28 03:09:23,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {1675#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {1667#true} is VALID [2022-04-28 03:09:23,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#true} assume true; {1667#true} is VALID [2022-04-28 03:09:23,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1667#true} {1667#true} #225#return; {1667#true} is VALID [2022-04-28 03:09:23,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {1667#true} call #t~ret11 := main(); {1667#true} is VALID [2022-04-28 03:09:23,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {1667#true} is VALID [2022-04-28 03:09:23,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {1667#true} assume !!(~main__urilen~0 <= 1000000); {1667#true} is VALID [2022-04-28 03:09:23,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#true} assume !!(~main__urilen~0 >= -1000000); {1667#true} is VALID [2022-04-28 03:09:23,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#true} assume !!(~main__tokenlen~0 <= 1000000); {1667#true} is VALID [2022-04-28 03:09:23,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#true} assume !!(~main__tokenlen~0 >= -1000000); {1667#true} is VALID [2022-04-28 03:09:23,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {1667#true} assume !!(~main__scheme~0 <= 1000000); {1667#true} is VALID [2022-04-28 03:09:23,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#true} assume !!(~main__scheme~0 >= -1000000); {1667#true} is VALID [2022-04-28 03:09:23,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#true} assume ~main__urilen~0 > 0; {1667#true} is VALID [2022-04-28 03:09:23,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {1667#true} assume ~main__tokenlen~0 > 0; {1667#true} is VALID [2022-04-28 03:09:23,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {1667#true} assume ~main__scheme~0 >= 0; {1672#(<= 0 main_~main__scheme~0)} is VALID [2022-04-28 03:09:23,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {1672#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {1672#(<= 0 main_~main__scheme~0)} is VALID [2022-04-28 03:09:23,656 INFO L290 TraceCheckUtils]: 16: Hoare triple {1672#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1673#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:23,656 INFO L290 TraceCheckUtils]: 17: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1673#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:23,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {1673#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:23,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1673#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:23,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {1673#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1674#(not (= main_~__VERIFIER_assert__cond~3 0))} is VALID [2022-04-28 03:09:23,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {1674#(not (= main_~__VERIFIER_assert__cond~3 0))} assume 0 == ~__VERIFIER_assert__cond~3; {1668#false} is VALID [2022-04-28 03:09:23,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {1668#false} assume !false; {1668#false} is VALID [2022-04-28 03:09:23,658 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-28 03:09:23,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:23,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123976738] [2022-04-28 03:09:23,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123976738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:23,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:23,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:23,659 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:23,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [206547197] [2022-04-28 03:09:23,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [206547197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:23,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:23,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:23,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592480481] [2022-04-28 03:09:23,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:23,659 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-28 03:09:23,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:23,660 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-28 03:09:23,670 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-28 03:09:23,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:23,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:23,671 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-28 03:09:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:23,960 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-28 03:09:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:23,960 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-28 03:09:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:23,960 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-28 03:09:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-28 03:09:23,962 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-28 03:09:23,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-28 03:09:23,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-28 03:09:24,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:24,021 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:09:24,021 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 03:09:24,021 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-28 03:09:24,022 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 234 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:24,022 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.0s Time] [2022-04-28 03:09:24,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 03:09:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 03:09:24,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:24,160 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-28 03:09:24,161 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-28 03:09:24,161 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-28 03:09:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:24,162 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-28 03:09:24,162 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-28 03:09:24,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:24,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:24,163 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-28 03:09:24,163 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-28 03:09:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:24,164 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-28 03:09:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-28 03:09:24,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:24,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:24,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:24,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:24,165 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-28 03:09:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-04-28 03:09:24,166 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2022-04-28 03:09:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:24,167 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-04-28 03:09:24,167 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-28 03:09:24,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 77 transitions. [2022-04-28 03:09:24,235 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-28 03:09:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-28 03:09:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:09:24,236 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:24,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, 1, 1, 1, 1] [2022-04-28 03:09:24,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:09:24,236 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-28 03:09:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:24,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 1 times [2022-04-28 03:09:24,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:24,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57315857] [2022-04-28 03:09:24,237 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:24,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1944836287, now seen corresponding path program 2 times [2022-04-28 03:09:24,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:24,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355763544] [2022-04-28 03:09:24,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:24,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:24,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:24,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {2140#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2132#true} is VALID [2022-04-28 03:09:24,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {2132#true} assume true; {2132#true} is VALID [2022-04-28 03:09:24,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2132#true} {2132#true} #225#return; {2132#true} is VALID [2022-04-28 03:09:24,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {2132#true} call ULTIMATE.init(); {2140#(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-28 03:09:24,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {2140#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2132#true} is VALID [2022-04-28 03:09:24,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {2132#true} assume true; {2132#true} is VALID [2022-04-28 03:09:24,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2132#true} {2132#true} #225#return; {2132#true} is VALID [2022-04-28 03:09:24,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {2132#true} call #t~ret11 := main(); {2132#true} is VALID [2022-04-28 03:09:24,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {2132#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {2132#true} is VALID [2022-04-28 03:09:24,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {2132#true} assume !!(~main__urilen~0 <= 1000000); {2132#true} is VALID [2022-04-28 03:09:24,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {2132#true} assume !!(~main__urilen~0 >= -1000000); {2132#true} is VALID [2022-04-28 03:09:24,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {2132#true} assume !!(~main__tokenlen~0 <= 1000000); {2132#true} is VALID [2022-04-28 03:09:24,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {2132#true} assume !!(~main__tokenlen~0 >= -1000000); {2132#true} is VALID [2022-04-28 03:09:24,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {2132#true} assume !!(~main__scheme~0 <= 1000000); {2132#true} is VALID [2022-04-28 03:09:24,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {2132#true} assume !!(~main__scheme~0 >= -1000000); {2132#true} is VALID [2022-04-28 03:09:24,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {2132#true} assume ~main__urilen~0 > 0; {2132#true} is VALID [2022-04-28 03:09:24,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {2132#true} assume ~main__tokenlen~0 > 0; {2132#true} is VALID [2022-04-28 03:09:24,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {2132#true} assume ~main__scheme~0 >= 0; {2132#true} is VALID [2022-04-28 03:09:24,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {2132#true} assume !(0 == ~main__scheme~0); {2132#true} is VALID [2022-04-28 03:09:24,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {2132#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2132#true} is VALID [2022-04-28 03:09:24,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {2132#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2132#true} is VALID [2022-04-28 03:09:24,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {2132#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {2132#true} is VALID [2022-04-28 03:09:24,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {2132#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2137#(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-28 03:09:24,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {2137#(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)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:24,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:24,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:24,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {2138#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2139#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-28 03:09:24,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {2139#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {2133#false} is VALID [2022-04-28 03:09:24,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {2133#false} assume !false; {2133#false} is VALID [2022-04-28 03:09:24,311 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-28 03:09:24,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:24,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355763544] [2022-04-28 03:09:24,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355763544] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:24,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:24,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:24,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:24,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57315857] [2022-04-28 03:09:24,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57315857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:24,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:24,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579297453] [2022-04-28 03:09:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:24,313 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-28 03:09:24,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:24,313 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-28 03:09:24,334 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-28 03:09:24,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:24,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:24,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:24,335 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-28 03:09:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:25,139 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2022-04-28 03:09:25,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:09:25,140 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-28 03:09:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:25,140 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-28 03:09:25,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-28 03:09:25,141 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-28 03:09:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2022-04-28 03:09:25,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 147 transitions. [2022-04-28 03:09:25,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:25,256 INFO L225 Difference]: With dead ends: 141 [2022-04-28 03:09:25,256 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 03:09:25,256 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-28 03:09:25,257 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-28 03:09:25,257 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-28 03:09:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 03:09:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2022-04-28 03:09:25,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:25,388 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-28 03:09:25,388 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-28 03:09:25,388 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-28 03:09:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:25,391 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-28 03:09:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-28 03:09:25,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:25,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:25,391 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-28 03:09:25,392 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-28 03:09:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:25,394 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2022-04-28 03:09:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2022-04-28 03:09:25,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:25,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:25,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:25,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:25,395 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-28 03:09:25,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-28 03:09:25,396 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2022-04-28 03:09:25,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:25,396 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-28 03:09:25,396 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-28 03:09:25,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 82 transitions. [2022-04-28 03:09:25,481 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-28 03:09:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-28 03:09:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:09:25,482 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:25,482 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-28 03:09:25,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:09:25,482 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-28 03:09:25,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:25,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 1 times [2022-04-28 03:09:25,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:25,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649360613] [2022-04-28 03:09:25,483 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:25,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1948570096, now seen corresponding path program 2 times [2022-04-28 03:09:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:25,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764850343] [2022-04-28 03:09:25,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:25,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:25,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {2875#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2867#true} is VALID [2022-04-28 03:09:25,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {2867#true} assume true; {2867#true} is VALID [2022-04-28 03:09:25,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2867#true} {2867#true} #225#return; {2867#true} is VALID [2022-04-28 03:09:25,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {2867#true} call ULTIMATE.init(); {2875#(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-28 03:09:25,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {2875#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {2867#true} is VALID [2022-04-28 03:09:25,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {2867#true} assume true; {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2867#true} {2867#true} #225#return; {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {2867#true} call #t~ret11 := main(); {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {2867#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {2867#true} assume !!(~main__urilen~0 <= 1000000); {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {2867#true} assume !!(~main__urilen~0 >= -1000000); {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {2867#true} assume !!(~main__tokenlen~0 <= 1000000); {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {2867#true} assume !!(~main__tokenlen~0 >= -1000000); {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {2867#true} assume !!(~main__scheme~0 <= 1000000); {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {2867#true} assume !!(~main__scheme~0 >= -1000000); {2867#true} is VALID [2022-04-28 03:09:25,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {2867#true} assume ~main__urilen~0 > 0; {2867#true} is VALID [2022-04-28 03:09:25,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {2867#true} assume ~main__tokenlen~0 > 0; {2867#true} is VALID [2022-04-28 03:09:25,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {2867#true} assume ~main__scheme~0 >= 0; {2867#true} is VALID [2022-04-28 03:09:25,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {2867#true} assume !(0 == ~main__scheme~0); {2867#true} is VALID [2022-04-28 03:09:25,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {2867#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2867#true} is VALID [2022-04-28 03:09:25,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {2867#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2867#true} is VALID [2022-04-28 03:09:25,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {2867#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {2867#true} is VALID [2022-04-28 03:09:25,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {2867#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2872#(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-28 03:09:25,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {2872#(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)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:25,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~3); {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:25,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(~main__cp~0 != ~main__urilen~0 - 1); {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:25,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {2873#(not (<= main_~main__urilen~0 main_~main__cp~0))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2874#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-28 03:09:25,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {2874#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {2868#false} is VALID [2022-04-28 03:09:25,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {2868#false} assume !false; {2868#false} is VALID [2022-04-28 03:09:25,540 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-28 03:09:25,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:25,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764850343] [2022-04-28 03:09:25,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764850343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:25,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:25,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:25,541 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:25,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649360613] [2022-04-28 03:09:25,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649360613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:25,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:25,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238475503] [2022-04-28 03:09:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:25,542 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-28 03:09:25,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:25,542 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-28 03:09:25,555 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-28 03:09:25,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:25,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:25,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:25,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:25,556 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-28 03:09:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:26,150 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2022-04-28 03:09:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:09:26,150 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-28 03:09:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:26,150 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-28 03:09:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-28 03:09:26,162 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-28 03:09:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-04-28 03:09:26,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 114 transitions. [2022-04-28 03:09:26,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:26,244 INFO L225 Difference]: With dead ends: 108 [2022-04-28 03:09:26,244 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 03:09:26,244 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-28 03:09:26,244 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-28 03:09:26,245 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-28 03:09:26,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 03:09:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2022-04-28 03:09:26,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:26,390 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-28 03:09:26,390 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-28 03:09:26,391 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-28 03:09:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:26,393 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-28 03:09:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-28 03:09:26,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:26,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:26,393 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-28 03:09:26,393 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-28 03:09:26,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:26,395 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-04-28 03:09:26,395 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-28 03:09:26,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:26,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:26,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:26,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:26,396 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-28 03:09:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2022-04-28 03:09:26,397 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2022-04-28 03:09:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:26,398 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2022-04-28 03:09:26,398 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-28 03:09:26,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 84 transitions. [2022-04-28 03:09:26,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:26,489 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2022-04-28 03:09:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:09:26,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:26,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] [2022-04-28 03:09:26,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:09:26,490 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-28 03:09:26,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:26,490 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 1 times [2022-04-28 03:09:26,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:26,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1819150314] [2022-04-28 03:09:26,491 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:26,491 INFO L85 PathProgramCache]: Analyzing trace with hash 160385998, now seen corresponding path program 2 times [2022-04-28 03:09:26,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:26,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013710509] [2022-04-28 03:09:26,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:26,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:26,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {3483#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3475#true} is VALID [2022-04-28 03:09:26,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {3475#true} assume true; {3475#true} is VALID [2022-04-28 03:09:26,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3475#true} {3475#true} #225#return; {3475#true} is VALID [2022-04-28 03:09:26,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {3475#true} call ULTIMATE.init(); {3483#(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-28 03:09:26,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {3483#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {3475#true} is VALID [2022-04-28 03:09:26,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {3475#true} assume true; {3475#true} is VALID [2022-04-28 03:09:26,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3475#true} {3475#true} #225#return; {3475#true} is VALID [2022-04-28 03:09:26,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {3475#true} call #t~ret11 := main(); {3475#true} is VALID [2022-04-28 03:09:26,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {3475#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {3475#true} is VALID [2022-04-28 03:09:26,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {3475#true} assume !!(~main__urilen~0 <= 1000000); {3475#true} is VALID [2022-04-28 03:09:26,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {3475#true} assume !!(~main__urilen~0 >= -1000000); {3475#true} is VALID [2022-04-28 03:09:26,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {3475#true} assume !!(~main__tokenlen~0 <= 1000000); {3475#true} is VALID [2022-04-28 03:09:26,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {3475#true} assume !!(~main__tokenlen~0 >= -1000000); {3475#true} is VALID [2022-04-28 03:09:26,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {3475#true} assume !!(~main__scheme~0 <= 1000000); {3475#true} is VALID [2022-04-28 03:09:26,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {3475#true} assume !!(~main__scheme~0 >= -1000000); {3475#true} is VALID [2022-04-28 03:09:26,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {3475#true} assume ~main__urilen~0 > 0; {3475#true} is VALID [2022-04-28 03:09:26,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {3475#true} assume ~main__tokenlen~0 > 0; {3475#true} is VALID [2022-04-28 03:09:26,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {3475#true} assume ~main__scheme~0 >= 0; {3475#true} is VALID [2022-04-28 03:09:26,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {3475#true} assume !(0 == ~main__scheme~0); {3475#true} is VALID [2022-04-28 03:09:26,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {3475#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3475#true} is VALID [2022-04-28 03:09:26,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3475#true} is VALID [2022-04-28 03:09:26,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {3475#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {3475#true} is VALID [2022-04-28 03:09:26,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {3475#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3475#true} is VALID [2022-04-28 03:09:26,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {3475#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3480#(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-28 03:09:26,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {3480#(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)))} assume !(0 == ~__VERIFIER_assert__cond~3); {3481#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:26,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {3481#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {3481#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:26,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {3481#(<= 0 main_~main__cp~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {3481#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:26,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {3481#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {3482#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2022-04-28 03:09:26,592 INFO L290 TraceCheckUtils]: 25: Hoare triple {3482#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {3476#false} is VALID [2022-04-28 03:09:26,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {3476#false} assume !false; {3476#false} is VALID [2022-04-28 03:09:26,592 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-28 03:09:26,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:26,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013710509] [2022-04-28 03:09:26,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013710509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:26,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:26,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:26,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:26,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1819150314] [2022-04-28 03:09:26,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1819150314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:26,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:26,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:26,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103612948] [2022-04-28 03:09:26,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:26,594 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-28 03:09:26,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:26,594 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-28 03:09:26,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-28 03:09:26,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:26,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:26,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:26,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:26,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-28 03:09:27,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:27,116 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2022-04-28 03:09:27,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:27,117 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-28 03:09:27,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:27,117 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-28 03:09:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-28 03:09:27,119 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-28 03:09:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2022-04-28 03:09:27,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2022-04-28 03:09:27,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:27,213 INFO L225 Difference]: With dead ends: 121 [2022-04-28 03:09:27,213 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 03:09:27,214 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-28 03:09:27,215 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-28 03:09:27,215 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-28 03:09:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 03:09:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2022-04-28 03:09:27,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:27,376 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-28 03:09:27,380 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-28 03:09:27,380 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-28 03:09:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:27,382 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-28 03:09:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-28 03:09:27,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:27,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:27,383 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-28 03:09:27,383 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-28 03:09:27,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:27,385 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2022-04-28 03:09:27,385 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2022-04-28 03:09:27,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:27,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:27,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:27,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:27,385 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-28 03:09:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2022-04-28 03:09:27,387 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2022-04-28 03:09:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:27,387 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2022-04-28 03:09:27,387 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-28 03:09:27,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 82 transitions. [2022-04-28 03:09:27,486 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-28 03:09:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2022-04-28 03:09:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:09:27,487 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:27,487 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-28 03:09:27,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 03:09:27,487 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-28 03:09:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 1 times [2022-04-28 03:09:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:27,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [626425685] [2022-04-28 03:09:27,488 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:27,488 INFO L85 PathProgramCache]: Analyzing trace with hash 276133967, now seen corresponding path program 2 times [2022-04-28 03:09:27,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:27,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21007804] [2022-04-28 03:09:27,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:27,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:27,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {4134#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4126#true} is VALID [2022-04-28 03:09:27,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {4126#true} assume true; {4126#true} is VALID [2022-04-28 03:09:27,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4126#true} {4126#true} #225#return; {4126#true} is VALID [2022-04-28 03:09:27,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {4126#true} call ULTIMATE.init(); {4134#(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-28 03:09:27,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {4134#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4126#true} is VALID [2022-04-28 03:09:27,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {4126#true} assume true; {4126#true} is VALID [2022-04-28 03:09:27,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4126#true} {4126#true} #225#return; {4126#true} is VALID [2022-04-28 03:09:27,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {4126#true} call #t~ret11 := main(); {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {4126#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {4126#true} assume !!(~main__urilen~0 <= 1000000); {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {4126#true} assume !!(~main__urilen~0 >= -1000000); {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {4126#true} assume !!(~main__tokenlen~0 <= 1000000); {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {4126#true} assume !!(~main__tokenlen~0 >= -1000000); {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {4126#true} assume !!(~main__scheme~0 <= 1000000); {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {4126#true} assume !!(~main__scheme~0 >= -1000000); {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {4126#true} assume ~main__urilen~0 > 0; {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {4126#true} assume ~main__tokenlen~0 > 0; {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {4126#true} assume ~main__scheme~0 >= 0; {4126#true} is VALID [2022-04-28 03:09:27,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {4126#true} assume !(0 == ~main__scheme~0); {4126#true} is VALID [2022-04-28 03:09:27,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {4126#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4126#true} is VALID [2022-04-28 03:09:27,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {4126#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4126#true} is VALID [2022-04-28 03:09:27,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {4126#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4126#true} is VALID [2022-04-28 03:09:27,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {4126#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4126#true} is VALID [2022-04-28 03:09:27,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {4126#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4131#(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-28 03:09:27,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {4131#(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)))} assume !(0 == ~__VERIFIER_assert__cond~3); {4132#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:27,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {4132#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 != ~main__urilen~0 - 1); {4132#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:27,555 INFO L290 TraceCheckUtils]: 23: Hoare triple {4132#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4132#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:27,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {4132#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4133#(not (= main_~__VERIFIER_assert__cond~5 0))} is VALID [2022-04-28 03:09:27,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {4133#(not (= main_~__VERIFIER_assert__cond~5 0))} assume 0 == ~__VERIFIER_assert__cond~5; {4127#false} is VALID [2022-04-28 03:09:27,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {4127#false} assume !false; {4127#false} is VALID [2022-04-28 03:09:27,556 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-28 03:09:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:27,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21007804] [2022-04-28 03:09:27,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21007804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:27,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:27,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:27,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:27,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [626425685] [2022-04-28 03:09:27,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [626425685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:27,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:27,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541118629] [2022-04-28 03:09:27,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:27,557 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-28 03:09:27,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:27,557 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-28 03:09:27,570 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-28 03:09:27,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:27,571 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-28 03:09:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:27,912 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2022-04-28 03:09:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:27,912 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-28 03:09:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:27,912 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-28 03:09:27,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 03:09:27,913 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-28 03:09:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-28 03:09:27,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-28 03:09:27,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:27,979 INFO L225 Difference]: With dead ends: 77 [2022-04-28 03:09:27,979 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:09:27,979 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-28 03:09:27,980 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-28 03:09:27,980 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-28 03:09:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:09:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-28 03:09:28,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:28,101 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-28 03:09:28,102 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-28 03:09:28,102 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-28 03:09:28,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:28,103 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-28 03:09:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-28 03:09:28,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:28,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:28,103 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-28 03:09:28,104 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-28 03:09:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:28,105 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-28 03:09:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-28 03:09:28,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:28,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:28,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:28,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:28,105 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-28 03:09:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-04-28 03:09:28,106 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2022-04-28 03:09:28,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:28,106 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-04-28 03:09:28,107 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-28 03:09:28,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 80 transitions. [2022-04-28 03:09:28,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-04-28 03:09:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:09:28,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:28,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] [2022-04-28 03:09:28,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 03:09:28,207 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-28 03:09:28,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 1 times [2022-04-28 03:09:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:28,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [24847527] [2022-04-28 03:09:28,208 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash -923129547, now seen corresponding path program 2 times [2022-04-28 03:09:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:28,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215531507] [2022-04-28 03:09:28,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:28,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:28,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:28,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {4603#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4597#true} is VALID [2022-04-28 03:09:28,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {4597#true} assume true; {4597#true} is VALID [2022-04-28 03:09:28,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4597#true} {4597#true} #225#return; {4597#true} is VALID [2022-04-28 03:09:28,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {4597#true} call ULTIMATE.init(); {4603#(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-28 03:09:28,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {4603#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {4597#true} is VALID [2022-04-28 03:09:28,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {4597#true} assume true; {4597#true} is VALID [2022-04-28 03:09:28,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4597#true} {4597#true} #225#return; {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {4597#true} call #t~ret11 := main(); {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {4597#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {4597#true} assume !!(~main__urilen~0 <= 1000000); {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {4597#true} assume !!(~main__urilen~0 >= -1000000); {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {4597#true} assume !!(~main__tokenlen~0 <= 1000000); {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {4597#true} assume !!(~main__tokenlen~0 >= -1000000); {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {4597#true} assume !!(~main__scheme~0 <= 1000000); {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {4597#true} assume !!(~main__scheme~0 >= -1000000); {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {4597#true} assume ~main__urilen~0 > 0; {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {4597#true} assume ~main__tokenlen~0 > 0; {4597#true} is VALID [2022-04-28 03:09:28,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {4597#true} assume ~main__scheme~0 >= 0; {4597#true} is VALID [2022-04-28 03:09:28,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {4597#true} assume !(0 == ~main__scheme~0); {4597#true} is VALID [2022-04-28 03:09:28,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {4597#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4597#true} is VALID [2022-04-28 03:09:28,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4597#true} is VALID [2022-04-28 03:09:28,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {4597#true} is VALID [2022-04-28 03:09:28,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {4597#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4597#true} is VALID [2022-04-28 03:09:28,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4597#true} is VALID [2022-04-28 03:09:28,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {4597#true} assume !(0 == ~__VERIFIER_assert__cond~3); {4597#true} is VALID [2022-04-28 03:09:28,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {4597#true} assume !(~main__cp~0 != ~main__urilen~0 - 1); {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-28 03:09:28,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-28 03:09:28,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-28 03:09:28,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(0 == ~__VERIFIER_assert__cond~5); {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} is VALID [2022-04-28 03:09:28,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {4602#(= (+ (- 1) main_~main__urilen~0 (* main_~main__cp~0 (- 1))) 0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4598#false} is VALID [2022-04-28 03:09:28,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {4598#false} assume 0 == ~__VERIFIER_assert__cond~6; {4598#false} is VALID [2022-04-28 03:09:28,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {4598#false} assume !false; {4598#false} is VALID [2022-04-28 03:09:28,260 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-28 03:09:28,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:28,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215531507] [2022-04-28 03:09:28,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215531507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:28,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:28,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:09:28,261 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:28,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [24847527] [2022-04-28 03:09:28,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [24847527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:28,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:28,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:09:28,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170576980] [2022-04-28 03:09:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:28,261 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-28 03:09:28,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:28,262 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-28 03:09:28,275 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-28 03:09:28,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:09:28,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:28,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:09:28,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:09:28,276 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-28 03:09:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:28,532 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-04-28 03:09:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:09:28,532 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-28 03:09:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:28,533 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-28 03:09:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-28 03:09:28,534 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-28 03:09:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-28 03:09:28,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-28 03:09:28,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:28,614 INFO L225 Difference]: With dead ends: 115 [2022-04-28 03:09:28,614 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:09:28,615 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-28 03:09:28,615 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:28,615 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.0s Time] [2022-04-28 03:09:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:09:28,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-28 03:09:28,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:28,732 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-28 03:09:28,733 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-28 03:09:28,733 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-28 03:09:28,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:28,735 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-28 03:09:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-28 03:09:28,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:28,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:28,736 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-28 03:09:28,736 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-28 03:09:28,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:28,736 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2022-04-28 03:09:28,737 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-28 03:09:28,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:28,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:28,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:28,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:28,737 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-28 03:09:28,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-28 03:09:28,738 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2022-04-28 03:09:28,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:28,738 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-28 03:09:28,738 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-28 03:09:28,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 78 transitions. [2022-04-28 03:09:28,835 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-28 03:09:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-28 03:09:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:09:28,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:28,835 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-28 03:09:28,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 03:09:28,835 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-28 03:09:28,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 1 times [2022-04-28 03:09:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:28,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1635580242] [2022-04-28 03:09:28,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1988983653, now seen corresponding path program 2 times [2022-04-28 03:09:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:28,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636038901] [2022-04-28 03:09:28,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:28,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:28,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {5146#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5138#true} is VALID [2022-04-28 03:09:28,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 03:09:28,923 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5138#true} {5138#true} #225#return; {5138#true} is VALID [2022-04-28 03:09:28,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {5138#true} call ULTIMATE.init(); {5146#(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-28 03:09:28,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {5146#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5138#true} is VALID [2022-04-28 03:09:28,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {5138#true} assume true; {5138#true} is VALID [2022-04-28 03:09:28,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5138#true} {5138#true} #225#return; {5138#true} is VALID [2022-04-28 03:09:28,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {5138#true} call #t~ret11 := main(); {5138#true} is VALID [2022-04-28 03:09:28,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {5138#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {5138#true} assume !!(~main__urilen~0 <= 1000000); {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {5138#true} assume !!(~main__urilen~0 >= -1000000); {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {5138#true} assume !!(~main__tokenlen~0 <= 1000000); {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {5138#true} assume !!(~main__tokenlen~0 >= -1000000); {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {5138#true} assume !!(~main__scheme~0 <= 1000000); {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {5138#true} assume !!(~main__scheme~0 >= -1000000); {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {5138#true} assume ~main__urilen~0 > 0; {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {5138#true} assume ~main__tokenlen~0 > 0; {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {5138#true} assume ~main__scheme~0 >= 0; {5138#true} is VALID [2022-04-28 03:09:28,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {5138#true} assume !(0 == ~main__scheme~0); {5138#true} is VALID [2022-04-28 03:09:28,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {5138#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:28,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:28,926 INFO L290 TraceCheckUtils]: 18: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:28,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:28,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:28,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5143#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:28,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {5143#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-28 03:09:28,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~main____CPAchecker_TMP_1~0); {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-28 03:09:28,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-28 03:09:28,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-28 03:09:28,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(0 == ~__VERIFIER_assert__cond~5); {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} is VALID [2022-04-28 03:09:28,929 INFO L290 TraceCheckUtils]: 27: Hoare triple {5144#(and (< main_~main__cp~0 main_~main__urilen~0) (not (= main_~main__urilen~0 (+ main_~main__cp~0 1))))} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5145#(not (= main_~__VERIFIER_assert__cond~6 0))} is VALID [2022-04-28 03:09:28,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {5145#(not (= main_~__VERIFIER_assert__cond~6 0))} assume 0 == ~__VERIFIER_assert__cond~6; {5139#false} is VALID [2022-04-28 03:09:28,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {5139#false} assume !false; {5139#false} is VALID [2022-04-28 03:09:28,930 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-28 03:09:28,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:28,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636038901] [2022-04-28 03:09:28,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636038901] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:28,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:28,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:28,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:28,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1635580242] [2022-04-28 03:09:28,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1635580242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:28,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:28,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:28,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220701750] [2022-04-28 03:09:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:28,931 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-28 03:09:28,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:28,931 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-28 03:09:28,947 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-28 03:09:28,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:28,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:28,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:28,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:28,948 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-28 03:09:29,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:29,290 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-04-28 03:09:29,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:29,290 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-28 03:09:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:29,290 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-28 03:09:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-28 03:09:29,291 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-28 03:09:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2022-04-28 03:09:29,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2022-04-28 03:09:29,351 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-28 03:09:29,352 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:09:29,352 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 03:09:29,352 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-28 03:09:29,352 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 183 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:29,352 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.0s Time] [2022-04-28 03:09:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 03:09:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-28 03:09:29,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:29,502 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-28 03:09:29,502 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-28 03:09:29,502 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-28 03:09:29,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:29,503 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-28 03:09:29,503 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-28 03:09:29,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:29,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:29,504 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-28 03:09:29,504 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-28 03:09:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:29,513 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-04-28 03:09:29,513 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-04-28 03:09:29,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:29,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:29,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:29,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:29,514 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-28 03:09:29,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2022-04-28 03:09:29,515 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2022-04-28 03:09:29,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:29,515 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2022-04-28 03:09:29,515 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-28 03:09:29,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 76 transitions. [2022-04-28 03:09:29,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2022-04-28 03:09:29,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:09:29,618 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:29,619 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-28 03:09:29,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 03:09:29,619 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-28 03:09:29,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:29,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 1 times [2022-04-28 03:09:29,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:29,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1120336908] [2022-04-28 03:09:29,620 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2054875672, now seen corresponding path program 2 times [2022-04-28 03:09:29,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:29,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952829546] [2022-04-28 03:09:29,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:29,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:29,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:29,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {5611#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID [2022-04-28 03:09:29,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-28 03:09:29,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5611#(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-28 03:09:29,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {5611#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret11 := main(); {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#true} assume !!(~main__urilen~0 <= 1000000); {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {5603#true} assume !!(~main__urilen~0 >= -1000000); {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {5603#true} assume !!(~main__tokenlen~0 <= 1000000); {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {5603#true} assume !!(~main__tokenlen~0 >= -1000000); {5603#true} is VALID [2022-04-28 03:09:29,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#true} assume !!(~main__scheme~0 <= 1000000); {5603#true} is VALID [2022-04-28 03:09:29,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#true} assume !!(~main__scheme~0 >= -1000000); {5603#true} is VALID [2022-04-28 03:09:29,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {5603#true} assume ~main__urilen~0 > 0; {5603#true} is VALID [2022-04-28 03:09:29,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#true} assume ~main__tokenlen~0 > 0; {5603#true} is VALID [2022-04-28 03:09:29,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {5603#true} assume ~main__scheme~0 >= 0; {5603#true} is VALID [2022-04-28 03:09:29,671 INFO L290 TraceCheckUtils]: 15: Hoare triple {5603#true} assume !(0 == ~main__scheme~0); {5603#true} is VALID [2022-04-28 03:09:29,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {5603#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,673 INFO L290 TraceCheckUtils]: 19: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5610#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2022-04-28 03:09:29,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {5610#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {5604#false} is VALID [2022-04-28 03:09:29,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2022-04-28 03:09:29,676 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-28 03:09:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:29,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952829546] [2022-04-28 03:09:29,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952829546] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:29,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862706856] [2022-04-28 03:09:29,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:09:29,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:29,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:29,678 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-28 03:09:29,683 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-28 03:09:29,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:09:29,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:29,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:09:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:29,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:29,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5603#true} is VALID [2022-04-28 03:09:29,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID [2022-04-28 03:09:29,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret11 := main(); {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#true} assume !!(~main__urilen~0 <= 1000000); {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {5603#true} assume !!(~main__urilen~0 >= -1000000); {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {5603#true} assume !!(~main__tokenlen~0 <= 1000000); {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {5603#true} assume !!(~main__tokenlen~0 >= -1000000); {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#true} assume !!(~main__scheme~0 <= 1000000); {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#true} assume !!(~main__scheme~0 >= -1000000); {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {5603#true} assume ~main__urilen~0 > 0; {5603#true} is VALID [2022-04-28 03:09:29,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#true} assume ~main__tokenlen~0 > 0; {5603#true} is VALID [2022-04-28 03:09:29,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {5603#true} assume ~main__scheme~0 >= 0; {5603#true} is VALID [2022-04-28 03:09:29,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {5603#true} assume !(0 == ~main__scheme~0); {5603#true} is VALID [2022-04-28 03:09:29,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {5603#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:29,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-28 03:09:29,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {5604#false} is VALID [2022-04-28 03:09:29,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2022-04-28 03:09:29,950 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-28 03:09:29,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:30,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2022-04-28 03:09:30,106 INFO L290 TraceCheckUtils]: 28: Hoare triple {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {5604#false} is VALID [2022-04-28 03:09:30,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5696#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2022-04-28 03:09:30,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {5609#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {5608#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {5603#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5608#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 15: Hoare triple {5603#true} assume !(0 == ~main__scheme~0); {5603#true} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {5603#true} assume ~main__scheme~0 >= 0; {5603#true} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {5603#true} assume ~main__tokenlen~0 > 0; {5603#true} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {5603#true} assume ~main__urilen~0 > 0; {5603#true} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {5603#true} assume !!(~main__scheme~0 >= -1000000); {5603#true} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#true} assume !!(~main__scheme~0 <= 1000000); {5603#true} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {5603#true} assume !!(~main__tokenlen~0 >= -1000000); {5603#true} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {5603#true} assume !!(~main__tokenlen~0 <= 1000000); {5603#true} is VALID [2022-04-28 03:09:30,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {5603#true} assume !!(~main__urilen~0 >= -1000000); {5603#true} is VALID [2022-04-28 03:09:30,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {5603#true} assume !!(~main__urilen~0 <= 1000000); {5603#true} is VALID [2022-04-28 03:09:30,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {5603#true} is VALID [2022-04-28 03:09:30,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret11 := main(); {5603#true} is VALID [2022-04-28 03:09:30,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #225#return; {5603#true} is VALID [2022-04-28 03:09:30,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-28 03:09:30,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {5603#true} is VALID [2022-04-28 03:09:30,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5603#true} is VALID [2022-04-28 03:09:30,114 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-28 03:09:30,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862706856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:30,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:30,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-28 03:09:30,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:30,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1120336908] [2022-04-28 03:09:30,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1120336908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:30,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:30,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:30,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124039040] [2022-04-28 03:09:30,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:30,116 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-28 03:09:30,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:30,116 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-28 03:09:30,133 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-28 03:09:30,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:30,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:30,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:30,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:30,134 INFO L87 Difference]: Start difference. First operand 73 states and 76 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-28 03:09:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:30,650 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-28 03:09:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:30,651 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-28 03:09:30,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:30,651 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-28 03:09:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-28 03:09:30,652 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-28 03:09:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-04-28 03:09:30,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2022-04-28 03:09:30,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:30,737 INFO L225 Difference]: With dead ends: 111 [2022-04-28 03:09:30,737 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 03:09:30,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:09:30,738 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 187 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:30,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 87 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:30,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 03:09:30,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2022-04-28 03:09:30,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:30,894 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-28 03:09:30,894 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-28 03:09:30,894 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-28 03:09:30,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:30,895 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-28 03:09:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-28 03:09:30,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:30,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:30,896 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-28 03:09:30,896 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-28 03:09:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:30,897 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-04-28 03:09:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-04-28 03:09:30,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:30,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:30,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:30,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:30,898 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-28 03:09:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-04-28 03:09:30,899 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2022-04-28 03:09:30,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:30,899 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-04-28 03:09:30,899 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-28 03:09:30,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 73 transitions. [2022-04-28 03:09:31,001 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-28 03:09:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-04-28 03:09:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:09:31,002 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:31,002 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-28 03:09:31,020 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-28 03:09:31,211 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-28 03:09:31,224 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-28 03:09:31,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 1 times [2022-04-28 03:09:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:31,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [752472170] [2022-04-28 03:09:31,225 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:31,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1528947946, now seen corresponding path program 2 times [2022-04-28 03:09:31,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:31,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913807078] [2022-04-28 03:09:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:31,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:31,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:31,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {6388#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6380#true} is VALID [2022-04-28 03:09:31,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-28 03:09:31,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6380#true} {6380#true} #225#return; {6380#true} is VALID [2022-04-28 03:09:31,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {6380#true} call ULTIMATE.init(); {6388#(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-28 03:09:31,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {6388#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6380#true} is VALID [2022-04-28 03:09:31,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {6380#true} assume true; {6380#true} is VALID [2022-04-28 03:09:31,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6380#true} {6380#true} #225#return; {6380#true} is VALID [2022-04-28 03:09:31,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {6380#true} call #t~ret11 := main(); {6380#true} is VALID [2022-04-28 03:09:31,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {6380#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6380#true} is VALID [2022-04-28 03:09:31,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {6380#true} assume !!(~main__urilen~0 <= 1000000); {6380#true} is VALID [2022-04-28 03:09:31,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {6380#true} assume !!(~main__urilen~0 >= -1000000); {6380#true} is VALID [2022-04-28 03:09:31,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {6380#true} assume !!(~main__tokenlen~0 <= 1000000); {6380#true} is VALID [2022-04-28 03:09:31,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {6380#true} assume !!(~main__tokenlen~0 >= -1000000); {6380#true} is VALID [2022-04-28 03:09:31,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {6380#true} assume !!(~main__scheme~0 <= 1000000); {6380#true} is VALID [2022-04-28 03:09:31,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {6380#true} assume !!(~main__scheme~0 >= -1000000); {6380#true} is VALID [2022-04-28 03:09:31,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {6380#true} assume ~main__urilen~0 > 0; {6380#true} is VALID [2022-04-28 03:09:31,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {6380#true} assume ~main__tokenlen~0 > 0; {6380#true} is VALID [2022-04-28 03:09:31,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {6380#true} assume ~main__scheme~0 >= 0; {6385#(<= 0 main_~main__scheme~0)} is VALID [2022-04-28 03:09:31,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {6385#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {6385#(<= 0 main_~main__scheme~0)} is VALID [2022-04-28 03:09:31,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {6385#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {6386#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,275 INFO L290 TraceCheckUtils]: 26: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6386#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:31,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {6386#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6387#(not (= main_~__VERIFIER_assert__cond~7 0))} is VALID [2022-04-28 03:09:31,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {6387#(not (= main_~__VERIFIER_assert__cond~7 0))} assume 0 == ~__VERIFIER_assert__cond~7; {6381#false} is VALID [2022-04-28 03:09:31,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {6381#false} assume !false; {6381#false} is VALID [2022-04-28 03:09:31,276 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-28 03:09:31,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:31,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913807078] [2022-04-28 03:09:31,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913807078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:31,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:31,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:31,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [752472170] [2022-04-28 03:09:31,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [752472170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:31,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:31,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774007853] [2022-04-28 03:09:31,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:31,278 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-28 03:09:31,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:31,278 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-28 03:09:31,293 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-28 03:09:31,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:31,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:31,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:31,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:31,294 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-28 03:09:31,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:31,614 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 03:09:31,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:31,614 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-28 03:09:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:31,614 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-28 03:09:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-28 03:09:31,615 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-28 03:09:31,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-04-28 03:09:31,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-04-28 03:09:31,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:31,674 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:09:31,674 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 03:09:31,674 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-28 03:09:31,675 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 170 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:31,675 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.0s Time] [2022-04-28 03:09:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 03:09:31,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 03:09:31,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:31,820 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-28 03:09:31,820 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-28 03:09:31,820 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-28 03:09:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:31,825 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-28 03:09:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-28 03:09:31,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:31,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:31,825 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-28 03:09:31,825 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-28 03:09:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:31,826 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-28 03:09:31,826 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-28 03:09:31,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:31,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:31,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:31,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:31,826 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-28 03:09:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-04-28 03:09:31,827 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2022-04-28 03:09:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:31,827 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-04-28 03:09:31,828 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-28 03:09:31,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 71 transitions. [2022-04-28 03:09:31,915 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-28 03:09:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-28 03:09:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:09:31,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:31,915 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-28 03:09:31,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 03:09:31,916 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-28 03:09:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 1 times [2022-04-28 03:09:31,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:31,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529652629] [2022-04-28 03:09:31,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:31,916 INFO L85 PathProgramCache]: Analyzing trace with hash -726812143, now seen corresponding path program 2 times [2022-04-28 03:09:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:31,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5235261] [2022-04-28 03:09:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:31,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:31,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:31,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {6817#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID [2022-04-28 03:09:31,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {6809#true} assume true; {6809#true} is VALID [2022-04-28 03:09:31,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID [2022-04-28 03:09:31,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {6809#true} call ULTIMATE.init(); {6817#(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-28 03:09:31,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {6817#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID [2022-04-28 03:09:31,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {6809#true} assume true; {6809#true} is VALID [2022-04-28 03:09:31,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID [2022-04-28 03:09:31,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {6809#true} call #t~ret11 := main(); {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {6809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {6809#true} assume !!(~main__urilen~0 <= 1000000); {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#true} assume !!(~main__urilen~0 >= -1000000); {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#true} assume !!(~main__tokenlen~0 <= 1000000); {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#true} assume !!(~main__tokenlen~0 >= -1000000); {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {6809#true} assume !!(~main__scheme~0 <= 1000000); {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {6809#true} assume !!(~main__scheme~0 >= -1000000); {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#true} assume ~main__urilen~0 > 0; {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#true} assume ~main__tokenlen~0 > 0; {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#true} assume ~main__scheme~0 >= 0; {6809#true} is VALID [2022-04-28 03:09:31,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#true} assume !(0 == ~main__scheme~0); {6809#true} is VALID [2022-04-28 03:09:31,977 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:31,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6816#(not (= main_~__VERIFIER_assert__cond~4 0))} is VALID [2022-04-28 03:09:31,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {6816#(not (= main_~__VERIFIER_assert__cond~4 0))} assume 0 == ~__VERIFIER_assert__cond~4; {6810#false} is VALID [2022-04-28 03:09:31,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#false} assume !false; {6810#false} is VALID [2022-04-28 03:09:31,981 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-28 03:09:31,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:31,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5235261] [2022-04-28 03:09:31,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5235261] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:31,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329250932] [2022-04-28 03:09:31,981 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:09:31,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:31,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:31,982 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-28 03:09:31,983 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-28 03:09:32,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:09:32,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:32,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:09:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:32,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:32,156 INFO L272 TraceCheckUtils]: 0: Hoare triple {6809#true} call ULTIMATE.init(); {6809#true} is VALID [2022-04-28 03:09:32,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {6809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID [2022-04-28 03:09:32,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {6809#true} assume true; {6809#true} is VALID [2022-04-28 03:09:32,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID [2022-04-28 03:09:32,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {6809#true} call #t~ret11 := main(); {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {6809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {6809#true} assume !!(~main__urilen~0 <= 1000000); {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#true} assume !!(~main__urilen~0 >= -1000000); {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#true} assume !!(~main__tokenlen~0 <= 1000000); {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#true} assume !!(~main__tokenlen~0 >= -1000000); {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {6809#true} assume !!(~main__scheme~0 <= 1000000); {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {6809#true} assume !!(~main__scheme~0 >= -1000000); {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#true} assume ~main__urilen~0 > 0; {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#true} assume ~main__tokenlen~0 > 0; {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#true} assume ~main__scheme~0 >= 0; {6809#true} is VALID [2022-04-28 03:09:32,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#true} assume !(0 == ~main__scheme~0); {6809#true} is VALID [2022-04-28 03:09:32,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,159 INFO L290 TraceCheckUtils]: 19: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,159 INFO L290 TraceCheckUtils]: 20: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-28 03:09:32,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {6810#false} is VALID [2022-04-28 03:09:32,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#false} assume !false; {6810#false} is VALID [2022-04-28 03:09:32,163 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-28 03:09:32,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:32,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {6810#false} assume !false; {6810#false} is VALID [2022-04-28 03:09:32,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {6810#false} is VALID [2022-04-28 03:09:32,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6905#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2022-04-28 03:09:32,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {6815#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {6809#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6814#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:32,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {6809#true} assume !(0 == ~main__scheme~0); {6809#true} is VALID [2022-04-28 03:09:32,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {6809#true} assume ~main__scheme~0 >= 0; {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {6809#true} assume ~main__tokenlen~0 > 0; {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {6809#true} assume ~main__urilen~0 > 0; {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {6809#true} assume !!(~main__scheme~0 >= -1000000); {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {6809#true} assume !!(~main__scheme~0 <= 1000000); {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {6809#true} assume !!(~main__tokenlen~0 >= -1000000); {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {6809#true} assume !!(~main__tokenlen~0 <= 1000000); {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {6809#true} assume !!(~main__urilen~0 >= -1000000); {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {6809#true} assume !!(~main__urilen~0 <= 1000000); {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {6809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {6809#true} is VALID [2022-04-28 03:09:32,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {6809#true} call #t~ret11 := main(); {6809#true} is VALID [2022-04-28 03:09:32,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6809#true} {6809#true} #225#return; {6809#true} is VALID [2022-04-28 03:09:32,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {6809#true} assume true; {6809#true} is VALID [2022-04-28 03:09:32,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {6809#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {6809#true} is VALID [2022-04-28 03:09:32,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {6809#true} call ULTIMATE.init(); {6809#true} is VALID [2022-04-28 03:09:32,284 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-28 03:09:32,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329250932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:32,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:32,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-28 03:09:32,285 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:32,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529652629] [2022-04-28 03:09:32,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529652629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:32,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:32,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:32,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70673312] [2022-04-28 03:09:32,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:32,286 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-28 03:09:32,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:32,286 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-28 03:09:32,302 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-28 03:09:32,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:32,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:32,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:32,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:32,303 INFO L87 Difference]: Start difference. First operand 68 states and 71 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-28 03:09:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:32,656 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-28 03:09:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:32,656 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-28 03:09:32,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:32,656 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-28 03:09:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 03:09:32,657 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-28 03:09:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-04-28 03:09:32,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2022-04-28 03:09:32,705 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-28 03:09:32,705 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:09:32,705 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:09:32,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:09:32,706 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 130 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:32,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 61 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:32,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:09:32,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-28 03:09:32,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:32,837 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-28 03:09:32,837 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-28 03:09:32,837 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-28 03:09:32,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:32,838 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-28 03:09:32,838 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-28 03:09:32,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:32,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:32,838 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-28 03:09:32,839 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-28 03:09:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:32,839 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-28 03:09:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-28 03:09:32,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:32,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:32,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:32,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:32,840 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-28 03:09:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-28 03:09:32,841 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2022-04-28 03:09:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:32,841 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-28 03:09:32,841 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-28 03:09:32,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 64 transitions. [2022-04-28 03:09:32,925 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-28 03:09:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-28 03:09:32,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:09:32,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:32,925 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-28 03:09:32,943 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-28 03:09:33,126 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-28 03:09:33,126 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-28 03:09:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 1 times [2022-04-28 03:09:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:33,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883838766] [2022-04-28 03:09:33,127 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -756981884, now seen corresponding path program 2 times [2022-04-28 03:09:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:33,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100084168] [2022-04-28 03:09:33,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:33,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:33,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {7416#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7408#true} is VALID [2022-04-28 03:09:33,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {7408#true} assume true; {7408#true} is VALID [2022-04-28 03:09:33,188 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7408#true} {7408#true} #225#return; {7408#true} is VALID [2022-04-28 03:09:33,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {7408#true} call ULTIMATE.init(); {7416#(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-28 03:09:33,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {7416#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7408#true} is VALID [2022-04-28 03:09:33,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {7408#true} assume true; {7408#true} is VALID [2022-04-28 03:09:33,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7408#true} {7408#true} #225#return; {7408#true} is VALID [2022-04-28 03:09:33,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {7408#true} call #t~ret11 := main(); {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {7408#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {7408#true} assume !!(~main__urilen~0 <= 1000000); {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {7408#true} assume !!(~main__urilen~0 >= -1000000); {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {7408#true} assume !!(~main__tokenlen~0 <= 1000000); {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {7408#true} assume !!(~main__tokenlen~0 >= -1000000); {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {7408#true} assume !!(~main__scheme~0 <= 1000000); {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {7408#true} assume !!(~main__scheme~0 >= -1000000); {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {7408#true} assume ~main__urilen~0 > 0; {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {7408#true} assume ~main__tokenlen~0 > 0; {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {7408#true} assume ~main__scheme~0 >= 0; {7408#true} is VALID [2022-04-28 03:09:33,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {7408#true} assume !(0 == ~main__scheme~0); {7408#true} is VALID [2022-04-28 03:09:33,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {7408#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {7414#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7413#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:33,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {7413#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7415#(not (= main_~__VERIFIER_assert__cond~8 0))} is VALID [2022-04-28 03:09:33,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {7415#(not (= main_~__VERIFIER_assert__cond~8 0))} assume 0 == ~__VERIFIER_assert__cond~8; {7409#false} is VALID [2022-04-28 03:09:33,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {7409#false} assume !false; {7409#false} is VALID [2022-04-28 03:09:33,200 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-28 03:09:33,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:33,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100084168] [2022-04-28 03:09:33,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100084168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:33,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:33,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:33,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:33,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883838766] [2022-04-28 03:09:33,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883838766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:33,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:33,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:33,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451177178] [2022-04-28 03:09:33,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:33,201 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-28 03:09:33,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:33,201 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-28 03:09:33,219 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-28 03:09:33,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:33,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:33,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:33,219 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-28 03:09:33,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:33,520 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-28 03:09:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:33,520 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-28 03:09:33,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:33,521 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-28 03:09:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 03:09:33,521 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-28 03:09:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-28 03:09:33,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-28 03:09:33,572 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-28 03:09:33,572 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:09:33,572 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:09:33,573 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-28 03:09:33,573 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 149 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:33,573 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.0s Time] [2022-04-28 03:09:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:09:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-04-28 03:09:33,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:33,693 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-28 03:09:33,693 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-28 03:09:33,694 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-28 03:09:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:33,694 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-28 03:09:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-28 03:09:33,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:33,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:33,695 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-28 03:09:33,695 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-28 03:09:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:33,696 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-28 03:09:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-28 03:09:33,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:33,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:33,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:33,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:33,696 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-28 03:09:33,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 03:09:33,697 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2022-04-28 03:09:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:33,697 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 03:09:33,697 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-28 03:09:33,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 03:09:33,787 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-28 03:09:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 03:09:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:09:33,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:33,787 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-28 03:09:33,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 03:09:33,787 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-28 03:09:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 1 times [2022-04-28 03:09:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:33,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366483468] [2022-04-28 03:09:33,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1991598751, now seen corresponding path program 2 times [2022-04-28 03:09:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:33,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67193332] [2022-04-28 03:09:33,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:33,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:33,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {7804#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7795#true} is VALID [2022-04-28 03:09:33,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {7795#true} assume true; {7795#true} is VALID [2022-04-28 03:09:33,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7795#true} {7795#true} #225#return; {7795#true} is VALID [2022-04-28 03:09:33,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {7795#true} call ULTIMATE.init(); {7804#(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-28 03:09:33,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {7804#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {7795#true} is VALID [2022-04-28 03:09:33,849 INFO L290 TraceCheckUtils]: 2: Hoare triple {7795#true} assume true; {7795#true} is VALID [2022-04-28 03:09:33,849 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7795#true} {7795#true} #225#return; {7795#true} is VALID [2022-04-28 03:09:33,849 INFO L272 TraceCheckUtils]: 4: Hoare triple {7795#true} call #t~ret11 := main(); {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {7795#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {7795#true} assume !!(~main__urilen~0 <= 1000000); {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {7795#true} assume !!(~main__urilen~0 >= -1000000); {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {7795#true} assume !!(~main__tokenlen~0 <= 1000000); {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {7795#true} assume !!(~main__tokenlen~0 >= -1000000); {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {7795#true} assume !!(~main__scheme~0 <= 1000000); {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {7795#true} assume !!(~main__scheme~0 >= -1000000); {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {7795#true} assume ~main__urilen~0 > 0; {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {7795#true} assume ~main__tokenlen~0 > 0; {7795#true} is VALID [2022-04-28 03:09:33,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {7795#true} assume ~main__scheme~0 >= 0; {7800#(<= 0 main_~main__scheme~0)} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {7800#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {7800#(<= 0 main_~main__scheme~0)} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {7800#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {7801#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7801#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {7801#(<= 0 main_~main__cp~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {7802#(<= 1 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {7802#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7802#(<= 1 main_~main__cp~0)} is VALID [2022-04-28 03:09:33,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {7802#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7803#(not (= main_~__VERIFIER_assert__cond~9 0))} is VALID [2022-04-28 03:09:33,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {7803#(not (= main_~__VERIFIER_assert__cond~9 0))} assume 0 == ~__VERIFIER_assert__cond~9; {7796#false} is VALID [2022-04-28 03:09:33,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {7796#false} assume !false; {7796#false} is VALID [2022-04-28 03:09:33,856 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-28 03:09:33,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:33,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67193332] [2022-04-28 03:09:33,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67193332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:33,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:33,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:33,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:33,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366483468] [2022-04-28 03:09:33,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366483468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:33,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:33,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:09:33,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238376702] [2022-04-28 03:09:33,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:33,857 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-28 03:09:33,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:33,857 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-28 03:09:33,876 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-28 03:09:33,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:09:33,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:33,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:09:33,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:33,877 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-28 03:09:34,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:34,277 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-28 03:09:34,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:34,277 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-28 03:09:34,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:34,277 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-28 03:09:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-28 03:09:34,278 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-28 03:09:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-28 03:09:34,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-28 03:09:34,329 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-28 03:09:34,330 INFO L225 Difference]: With dead ends: 71 [2022-04-28 03:09:34,330 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:09:34,330 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-28 03:09:34,330 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-28 03:09:34,331 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-28 03:09:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:09:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-04-28 03:09:34,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:34,453 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-28 03:09:34,453 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-28 03:09:34,453 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-28 03:09:34,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:34,454 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-28 03:09:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-28 03:09:34,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:34,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:34,454 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-28 03:09:34,455 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-28 03:09:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:34,455 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-04-28 03:09:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2022-04-28 03:09:34,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:34,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:34,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:34,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:34,456 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-28 03:09:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-04-28 03:09:34,456 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2022-04-28 03:09:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:34,457 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-04-28 03:09:34,457 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-28 03:09:34,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 60 transitions. [2022-04-28 03:09:34,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-04-28 03:09:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:09:34,535 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:34,536 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-28 03:09:34,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 03:09:34,536 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-28 03:09:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:34,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 1 times [2022-04-28 03:09:34,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:34,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [991077988] [2022-04-28 03:09:34,536 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1037071699, now seen corresponding path program 2 times [2022-04-28 03:09:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:34,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630806045] [2022-04-28 03:09:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:34,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:34,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {8219#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8211#true} is VALID [2022-04-28 03:09:34,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {8211#true} assume true; {8211#true} is VALID [2022-04-28 03:09:34,591 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8211#true} {8211#true} #225#return; {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {8211#true} call ULTIMATE.init(); {8219#(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-28 03:09:34,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {8219#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {8211#true} assume true; {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8211#true} {8211#true} #225#return; {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {8211#true} call #t~ret11 := main(); {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {8211#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {8211#true} assume !!(~main__urilen~0 <= 1000000); {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {8211#true} assume !!(~main__urilen~0 >= -1000000); {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {8211#true} assume !!(~main__tokenlen~0 <= 1000000); {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {8211#true} assume !!(~main__tokenlen~0 >= -1000000); {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L290 TraceCheckUtils]: 10: Hoare triple {8211#true} assume !!(~main__scheme~0 <= 1000000); {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {8211#true} assume !!(~main__scheme~0 >= -1000000); {8211#true} is VALID [2022-04-28 03:09:34,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {8211#true} assume ~main__urilen~0 > 0; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {8211#true} assume ~main__tokenlen~0 > 0; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {8211#true} assume ~main__scheme~0 >= 0; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {8211#true} assume !(0 == ~main__scheme~0); {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {8211#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {8211#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {8211#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {8211#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {8211#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8211#true} is VALID [2022-04-28 03:09:34,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {8211#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8211#true} is VALID [2022-04-28 03:09:34,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8211#true} is VALID [2022-04-28 03:09:34,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {8211#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8211#true} is VALID [2022-04-28 03:09:34,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {8211#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {8211#true} is VALID [2022-04-28 03:09:34,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {8211#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8216#(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-28 03:09:34,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {8216#(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)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:34,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:34,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:34,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {8217#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8218#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-28 03:09:34,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {8218#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {8212#false} is VALID [2022-04-28 03:09:34,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {8212#false} assume !false; {8212#false} is VALID [2022-04-28 03:09:34,596 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-28 03:09:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630806045] [2022-04-28 03:09:34,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630806045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:34,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:34,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:34,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [991077988] [2022-04-28 03:09:34,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [991077988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:34,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:34,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:34,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998542803] [2022-04-28 03:09:34,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:34,597 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-28 03:09:34,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:34,597 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-28 03:09:34,615 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-28 03:09:34,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:34,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:34,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:34,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:34,618 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-28 03:09:35,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:35,169 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-28 03:09:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:09:35,169 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-28 03:09:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:35,170 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-28 03:09:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-28 03:09:35,170 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-28 03:09:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2022-04-28 03:09:35,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2022-04-28 03:09:35,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:35,236 INFO L225 Difference]: With dead ends: 91 [2022-04-28 03:09:35,236 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 03:09:35,236 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-28 03:09:35,236 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-28 03:09:35,237 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-28 03:09:35,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 03:09:35,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-04-28 03:09:35,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:35,371 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-28 03:09:35,372 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-28 03:09:35,372 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-28 03:09:35,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:35,373 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-28 03:09:35,373 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-28 03:09:35,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:35,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:35,373 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-28 03:09:35,373 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-28 03:09:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:35,374 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-04-28 03:09:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-04-28 03:09:35,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:35,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:35,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:35,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:35,375 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-28 03:09:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-28 03:09:35,375 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2022-04-28 03:09:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:35,376 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-28 03:09:35,376 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-28 03:09:35,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 63 transitions. [2022-04-28 03:09:35,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:35,472 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-28 03:09:35,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:09:35,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:35,472 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-28 03:09:35,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 03:09:35,473 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-28 03:09:35,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 1 times [2022-04-28 03:09:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:35,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1748496295] [2022-04-28 03:09:35,473 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2084448405, now seen corresponding path program 2 times [2022-04-28 03:09:35,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:35,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576280349] [2022-04-28 03:09:35,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:35,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:35,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {8723#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8715#true} is VALID [2022-04-28 03:09:35,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {8715#true} assume true; {8715#true} is VALID [2022-04-28 03:09:35,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8715#true} {8715#true} #225#return; {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {8715#true} call ULTIMATE.init(); {8723#(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-28 03:09:35,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {8723#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {8715#true} assume true; {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8715#true} {8715#true} #225#return; {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {8715#true} call #t~ret11 := main(); {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {8715#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {8715#true} assume !!(~main__urilen~0 <= 1000000); {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {8715#true} assume !!(~main__urilen~0 >= -1000000); {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {8715#true} assume !!(~main__tokenlen~0 <= 1000000); {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {8715#true} assume !!(~main__tokenlen~0 >= -1000000); {8715#true} is VALID [2022-04-28 03:09:35,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {8715#true} assume !!(~main__scheme~0 <= 1000000); {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {8715#true} assume !!(~main__scheme~0 >= -1000000); {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {8715#true} assume ~main__urilen~0 > 0; {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {8715#true} assume ~main__tokenlen~0 > 0; {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {8715#true} assume ~main__scheme~0 >= 0; {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {8715#true} assume !(0 == ~main__scheme~0); {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {8715#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {8715#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {8715#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {8715#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8715#true} is VALID [2022-04-28 03:09:35,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {8715#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8715#true} is VALID [2022-04-28 03:09:35,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8715#true} is VALID [2022-04-28 03:09:35,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8715#true} is VALID [2022-04-28 03:09:35,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {8715#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8715#true} is VALID [2022-04-28 03:09:35,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8715#true} is VALID [2022-04-28 03:09:35,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8715#true} is VALID [2022-04-28 03:09:35,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {8715#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {8715#true} is VALID [2022-04-28 03:09:35,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {8715#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8715#true} is VALID [2022-04-28 03:09:35,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {8715#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8720#(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-28 03:09:35,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {8720#(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)))} assume !(0 == ~__VERIFIER_assert__cond~9); {8721#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:35,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {8721#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {8721#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:35,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {8721#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8721#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:35,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {8721#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8722#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2022-04-28 03:09:35,544 INFO L290 TraceCheckUtils]: 37: Hoare triple {8722#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {8716#false} is VALID [2022-04-28 03:09:35,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {8716#false} assume !false; {8716#false} is VALID [2022-04-28 03:09:35,544 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-28 03:09:35,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:35,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576280349] [2022-04-28 03:09:35,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576280349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:35,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:35,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:35,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:35,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1748496295] [2022-04-28 03:09:35,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1748496295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:35,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:35,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:35,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861633159] [2022-04-28 03:09:35,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:35,545 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-28 03:09:35,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:35,546 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-28 03:09:35,571 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-28 03:09:35,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:35,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:35,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:35,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:35,571 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-28 03:09:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:35,906 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-28 03:09:35,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:35,907 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-28 03:09:35,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:35,907 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-28 03:09:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-28 03:09:35,907 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-28 03:09:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-28 03:09:35,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-28 03:09:35,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:35,950 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:09:35,950 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:09:35,951 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-28 03:09:35,951 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-28 03:09:35,951 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-28 03:09:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:09:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 03:09:36,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:36,072 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-28 03:09:36,072 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-28 03:09:36,072 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-28 03:09:36,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,073 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-28 03:09:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-28 03:09:36,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:36,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:36,073 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-28 03:09:36,073 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-28 03:09:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,074 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-28 03:09:36,074 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-28 03:09:36,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:36,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:36,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:36,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:36,074 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-28 03:09:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-28 03:09:36,075 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2022-04-28 03:09:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:36,075 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-28 03:09:36,075 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-28 03:09:36,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2022-04-28 03:09:36,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-28 03:09:36,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:09:36,175 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:36,175 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-28 03:09:36,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 03:09:36,175 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-28 03:09:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 1 times [2022-04-28 03:09:36,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:36,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [456119867] [2022-04-28 03:09:36,176 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1700057906, now seen corresponding path program 2 times [2022-04-28 03:09:36,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:36,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975871605] [2022-04-28 03:09:36,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:36,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:36,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:36,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {9097#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9090#true} is VALID [2022-04-28 03:09:36,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {9090#true} assume true; {9090#true} is VALID [2022-04-28 03:09:36,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9090#true} {9090#true} #225#return; {9090#true} is VALID [2022-04-28 03:09:36,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {9090#true} call ULTIMATE.init(); {9097#(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-28 03:09:36,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {9097#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9090#true} is VALID [2022-04-28 03:09:36,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {9090#true} assume true; {9090#true} is VALID [2022-04-28 03:09:36,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9090#true} {9090#true} #225#return; {9090#true} is VALID [2022-04-28 03:09:36,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {9090#true} call #t~ret11 := main(); {9090#true} is VALID [2022-04-28 03:09:36,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {9090#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {9090#true} is VALID [2022-04-28 03:09:36,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {9090#true} assume !!(~main__urilen~0 <= 1000000); {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {9090#true} assume !!(~main__urilen~0 >= -1000000); {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {9090#true} assume !!(~main__tokenlen~0 <= 1000000); {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {9090#true} assume !!(~main__tokenlen~0 >= -1000000); {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {9090#true} assume !!(~main__scheme~0 <= 1000000); {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {9090#true} assume !!(~main__scheme~0 >= -1000000); {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {9090#true} assume ~main__urilen~0 > 0; {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {9090#true} assume ~main__tokenlen~0 > 0; {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {9090#true} assume ~main__scheme~0 >= 0; {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {9090#true} assume !(0 == ~main__scheme~0); {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {9090#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {9090#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9090#true} is VALID [2022-04-28 03:09:36,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~3); {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {9090#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {9090#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {9090#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~5); {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {9090#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~7); {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {9090#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {9090#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {9090#true} assume !(0 == ~__VERIFIER_assert__cond~9); {9090#true} is VALID [2022-04-28 03:09:36,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {9090#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {9090#true} is VALID [2022-04-28 03:09:36,239 INFO L290 TraceCheckUtils]: 35: Hoare triple {9090#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-28 03:09:36,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-28 03:09:36,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} is VALID [2022-04-28 03:09:36,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {9095#(<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9096#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2022-04-28 03:09:36,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {9096#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {9091#false} is VALID [2022-04-28 03:09:36,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {9091#false} assume !false; {9091#false} is VALID [2022-04-28 03:09:36,241 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-28 03:09:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:36,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975871605] [2022-04-28 03:09:36,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975871605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:36,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:36,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:36,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:36,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [456119867] [2022-04-28 03:09:36,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [456119867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:36,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:36,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:09:36,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207896800] [2022-04-28 03:09:36,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:36,242 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-28 03:09:36,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:36,242 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-28 03:09:36,262 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-28 03:09:36,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:09:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:36,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:09:36,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:09:36,262 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-28 03:09:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,590 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-04-28 03:09:36,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:36,590 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-28 03:09:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:36,590 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-28 03:09:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 03:09:36,591 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-28 03:09:36,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-28 03:09:36,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-28 03:09:36,639 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-28 03:09:36,640 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:09:36,640 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 03:09:36,640 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-28 03:09:36,640 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-28 03:09:36,640 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-28 03:09:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 03:09:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2022-04-28 03:09:36,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:36,764 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-28 03:09:36,764 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-28 03:09:36,764 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-28 03:09:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,765 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-28 03:09:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-28 03:09:36,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:36,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:36,765 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-28 03:09:36,765 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-28 03:09:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,766 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2022-04-28 03:09:36,766 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-04-28 03:09:36,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:36,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:36,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:36,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:36,766 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-28 03:09:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-28 03:09:36,767 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 41 [2022-04-28 03:09:36,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:36,767 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-28 03:09:36,767 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-28 03:09:36,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 59 transitions. [2022-04-28 03:09:36,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:36,851 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-28 03:09:36,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:09:36,851 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:36,851 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-28 03:09:36,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 03:09:36,852 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-28 03:09:36,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 1 times [2022-04-28 03:09:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:36,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835327557] [2022-04-28 03:09:36,852 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:36,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1162184327, now seen corresponding path program 2 times [2022-04-28 03:09:36,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:36,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186135525] [2022-04-28 03:09:36,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:36,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:36,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:36,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {9507#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9499#true} is VALID [2022-04-28 03:09:36,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {9499#true} assume true; {9499#true} is VALID [2022-04-28 03:09:36,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9499#true} {9499#true} #225#return; {9499#true} is VALID [2022-04-28 03:09:36,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {9499#true} call ULTIMATE.init(); {9507#(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-28 03:09:36,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {9507#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9499#true} is VALID [2022-04-28 03:09:36,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {9499#true} assume true; {9499#true} is VALID [2022-04-28 03:09:36,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9499#true} {9499#true} #225#return; {9499#true} is VALID [2022-04-28 03:09:36,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {9499#true} call #t~ret11 := main(); {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {9499#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {9499#true} assume !!(~main__urilen~0 <= 1000000); {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {9499#true} assume !!(~main__urilen~0 >= -1000000); {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {9499#true} assume !!(~main__tokenlen~0 <= 1000000); {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {9499#true} assume !!(~main__tokenlen~0 >= -1000000); {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {9499#true} assume !!(~main__scheme~0 <= 1000000); {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {9499#true} assume !!(~main__scheme~0 >= -1000000); {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {9499#true} assume ~main__urilen~0 > 0; {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {9499#true} assume ~main__tokenlen~0 > 0; {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {9499#true} assume ~main__scheme~0 >= 0; {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {9499#true} assume !(0 == ~main__scheme~0); {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {9499#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9499#true} is VALID [2022-04-28 03:09:36,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {9499#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~3); {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {9499#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {9499#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {9499#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~5); {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {9499#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {9499#true} assume !(0 == ~__VERIFIER_assert__cond~7); {9499#true} is VALID [2022-04-28 03:09:36,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {9499#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {9499#true} is VALID [2022-04-28 03:09:36,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {9499#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9504#(= main_~main__c~0 0)} is VALID [2022-04-28 03:09:36,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9504#(= main_~main__c~0 0)} is VALID [2022-04-28 03:09:36,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~9); {9504#(= main_~main__c~0 0)} is VALID [2022-04-28 03:09:36,908 INFO L290 TraceCheckUtils]: 34: Hoare triple {9504#(= main_~main__c~0 0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {9504#(= main_~main__c~0 0)} is VALID [2022-04-28 03:09:36,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {9504#(= main_~main__c~0 0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9504#(= main_~main__c~0 0)} is VALID [2022-04-28 03:09:36,909 INFO L290 TraceCheckUtils]: 36: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9504#(= main_~main__c~0 0)} is VALID [2022-04-28 03:09:36,909 INFO L290 TraceCheckUtils]: 37: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {9504#(= main_~main__c~0 0)} is VALID [2022-04-28 03:09:36,909 INFO L290 TraceCheckUtils]: 38: Hoare triple {9504#(= main_~main__c~0 0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9505#(<= 1 main_~main__c~0)} is VALID [2022-04-28 03:09:36,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {9505#(<= 1 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9506#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2022-04-28 03:09:36,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {9506#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {9500#false} is VALID [2022-04-28 03:09:36,910 INFO L290 TraceCheckUtils]: 41: Hoare triple {9500#false} assume !false; {9500#false} is VALID [2022-04-28 03:09:36,911 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-28 03:09:36,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:36,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186135525] [2022-04-28 03:09:36,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186135525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:36,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:36,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:36,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:36,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835327557] [2022-04-28 03:09:36,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835327557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:36,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:36,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000921011] [2022-04-28 03:09:36,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:36,912 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-28 03:09:36,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:36,912 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-28 03:09:36,934 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-28 03:09:36,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:36,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:36,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:36,935 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-28 03:09:37,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:37,297 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-04-28 03:09:37,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:37,297 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-28 03:09:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:37,297 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-28 03:09:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-28 03:09:37,298 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-28 03:09:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-04-28 03:09:37,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2022-04-28 03:09:37,388 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-28 03:09:37,388 INFO L225 Difference]: With dead ends: 66 [2022-04-28 03:09:37,388 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 03:09:37,389 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-28 03:09:37,389 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-28 03:09:37,389 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-28 03:09:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 03:09:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-04-28 03:09:37,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:37,511 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-28 03:09:37,511 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-28 03:09:37,511 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-28 03:09:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:37,512 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-28 03:09:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-28 03:09:37,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:37,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:37,512 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-28 03:09:37,513 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-28 03:09:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:37,513 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-04-28 03:09:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-04-28 03:09:37,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:37,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:37,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:37,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:37,515 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-28 03:09:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-28 03:09:37,515 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 42 [2022-04-28 03:09:37,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:37,515 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-28 03:09:37,515 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-28 03:09:37,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-28 03:09:37,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-28 03:09:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:09:37,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:37,628 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-28 03:09:37,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 03:09:37,629 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-28 03:09:37,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:37,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 1 times [2022-04-28 03:09:37,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:37,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1716423711] [2022-04-28 03:09:37,629 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:37,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1667972556, now seen corresponding path program 2 times [2022-04-28 03:09:37,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:37,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782204932] [2022-04-28 03:09:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:37,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:37,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {9894#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9886#true} is VALID [2022-04-28 03:09:37,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {9886#true} assume true; {9886#true} is VALID [2022-04-28 03:09:37,687 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9886#true} {9886#true} #225#return; {9886#true} is VALID [2022-04-28 03:09:37,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {9886#true} call ULTIMATE.init(); {9894#(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-28 03:09:37,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {9894#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {9886#true} is VALID [2022-04-28 03:09:37,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {9886#true} assume true; {9886#true} is VALID [2022-04-28 03:09:37,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9886#true} {9886#true} #225#return; {9886#true} is VALID [2022-04-28 03:09:37,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {9886#true} call #t~ret11 := main(); {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {9886#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {9886#true} assume !!(~main__urilen~0 <= 1000000); {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {9886#true} assume !!(~main__urilen~0 >= -1000000); {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {9886#true} assume !!(~main__tokenlen~0 <= 1000000); {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {9886#true} assume !!(~main__tokenlen~0 >= -1000000); {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {9886#true} assume !!(~main__scheme~0 <= 1000000); {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {9886#true} assume !!(~main__scheme~0 >= -1000000); {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {9886#true} assume ~main__urilen~0 > 0; {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {9886#true} assume ~main__tokenlen~0 > 0; {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {9886#true} assume ~main__scheme~0 >= 0; {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {9886#true} assume !(0 == ~main__scheme~0); {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {9886#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {9886#true} is VALID [2022-04-28 03:09:37,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {9886#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~3); {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {9886#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {9886#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {9886#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~5); {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {9886#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {9886#true} assume !(0 == ~__VERIFIER_assert__cond~7); {9886#true} is VALID [2022-04-28 03:09:37,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {9886#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {9886#true} is VALID [2022-04-28 03:09:37,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {9886#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {9891#(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-28 03:09:37,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {9891#(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)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:37,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~9); {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:37,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__cp~0 != ~main__urilen~0 - 1; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:37,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:37,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:37,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:37,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:37,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:37,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {9892#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {9893#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-28 03:09:37,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {9893#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {9887#false} is VALID [2022-04-28 03:09:37,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {9887#false} assume !false; {9887#false} is VALID [2022-04-28 03:09:37,693 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-28 03:09:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:37,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782204932] [2022-04-28 03:09:37,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782204932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:37,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:37,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:37,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:37,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1716423711] [2022-04-28 03:09:37,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1716423711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:37,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:37,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806831676] [2022-04-28 03:09:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:37,694 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-28 03:09:37,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:37,694 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-28 03:09:37,720 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-28 03:09:37,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:37,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:37,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:37,720 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-28 03:09:38,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:38,249 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2022-04-28 03:09:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:09:38,249 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-28 03:09:38,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:38,250 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-28 03:09:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-28 03:09:38,250 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-28 03:09:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2022-04-28 03:09:38,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2022-04-28 03:09:38,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:38,319 INFO L225 Difference]: With dead ends: 88 [2022-04-28 03:09:38,319 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 03:09:38,319 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-28 03:09:38,320 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-28 03:09:38,320 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-28 03:09:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 03:09:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2022-04-28 03:09:38,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:38,463 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-28 03:09:38,463 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-28 03:09:38,463 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-28 03:09:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:38,464 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-28 03:09:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-28 03:09:38,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:38,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:38,464 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-28 03:09:38,464 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-28 03:09:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:38,465 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-04-28 03:09:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-28 03:09:38,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:38,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:38,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:38,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:38,466 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-28 03:09:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-28 03:09:38,466 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 43 [2022-04-28 03:09:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:38,466 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-28 03:09:38,466 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-28 03:09:38,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 63 transitions. [2022-04-28 03:09:38,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-28 03:09:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:09:38,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:38,568 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-28 03:09:38,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 03:09:38,568 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr10ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-28 03:09:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:38,569 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 1 times [2022-04-28 03:09:38,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:38,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147423664] [2022-04-28 03:09:38,569 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:38,569 INFO L85 PathProgramCache]: Analyzing trace with hash 651621684, now seen corresponding path program 2 times [2022-04-28 03:09:38,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:38,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572101852] [2022-04-28 03:09:38,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:38,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:38,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:38,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {10384#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID [2022-04-28 03:09:38,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-28 03:09:38,668 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID [2022-04-28 03:09:38,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10384#(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-28 03:09:38,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {10384#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID [2022-04-28 03:09:38,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-28 03:09:38,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID [2022-04-28 03:09:38,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret11 := main(); {10376#true} is VALID [2022-04-28 03:09:38,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(~main__urilen~0 <= 1000000); {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__urilen~0 >= -1000000); {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {10376#true} assume !!(~main__tokenlen~0 <= 1000000); {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {10376#true} assume !!(~main__tokenlen~0 >= -1000000); {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {10376#true} assume !!(~main__scheme~0 <= 1000000); {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {10376#true} assume !!(~main__scheme~0 >= -1000000); {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {10376#true} assume ~main__urilen~0 > 0; {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#true} assume ~main__tokenlen~0 > 0; {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {10376#true} assume ~main__scheme~0 >= 0; {10376#true} is VALID [2022-04-28 03:09:38,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {10376#true} assume !(0 == ~main__scheme~0); {10376#true} is VALID [2022-04-28 03:09:38,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {10376#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,678 INFO L290 TraceCheckUtils]: 28: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,680 INFO L290 TraceCheckUtils]: 35: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,681 INFO L290 TraceCheckUtils]: 36: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,681 INFO L290 TraceCheckUtils]: 37: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,681 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,681 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10383#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2022-04-28 03:09:38,682 INFO L290 TraceCheckUtils]: 42: Hoare triple {10383#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {10377#false} is VALID [2022-04-28 03:09:38,682 INFO L290 TraceCheckUtils]: 43: Hoare triple {10377#false} assume !false; {10377#false} is VALID [2022-04-28 03:09:38,682 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-28 03:09:38,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:38,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572101852] [2022-04-28 03:09:38,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572101852] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:38,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022920120] [2022-04-28 03:09:38,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:09:38,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:38,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:38,685 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-28 03:09:38,686 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-28 03:09:38,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:09:38,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:38,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:09:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:38,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:38,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret11 := main(); {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(~main__urilen~0 <= 1000000); {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__urilen~0 >= -1000000); {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {10376#true} assume !!(~main__tokenlen~0 <= 1000000); {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {10376#true} assume !!(~main__tokenlen~0 >= -1000000); {10376#true} is VALID [2022-04-28 03:09:38,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {10376#true} assume !!(~main__scheme~0 <= 1000000); {10376#true} is VALID [2022-04-28 03:09:38,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {10376#true} assume !!(~main__scheme~0 >= -1000000); {10376#true} is VALID [2022-04-28 03:09:38,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {10376#true} assume ~main__urilen~0 > 0; {10376#true} is VALID [2022-04-28 03:09:38,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#true} assume ~main__tokenlen~0 > 0; {10376#true} is VALID [2022-04-28 03:09:38,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {10376#true} assume ~main__scheme~0 >= 0; {10376#true} is VALID [2022-04-28 03:09:38,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {10376#true} assume !(0 == ~main__scheme~0); {10376#true} is VALID [2022-04-28 03:09:38,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {10376#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,935 INFO L290 TraceCheckUtils]: 24: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,938 INFO L290 TraceCheckUtils]: 35: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,939 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:38,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-28 03:09:38,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {10377#false} is VALID [2022-04-28 03:09:38,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {10377#false} assume !false; {10377#false} is VALID [2022-04-28 03:09:38,940 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-28 03:09:38,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:39,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {10377#false} assume !false; {10377#false} is VALID [2022-04-28 03:09:39,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {10377#false} is VALID [2022-04-28 03:09:39,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10511#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2022-04-28 03:09:39,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,137 INFO L290 TraceCheckUtils]: 39: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,138 INFO L290 TraceCheckUtils]: 35: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,138 INFO L290 TraceCheckUtils]: 34: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,140 INFO L290 TraceCheckUtils]: 28: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,140 INFO L290 TraceCheckUtils]: 27: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,140 INFO L290 TraceCheckUtils]: 26: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,140 INFO L290 TraceCheckUtils]: 25: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {10382#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {10381#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {10376#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10381#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2022-04-28 03:09:39,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {10376#true} assume !(0 == ~main__scheme~0); {10376#true} is VALID [2022-04-28 03:09:39,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {10376#true} assume ~main__scheme~0 >= 0; {10376#true} is VALID [2022-04-28 03:09:39,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#true} assume ~main__tokenlen~0 > 0; {10376#true} is VALID [2022-04-28 03:09:39,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {10376#true} assume ~main__urilen~0 > 0; {10376#true} is VALID [2022-04-28 03:09:39,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {10376#true} assume !!(~main__scheme~0 >= -1000000); {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {10376#true} assume !!(~main__scheme~0 <= 1000000); {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {10376#true} assume !!(~main__tokenlen~0 >= -1000000); {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {10376#true} assume !!(~main__tokenlen~0 <= 1000000); {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {10376#true} assume !!(~main__urilen~0 >= -1000000); {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {10376#true} assume !!(~main__urilen~0 <= 1000000); {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {10376#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {10376#true} call #t~ret11 := main(); {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10376#true} {10376#true} #225#return; {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {10376#true} assume true; {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {10376#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {10376#true} is VALID [2022-04-28 03:09:39,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {10376#true} call ULTIMATE.init(); {10376#true} is VALID [2022-04-28 03:09:39,144 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-28 03:09:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022920120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:39,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:39,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-04-28 03:09:39,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:39,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147423664] [2022-04-28 03:09:39,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147423664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:39,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:39,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681732271] [2022-04-28 03:09:39,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:39,145 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-28 03:09:39,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:39,146 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-28 03:09:39,171 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-28 03:09:39,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:09:39,171 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-28 03:09:39,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:39,460 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-04-28 03:09:39,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:09:39,460 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-28 03:09:39,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:39,460 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-28 03:09:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-28 03:09:39,461 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-28 03:09:39,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2022-04-28 03:09:39,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2022-04-28 03:09:39,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:39,517 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:09:39,517 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 03:09:39,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:09:39,517 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 84 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:39,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 49 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:39,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 03:09:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 03:09:39,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:39,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 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-28 03:09:39,658 INFO L74 IsIncluded]: Start isIncluded. First operand 58 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-28 03:09:39,658 INFO L87 Difference]: Start difference. First operand 58 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-28 03:09:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:39,659 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-28 03:09:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-28 03:09:39,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:39,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:39,659 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 58 states. [2022-04-28 03:09:39,659 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 58 states. [2022-04-28 03:09:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:39,660 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-04-28 03:09:39,660 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-28 03:09:39,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:39,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:39,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:39,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:39,660 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-28 03:09:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2022-04-28 03:09:39,661 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 44 [2022-04-28 03:09:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:39,661 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2022-04-28 03:09:39,661 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-28 03:09:39,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 61 transitions. [2022-04-28 03:09:39,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2022-04-28 03:09:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:09:39,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:39,759 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-28 03:09:39,784 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-28 03:09:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:39,959 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr15ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 14 more)] === [2022-04-28 03:09:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 1 times [2022-04-28 03:09:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:39,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [22562934] [2022-04-28 03:09:39,960 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash -167538465, now seen corresponding path program 2 times [2022-04-28 03:09:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:39,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457149337] [2022-04-28 03:09:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:39,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:39,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:40,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {11017#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11009#true} is VALID [2022-04-28 03:09:40,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {11009#true} assume true; {11009#true} is VALID [2022-04-28 03:09:40,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11009#true} {11009#true} #225#return; {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {11009#true} call ULTIMATE.init(); {11017#(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-28 03:09:40,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {11017#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {11009#true} assume true; {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11009#true} {11009#true} #225#return; {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {11009#true} call #t~ret11 := main(); {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {11009#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {11009#true} assume !!(~main__urilen~0 <= 1000000); {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {11009#true} assume !!(~main__urilen~0 >= -1000000); {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {11009#true} assume !!(~main__tokenlen~0 <= 1000000); {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {11009#true} assume !!(~main__tokenlen~0 >= -1000000); {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {11009#true} assume !!(~main__scheme~0 <= 1000000); {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {11009#true} assume !!(~main__scheme~0 >= -1000000); {11009#true} is VALID [2022-04-28 03:09:40,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {11009#true} assume ~main__urilen~0 > 0; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {11009#true} assume ~main__tokenlen~0 > 0; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {11009#true} assume ~main__scheme~0 >= 0; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {11009#true} assume !(0 == ~main__scheme~0); {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {11009#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {11009#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~3); {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {11009#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {11009#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {11009#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {11009#true} is VALID [2022-04-28 03:09:40,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~5); {11009#true} is VALID [2022-04-28 03:09:40,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {11009#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11009#true} is VALID [2022-04-28 03:09:40,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {11009#true} is VALID [2022-04-28 03:09:40,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~7); {11009#true} is VALID [2022-04-28 03:09:40,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {11009#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {11009#true} is VALID [2022-04-28 03:09:40,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {11009#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {11009#true} is VALID [2022-04-28 03:09:40,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {11009#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {11014#(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-28 03:09:40,041 INFO L290 TraceCheckUtils]: 33: Hoare triple {11014#(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)))} assume !(0 == ~__VERIFIER_assert__cond~9); {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:40,041 INFO L290 TraceCheckUtils]: 34: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:40,041 INFO L290 TraceCheckUtils]: 35: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:40,041 INFO L290 TraceCheckUtils]: 36: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:40,042 INFO L290 TraceCheckUtils]: 37: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:40,042 INFO L290 TraceCheckUtils]: 38: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:40,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:40,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11015#(<= 0 main_~main__cp~0)} is VALID [2022-04-28 03:09:40,043 INFO L290 TraceCheckUtils]: 41: Hoare triple {11015#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {11016#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2022-04-28 03:09:40,043 INFO L290 TraceCheckUtils]: 42: Hoare triple {11016#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {11010#false} is VALID [2022-04-28 03:09:40,043 INFO L290 TraceCheckUtils]: 43: Hoare triple {11010#false} assume !false; {11010#false} is VALID [2022-04-28 03:09:40,043 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-28 03:09:40,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:40,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457149337] [2022-04-28 03:09:40,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457149337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:40,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:40,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:40,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:40,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [22562934] [2022-04-28 03:09:40,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [22562934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:40,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:40,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:40,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861384292] [2022-04-28 03:09:40,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:40,044 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-28 03:09:40,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:40,044 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-28 03:09:40,068 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-28 03:09:40,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:40,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:40,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:40,069 INFO L87 Difference]: Start difference. First operand 58 states and 61 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-28 03:09:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:40,461 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 03:09:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:09:40,461 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-28 03:09:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:40,461 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-28 03:09:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 03:09:40,462 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-28 03:09:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-28 03:09:40,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-28 03:09:40,506 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-28 03:09:40,506 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:09:40,506 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:09:40,506 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-28 03:09:40,507 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:40,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:09:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:09:40,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 56. [2022-04-28 03:09:40,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:40,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 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-28 03:09:40,637 INFO L74 IsIncluded]: Start isIncluded. First operand 67 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-28 03:09:40,637 INFO L87 Difference]: Start difference. First operand 67 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-28 03:09:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:40,638 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-28 03:09:40,638 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 03:09:40,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:40,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:40,638 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 67 states. [2022-04-28 03:09:40,638 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 67 states. [2022-04-28 03:09:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:40,639 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-28 03:09:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 03:09:40,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:40,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:40,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:40,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:40,640 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-28 03:09:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-04-28 03:09:40,640 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 44 [2022-04-28 03:09:40,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:40,640 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-04-28 03:09:40,640 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-28 03:09:40,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 59 transitions. [2022-04-28 03:09:40,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-04-28 03:09:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:09:40,744 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:40,744 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-28 03:09:40,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 03:09:40,745 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-28 03:09:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 1 times [2022-04-28 03:09:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:40,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1051163000] [2022-04-28 03:09:40,745 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:09:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash -799157235, now seen corresponding path program 2 times [2022-04-28 03:09:40,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:40,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591140539] [2022-04-28 03:09:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:40,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:40,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {11418#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11410#true} is VALID [2022-04-28 03:09:40,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {11410#true} assume true; {11410#true} is VALID [2022-04-28 03:09:40,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11410#true} {11410#true} #225#return; {11410#true} is VALID [2022-04-28 03:09:40,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {11410#true} call ULTIMATE.init(); {11418#(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-28 03:09:40,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {11418#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__return_375~0 := 0; {11410#true} is VALID [2022-04-28 03:09:40,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {11410#true} assume true; {11410#true} is VALID [2022-04-28 03:09:40,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11410#true} {11410#true} #225#return; {11410#true} is VALID [2022-04-28 03:09:40,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {11410#true} call #t~ret11 := main(); {11410#true} is VALID [2022-04-28 03:09:40,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {11410#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__urilen~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main__tokenlen~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main__scheme~0 := #t~nondet6;havoc #t~nondet6; {11410#true} is VALID [2022-04-28 03:09:40,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {11410#true} assume !!(~main__urilen~0 <= 1000000); {11410#true} is VALID [2022-04-28 03:09:40,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {11410#true} assume !!(~main__urilen~0 >= -1000000); {11410#true} is VALID [2022-04-28 03:09:40,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {11410#true} assume !!(~main__tokenlen~0 <= 1000000); {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {11410#true} assume !!(~main__tokenlen~0 >= -1000000); {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {11410#true} assume !!(~main__scheme~0 <= 1000000); {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {11410#true} assume !!(~main__scheme~0 >= -1000000); {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 12: Hoare triple {11410#true} assume ~main__urilen~0 > 0; {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {11410#true} assume ~main__tokenlen~0 > 0; {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {11410#true} assume ~main__scheme~0 >= 0; {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {11410#true} assume !(0 == ~main__scheme~0); {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {11410#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet7;havoc #t~nondet7; {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {11410#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~3); {11410#true} is VALID [2022-04-28 03:09:40,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {11410#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet8;havoc #t~nondet8; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {11410#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {11410#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~5); {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {11410#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~7); {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {11410#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet9;havoc #t~nondet9; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {11410#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 32: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~9); {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {11410#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {11410#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {11410#true} is VALID [2022-04-28 03:09:40,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {11410#true} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {11410#true} is VALID [2022-04-28 03:09:40,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {11410#true} assume !!(0 == ~main____CPAchecker_TMP_3~0); {11410#true} is VALID [2022-04-28 03:09:40,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {11410#true} ~main__cp~0 := 1 + ~main__cp~0; {11410#true} is VALID [2022-04-28 03:09:40,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {11410#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {11410#true} is VALID [2022-04-28 03:09:40,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {11410#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {11415#(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-28 03:09:40,810 INFO L290 TraceCheckUtils]: 42: Hoare triple {11415#(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))))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:40,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet10;havoc #t~nondet10; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:40,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:40,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} is VALID [2022-04-28 03:09:40,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {11416#(not (<= main_~main__urilen~0 main_~main__cp~0))} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {11417#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2022-04-28 03:09:40,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {11417#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {11411#false} is VALID [2022-04-28 03:09:40,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {11411#false} assume !false; {11411#false} is VALID [2022-04-28 03:09:40,811 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-28 03:09:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:40,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591140539] [2022-04-28 03:09:40,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591140539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:40,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:40,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:40,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:40,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1051163000] [2022-04-28 03:09:40,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1051163000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:40,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:40,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:09:40,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800535500] [2022-04-28 03:09:40,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:40,812 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-28 03:09:40,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:40,813 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-28 03:09:40,837 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-28 03:09:40,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:09:40,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:09:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:09:40,838 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-28 03:09:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:41,297 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-28 03:09:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:09:41,297 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-28 03:09:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:41,297 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-28 03:09:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-28 03:09:41,298 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-28 03:09:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 71 transitions. [2022-04-28 03:09:41,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 71 transitions. [2022-04-28 03:09:41,348 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-28 03:09:41,348 INFO L225 Difference]: With dead ends: 75 [2022-04-28 03:09:41,348 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 03:09:41,349 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-28 03:09:41,349 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-28 03:09:41,349 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-28 03:09:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 03:09:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 03:09:41,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:41,350 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-28 03:09:41,350 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-28 03:09:41,350 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-28 03:09:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:41,350 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:09:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:09:41,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:41,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:41,350 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-28 03:09:41,350 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-28 03:09:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:41,350 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 03:09:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:09:41,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:41,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:41,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:41,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:41,351 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-28 03:09:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 03:09:41,351 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-04-28 03:09:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:41,351 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 03:09:41,351 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-28 03:09:41,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 03:09:41,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 03:09:41,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:41,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-04-28 03:09:41,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-04-28 03:09:41,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-04-28 03:09:41,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-04-28 03:09:41,353 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-04-28 03:09:41,354 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-04-28 03:09:41,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 03:09:41,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 03:09:58,631 WARN L232 SmtUtils]: Spent 10.41s on a formula simplification. DAG size of input: 124 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:10:52,199 WARN L232 SmtUtils]: Spent 40.74s on a formula simplification. DAG size of input: 130 DAG size of output: 125 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-28 03:11:04,664 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-28 03:11:04,664 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-28 03:11:04,664 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-28 03:11:04,664 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2022-04-28 03:11:04,664 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-28 03:11:04,664 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2022-04-28 03:11:04,664 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2022-04-28 03:11:04,664 INFO L895 garLoopResultBuilder]: At program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) the Hoare annotation is: false [2022-04-28 03:11:04,664 INFO L895 garLoopResultBuilder]: At program point mainEXIT(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-28 03:11:04,665 INFO L895 garLoopResultBuilder]: At program point L374(line 374) the Hoare annotation is: false [2022-04-28 03:11:04,665 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: false [2022-04-28 03:11:04,665 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: false [2022-04-28 03:11:04,665 INFO L895 garLoopResultBuilder]: At program point L143(lines 143 362) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= |old(~__return_375~0)| ~__return_375~0)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4 .cse5)))) [2022-04-28 03:11:04,665 INFO L895 garLoopResultBuilder]: At program point L234(lines 234 338) the Hoare annotation is: (let ((.cse2 (= main_~__VERIFIER_assert__cond~9 1)) (.cse3 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse6 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse7 (= main_~__VERIFIER_assert__cond~3 1)) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse0 (= main_~main__c~0 0)) (.cse16 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse12 (< 0 main_~main__scheme~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse14 (<= 1 main_~main__cp~0)) (.cse15 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and (let ((.cse1 (let ((.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and .cse0 .cse1) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse1))) (not (= main_~__VERIFIER_assert__cond~10 0)) .cse16) (and .cse2 .cse3 (= main_~__VERIFIER_assert__cond~8 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse0 .cse16 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-04-28 03:11:04,665 INFO L895 garLoopResultBuilder]: At program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) the Hoare annotation is: false [2022-04-28 03:11:04,665 INFO L895 garLoopResultBuilder]: At program point L135(lines 135 397) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0)) [2022-04-28 03:11:04,666 INFO L895 garLoopResultBuilder]: At program point L226(line 226) the Hoare annotation is: false [2022-04-28 03:11:04,666 INFO L895 garLoopResultBuilder]: At program point L61(lines 61 427) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,666 INFO L895 garLoopResultBuilder]: At program point L284(line 284) the Hoare annotation is: false [2022-04-28 03:11:04,666 INFO L895 garLoopResultBuilder]: At program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) the Hoare annotation is: false [2022-04-28 03:11:04,666 INFO L895 garLoopResultBuilder]: At program point L53(lines 53 433) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,666 INFO L895 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: false [2022-04-28 03:11:04,666 INFO L895 garLoopResultBuilder]: At program point L177(line 177) the Hoare annotation is: false [2022-04-28 03:11:04,666 INFO L895 garLoopResultBuilder]: At program point L111(lines 111 405) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-28 03:11:04,666 INFO L895 garLoopResultBuilder]: At program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) the Hoare annotation is: false [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (<= 1 main_~main__cp~0)) (.cse5 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (= main_~__VERIFIER_assert__cond~2 1) .cse4 .cse5))) (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L194(lines 194 354) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L384(lines 384 393) the Hoare annotation is: (and (not (<= main_~main__scheme~0 0)) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~17 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~16 0)) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L95(lines 95 412) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L29(lines 29 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) the Hoare annotation is: false [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L145(line 145) the Hoare annotation is: false [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (not (<= main_~main__urilen~0 main_~main__cp~0))) [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point mainFINAL(lines 13 439) the Hoare annotation is: (or (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) the Hoare annotation is: false [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L104(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L71(lines 71 416) the Hoare annotation is: (and (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0)) [2022-04-28 03:11:04,667 INFO L895 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (let ((.cse0 (let ((.cse1 (= main_~__VERIFIER_assert__cond~9 1)) (.cse2 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse5 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (not (= main_~__VERIFIER_assert__cond~9 0))) (.cse8 (= |old(~__return_375~0)| ~__return_375~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse11 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse13 (< 0 main_~main__scheme~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse15 (<= 1 main_~main__cp~0)) (.cse16 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (= main_~main__c~0 0) .cse0) (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse0))) (= main_~__VERIFIER_assert__cond~10 1)) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L294(lines 294 318) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L162(lines 162 359) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5))) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) the Hoare annotation is: false [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L63(lines 63 422) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 13 439) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L253(lines 253 329) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L187(lines 187 355) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L212(lines 212 346) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: false [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L47(lines 47 434) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L270(lines 270 322) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-28 03:11:04,668 INFO L895 garLoopResultBuilder]: At program point L204(lines 204 353) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L262(lines 262 328) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~10 1) (let ((.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= main_~main__c~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15)))) [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L386(line 386) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L97(line 97) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L155(lines 155 360) the Hoare annotation is: (let ((.cse0 (let ((.cse6 (not (<= main_~main__scheme~0 0))) (.cse7 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse8 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse9 (<= 1 main_~main__cp~0)) (.cse10 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse6 .cse7 .cse8 (= main_~__VERIFIER_assert__cond~2 1) (not (<= main_~main__urilen~0 main_~main__cp~0)) .cse9 .cse10) (and .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse9 .cse10)))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (= |old(~__return_375~0)| ~__return_375~0)) (.cse1 (+ main_~main__cp~0 1)) (.cse5 (not (= main_~__VERIFIER_assert__cond~5 0)))) (or (and .cse0 (= main_~main__urilen~0 .cse1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 (< .cse1 main_~main__urilen~0) .cse5))) [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L23(lines 23 438) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L296(line 296) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L65(lines 65 417) the Hoare annotation is: (and (<= 0 main_~main__scheme~0) (= |old(~__return_375~0)| ~__return_375~0)) [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L255(line 255) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L189(line 189) the Hoare annotation is: false [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L123(lines 123 403) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= main_~__VERIFIER_assert__cond~2 1) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-28 03:11:04,669 INFO L895 garLoopResultBuilder]: At program point L214(line 214) the Hoare annotation is: false [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point L272(line 272) the Hoare annotation is: false [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) the Hoare annotation is: false [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point L41(lines 41 435) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) the Hoare annotation is: false [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point L157(line 157) the Hoare annotation is: false [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point L372(lines 372 395) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (= main_~__VERIFIER_assert__cond~3 1)) (.cse4 (not (= main_~__VERIFIER_assert__cond~16 0))) (.cse5 (<= 1 main_~main__cp~0)) (.cse6 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~17 0)) .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= main_~__VERIFIER_assert__cond~2 1) .cse5 .cse6))) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0)) [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point L83(lines 83 414) the Hoare annotation is: (and (not (= main_~__VERIFIER_assert__cond~0 0)) (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (< 0 main_~main__scheme~0) (<= 1 main_~main__cp~0)) [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point L306(lines 306 316) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (not (= main_~__VERIFIER_assert__cond~14 0)) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0)) (not (= main_~__VERIFIER_assert__cond~15 0))) [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) the Hoare annotation is: false [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) the Hoare annotation is: false [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point L224(lines 224 344) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (= main_~__VERIFIER_assert__cond~8 1) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (= main_~main__c~0 0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point L125(line 125) the Hoare annotation is: false [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) the Hoare annotation is: false [2022-04-28 03:11:04,670 INFO L895 garLoopResultBuilder]: At program point L59(lines 59 432) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,671 INFO L895 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse9 (= main_~main__c~0 0)) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (< main_~main__cp~0 main_~main__urilen~0)) (.cse6 (= main_~__VERIFIER_assert__cond~3 1)) (.cse7 (= |old(~__return_375~0)| ~__return_375~0)) (.cse8 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse10 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse11 (< 0 main_~main__scheme~0)) (.cse12 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse13 (<= 1 main_~main__cp~0)) (.cse14 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (< (+ main_~main__cp~0 1) main_~main__urilen~0) .cse10 .cse11 .cse12 .cse13 .cse14) (and (let ((.cse15 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= main_~__VERIFIER_assert__cond~12 0)) .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0)))))) (or (and (not (= main_~__VERIFIER_assert__cond~13 0)) (<= 1 main_~main__c~0) .cse15) (and .cse9 .cse15))) (not (= main_~__VERIFIER_assert__cond~10 0))))) [2022-04-28 03:11:04,671 INFO L895 garLoopResultBuilder]: At program point L282(lines 282 320) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~9 1) (not (= main_~__VERIFIER_assert__cond~1 0)) (not (= main_~__VERIFIER_assert__cond~13 0)) (not (= main_~__VERIFIER_assert__cond~4 0)) (not (= main_~__VERIFIER_assert__cond~7 0)) (not (= main_~__VERIFIER_assert__cond~0 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (<= 1 main_~main__c~0) (not (= main_~__VERIFIER_assert__cond~12 0)) (not (= main_~__VERIFIER_assert__cond~8 0)) (not (= main_~__VERIFIER_assert__cond~11 0)) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (< 0 main_~main__scheme~0) (= main_~__VERIFIER_assert__cond~10 1) (not (= main_~__VERIFIER_assert__cond~6 0)) (<= 1 main_~main__cp~0) (not (= main_~__VERIFIER_assert__cond~2 0))) [2022-04-28 03:11:04,671 INFO L895 garLoopResultBuilder]: At program point L241(lines 241 331) the Hoare annotation is: (let ((.cse14 (let ((.cse18 (<= main_~main__urilen~0 main_~main__cp~0))) (or (and (= main_~__VERIFIER_assert__cond~10 0) .cse18) (and (= main_~__VERIFIER_assert__cond~10 1) (not .cse18))))) (.cse0 (= main_~__VERIFIER_assert__cond~9 1)) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~4 0))) (.cse3 (not (= main_~__VERIFIER_assert__cond~7 0))) (.cse4 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse5 (= main_~__VERIFIER_assert__cond~3 1)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (= main_~main__c~0 0)) (.cse8 (< (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse9 (not (= main_~__VERIFIER_assert__cond~5 0))) (.cse10 (< 0 main_~main__scheme~0)) (.cse11 (not (= main_~__VERIFIER_assert__cond~6 0))) (.cse12 (<= 1 main_~main__cp~0)) (.cse13 (not (= main_~__VERIFIER_assert__cond~2 0))) (.cse15 (<= (+ 2 main_~main__c~0) main_~main__tokenlen~0))) (or (and .cse0 .cse1 (= main_~__VERIFIER_assert__cond~8 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse14 (let ((.cse16 (not (= main_~__VERIFIER_assert__cond~8 0))) (.cse17 (not (= main_~__VERIFIER_assert__cond~11 0)))) (or (and .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~main__c~0) .cse16 .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15)))))) [2022-04-28 03:11:04,671 INFO L895 garLoopResultBuilder]: At program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) the Hoare annotation is: false [2022-04-28 03:11:04,671 INFO L895 garLoopResultBuilder]: At program point L175(lines 175 357) the Hoare annotation is: (and (let ((.cse0 (not (<= main_~main__scheme~0 0))) (.cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (.cse2 (not (= main_~__VERIFIER_assert__cond~0 0))) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= main_~__VERIFIER_assert__cond~2 0)))) (or (and .cse0 .cse1 .cse2 (= main_~__VERIFIER_assert__cond~2 1) .cse3 .cse4) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse3 .cse4))) (not (= main_~__VERIFIER_assert__cond~4 0)) (= main_~__VERIFIER_assert__cond~3 1) (= |old(~__return_375~0)| ~__return_375~0) (< (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= main_~__VERIFIER_assert__cond~5 0)) (not (= main_~__VERIFIER_assert__cond~6 0))) [2022-04-28 03:11:04,671 INFO L895 garLoopResultBuilder]: At program point L35(lines 35 436) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2022-04-28 03:11:04,671 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:11:04,671 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (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|)) [2022-04-28 03:11:04,671 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:11:04,671 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 03:11:04,671 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 03:11:04,671 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 03:11:04,671 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 03:11:04,673 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 03:11:04,675 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 03:11:04,687 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 03:11:04,687 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 03:11:04,688 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 03:11:04,688 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 03:11:04,688 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 03:11:04,689 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2022-04-28 03:11:04,771 INFO L163 areAnnotationChecker]: CFG has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 03:11:04,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 03:11:04 BoogieIcfgContainer [2022-04-28 03:11:04,783 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 03:11:04,784 INFO L158 Benchmark]: Toolchain (without parser) took 103992.56ms. Allocated memory was 186.6MB in the beginning and 331.4MB in the end (delta: 144.7MB). Free memory was 137.0MB in the beginning and 150.3MB in the end (delta: -13.3MB). Peak memory consumption was 174.5MB. Max. memory is 8.0GB. [2022-04-28 03:11:04,784 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 186.6MB. Free memory was 153.4MB in the beginning and 153.3MB in the end (delta: 130.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 03:11:04,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.02ms. Allocated memory is still 186.6MB. Free memory was 136.8MB in the beginning and 152.2MB in the end (delta: -15.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 03:11:04,784 INFO L158 Benchmark]: Boogie Preprocessor took 24.32ms. Allocated memory is still 186.6MB. Free memory was 152.2MB in the beginning and 150.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 03:11:04,785 INFO L158 Benchmark]: RCFGBuilder took 350.31ms. Allocated memory is still 186.6MB. Free memory was 150.7MB in the beginning and 130.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-28 03:11:04,785 INFO L158 Benchmark]: TraceAbstraction took 103336.50ms. Allocated memory was 186.6MB in the beginning and 331.4MB in the end (delta: 144.7MB). Free memory was 130.2MB in the beginning and 150.3MB in the end (delta: -20.1MB). Peak memory consumption was 168.2MB. Max. memory is 8.0GB. [2022-04-28 03:11:04,785 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.35ms. Allocated memory is still 186.6MB. Free memory was 153.4MB in the beginning and 153.3MB in the end (delta: 130.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 277.02ms. Allocated memory is still 186.6MB. Free memory was 136.8MB in the beginning and 152.2MB in the end (delta: -15.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.32ms. Allocated memory is still 186.6MB. Free memory was 152.2MB in the beginning and 150.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 350.31ms. Allocated memory is still 186.6MB. Free memory was 150.7MB in the beginning and 130.7MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 103336.50ms. Allocated memory was 186.6MB in the beginning and 331.4MB in the end (delta: 144.7MB). Free memory was 130.2MB in the beginning and 150.3MB in the end (delta: -20.1MB). Peak memory consumption was 168.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 145]: 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 - 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: 386]: 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 5 procedures, 94 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 103.2s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 83.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3685 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3685 mSDsluCounter, 1675 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2505 IncrementalHoareTripleChecker+Invalid, 2695 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 1325 mSDtfsCounter, 2505 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: 2.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 296 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 87 LocationsWithAnnotation, 87 PreInvPairs, 140 NumberOfFragments, 2985 HoareAnnotationTreeSize, 87 FomulaSimplifications, 286041 FormulaSimplificationTreeSizeReduction, 80.2s HoareSimplificationTime, 87 FomulaSimplificationsInter, 619907 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((main__c == 0 && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || ((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && (((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && __VERIFIER_assert__cond == 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: (((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && main__cp < main__urilen) && \old(__return_375) == __return_375 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((!(main__scheme <= 0) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0))) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(main__urilen <= main__cp) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) && \old(__return_375) == __return_375 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || ((((!(__VERIFIER_assert__cond == 0) && 1 <= main__c) && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen))) || (main__c == 0 && ((((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((((__VERIFIER_assert__cond == 1 && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && \old(__return_375) == __return_375) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen)))) && !(__VERIFIER_assert__cond == 0)) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !(__VERIFIER_assert__cond == 0) || \old(__return_375) == __return_375 RESULT: Ultimate proved your program to be correct! [2022-04-28 03:11:04,821 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...