./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:02:31,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:02:31,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:02:31,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:02:31,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:02:31,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:02:31,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:02:31,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:02:31,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:02:31,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:02:31,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:02:31,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:02:31,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:02:31,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:02:31,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:02:31,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:02:31,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:02:31,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:02:31,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:02:31,320 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:02:31,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:02:31,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:02:31,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:02:31,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:02:31,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:02:31,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:02:31,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:02:31,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:02:31,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:02:31,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:02:31,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:02:31,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:02:31,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:02:31,331 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:02:31,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:02:31,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:02:31,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:02:31,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:02:31,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:02:31,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:02:31,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:02:31,334 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:02:31,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:02:31,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:02:31,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:02:31,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:02:31,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:02:31,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:02:31,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:02:31,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:02:31,358 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:02:31,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:02:31,359 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:02:31,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:02:31,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:02:31,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:02:31,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:02:31,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:02:31,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:02:31,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:02:31,360 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:02:31,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:02:31,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:02:31,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:02:31,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:02:31,361 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:02:31,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:31,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:02:31,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:02:31,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:02:31,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:02:31,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:02:31,362 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:02:31,362 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:02:31,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:02:31,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce67d33baf8e2191d295422ec2c8649be746cd4f4f75c5de99bdc3950e33cc6c [2022-02-20 17:02:31,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:02:31,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:02:31,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:02:31,524 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:02:31,524 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:02:31,525 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-02-20 17:02:31,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1e7c557/044bbe755ffb4058949abed44b251cdf/FLAGec286fa55 [2022-02-20 17:02:32,050 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:02:32,050 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2022-02-20 17:02:32,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1e7c557/044bbe755ffb4058949abed44b251cdf/FLAGec286fa55 [2022-02-20 17:02:32,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1e7c557/044bbe755ffb4058949abed44b251cdf [2022-02-20 17:02:32,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:02:32,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:02:32,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:32,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:02:32,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:02:32,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@436374f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32, skipping insertion in model container [2022-02-20 17:02:32,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:02:32,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:02:32,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-02-20 17:02:32,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-02-20 17:02:32,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-02-20 17:02:32,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-02-20 17:02:32,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-02-20 17:02:32,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-02-20 17:02:32,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-02-20 17:02:32,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-02-20 17:02:32,616 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-02-20 17:02:32,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-02-20 17:02:32,621 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-02-20 17:02:32,624 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-02-20 17:02:32,626 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-02-20 17:02:32,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-02-20 17:02:32,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-02-20 17:02:32,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-02-20 17:02:32,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-02-20 17:02:32,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-02-20 17:02:32,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:32,653 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:02:32,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1551,1564] [2022-02-20 17:02:32,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[1758,1771] [2022-02-20 17:02:32,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2095,2108] [2022-02-20 17:02:32,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2296,2309] [2022-02-20 17:02:32,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2701,2714] [2022-02-20 17:02:32,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[2902,2915] [2022-02-20 17:02:32,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3228,3241] [2022-02-20 17:02:32,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3435,3448] [2022-02-20 17:02:32,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[3914,3927] [2022-02-20 17:02:32,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4118,4131] [2022-02-20 17:02:32,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4426,4439] [2022-02-20 17:02:32,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4630,4643] [2022-02-20 17:02:32,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[4995,5008] [2022-02-20 17:02:32,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5198,5211] [2022-02-20 17:02:32,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5412,5425] [2022-02-20 17:02:32,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[5616,5629] [2022-02-20 17:02:32,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6138,6151] [2022-02-20 17:02:32,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c[6342,6355] [2022-02-20 17:02:32,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:02:32,723 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:02:32,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32 WrapperNode [2022-02-20 17:02:32,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:02:32,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:32,725 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:02:32,725 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:02:32,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,781 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 254 [2022-02-20 17:02:32,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:02:32,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:02:32,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:02:32,789 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:02:32,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,800 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,800 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:02:32,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:02:32,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:02:32,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:02:32,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (1/1) ... [2022-02-20 17:02:32,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:02:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:32,858 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-02-20 17:02:32,859 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-02-20 17:02:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:02:32,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:02:32,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:02:32,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:02:33,012 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:02:33,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:02:33,311 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:02:33,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:02:33,316 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 17:02:33,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:33 BoogieIcfgContainer [2022-02-20 17:02:33,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:02:33,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:02:33,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:02:33,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:02:33,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:02:32" (1/3) ... [2022-02-20 17:02:33,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da8c5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:33, skipping insertion in model container [2022-02-20 17:02:33,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:02:32" (2/3) ... [2022-02-20 17:02:33,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2da8c5fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:02:33, skipping insertion in model container [2022-02-20 17:02:33,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:33" (3/3) ... [2022-02-20 17:02:33,323 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2022-02-20 17:02:33,326 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:02:33,326 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2022-02-20 17:02:33,358 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:02:33,362 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:02:33,362 INFO L340 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2022-02-20 17:02:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 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-02-20 17:02:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:02:33,392 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:33,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:33,393 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:33,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:33,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2034435078, now seen corresponding path program 1 times [2022-02-20 17:02:33,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:33,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831931811] [2022-02-20 17:02:33,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:33,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:33,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {85#true} assume { :begin_inline_ULTIMATE.init } 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; {85#true} is VALID [2022-02-20 17:02:33,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {85#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {85#true} is VALID [2022-02-20 17:02:33,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {85#true} assume !!(main_~main__urilen~0#1 <= 1000000); {85#true} is VALID [2022-02-20 17:02:33,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {85#true} assume !!(main_~main__urilen~0#1 >= -1000000); {85#true} is VALID [2022-02-20 17:02:33,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {85#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {85#true} is VALID [2022-02-20 17:02:33,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {85#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {85#true} is VALID [2022-02-20 17:02:33,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {85#true} assume !!(main_~main__scheme~0#1 <= 1000000); {85#true} is VALID [2022-02-20 17:02:33,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {85#true} assume !!(main_~main__scheme~0#1 >= -1000000); {85#true} is VALID [2022-02-20 17:02:33,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {85#true} assume main_~main__urilen~0#1 > 0; {85#true} is VALID [2022-02-20 17:02:33,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {85#true} assume main_~main__tokenlen~0#1 > 0; {85#true} is VALID [2022-02-20 17:02:33,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {85#true} assume main_~main__scheme~0#1 >= 0; {85#true} is VALID [2022-02-20 17:02:33,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {85#true} assume !(0 == main_~main__scheme~0#1); {85#true} is VALID [2022-02-20 17:02:33,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {85#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {87#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 17:02:33,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {87#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {86#false} is VALID [2022-02-20 17:02:33,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {86#false} assume !false; {86#false} is VALID [2022-02-20 17:02:33,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:33,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:33,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831931811] [2022-02-20 17:02:33,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831931811] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:33,611 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:33,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:02:33,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262951082] [2022-02-20 17:02:33,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:33,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 17:02:33,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:33,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 17:02:33,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:02:33,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:33,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:02:33,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:02:33,659 INFO L87 Difference]: Start difference. First operand has 82 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 81 states have internal predecessors, (119), 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 has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 17:02:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,773 INFO L93 Difference]: Finished difference Result 88 states and 123 transitions. [2022-02-20 17:02:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:02:33,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 17:02:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 17:02:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 17:02:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 17:02:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 17:02:33,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-20 17:02:33,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,871 INFO L225 Difference]: With dead ends: 88 [2022-02-20 17:02:33,871 INFO L226 Difference]: Without dead ends: 76 [2022-02-20 17:02:33,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:02:33,875 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 75 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:33,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-02-20 17:02:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-02-20 17:02:33,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:33,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 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-02-20 17:02:33,896 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 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-02-20 17:02:33,902 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 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-02-20 17:02:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,905 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-02-20 17:02:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-02-20 17:02:33,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 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 76 states. [2022-02-20 17:02:33,907 INFO L87 Difference]: Start difference. First operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 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 76 states. [2022-02-20 17:02:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:33,909 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-02-20 17:02:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-02-20 17:02:33,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:33,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:33,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:33,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 75 states have internal predecessors, (79), 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-02-20 17:02:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-02-20 17:02:33,913 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 15 [2022-02-20 17:02:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:33,914 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-02-20 17:02:33,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 17:02:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-02-20 17:02:33,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:02:33,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:33,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:33,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:02:33,915 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:33,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1357026114, now seen corresponding path program 1 times [2022-02-20 17:02:33,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:33,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506936289] [2022-02-20 17:02:33,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:33,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {418#true} assume { :begin_inline_ULTIMATE.init } 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; {418#true} is VALID [2022-02-20 17:02:33,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {418#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {418#true} is VALID [2022-02-20 17:02:33,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {418#true} assume !!(main_~main__urilen~0#1 <= 1000000); {418#true} is VALID [2022-02-20 17:02:33,976 INFO L290 TraceCheckUtils]: 3: Hoare triple {418#true} assume !!(main_~main__urilen~0#1 >= -1000000); {418#true} is VALID [2022-02-20 17:02:33,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {418#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {418#true} is VALID [2022-02-20 17:02:33,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {418#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {418#true} is VALID [2022-02-20 17:02:33,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#true} assume !!(main_~main__scheme~0#1 <= 1000000); {418#true} is VALID [2022-02-20 17:02:33,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#true} assume !!(main_~main__scheme~0#1 >= -1000000); {418#true} is VALID [2022-02-20 17:02:33,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {418#true} assume main_~main__urilen~0#1 > 0; {418#true} is VALID [2022-02-20 17:02:33,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {418#true} assume main_~main__tokenlen~0#1 > 0; {418#true} is VALID [2022-02-20 17:02:33,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#true} assume main_~main__scheme~0#1 >= 0; {420#(< 0 (+ |ULTIMATE.start_main_~main__scheme~0#1| 1))} is VALID [2022-02-20 17:02:33,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(< 0 (+ |ULTIMATE.start_main_~main__scheme~0#1| 1))} assume !(0 == main_~main__scheme~0#1); {421#(not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0))} is VALID [2022-02-20 17:02:33,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#(not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0))} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {422#(<= 1 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:33,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {422#(<= 1 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {423#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))} is VALID [2022-02-20 17:02:33,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {423#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~1#1; {419#false} is VALID [2022-02-20 17:02:33,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {419#false} assume !false; {419#false} is VALID [2022-02-20 17:02:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:33,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:33,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506936289] [2022-02-20 17:02:33,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506936289] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:33,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:33,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:02:33,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719588414] [2022-02-20 17:02:33,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:33,981 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) Word has length 16 [2022-02-20 17:02:33,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:33,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-02-20 17:02:33,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:33,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:33,992 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:33,993 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-02-20 17:02:34,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,173 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2022-02-20 17:02:34,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:34,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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) Word has length 16 [2022-02-20 17:02:34,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-02-20 17:02:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-02-20 17:02:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-02-20 17:02:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-02-20 17:02:34,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-02-20 17:02:34,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,239 INFO L225 Difference]: With dead ends: 76 [2022-02-20 17:02:34,239 INFO L226 Difference]: Without dead ends: 74 [2022-02-20 17:02:34,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02-20 17:02:34,240 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 246 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:34,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [246 Valid, 80 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:34,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-02-20 17:02:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-02-20 17:02:34,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:34,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 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-02-20 17:02:34,265 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 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-02-20 17:02:34,266 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 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-02-20 17:02:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,271 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-02-20 17:02:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 17:02:34,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 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 74 states. [2022-02-20 17:02:34,276 INFO L87 Difference]: Start difference. First operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 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 74 states. [2022-02-20 17:02:34,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,280 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2022-02-20 17:02:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 17:02:34,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:34,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 73 states have internal predecessors, (77), 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-02-20 17:02:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2022-02-20 17:02:34,284 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2022-02-20 17:02:34,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:34,284 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2022-02-20 17:02:34,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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-02-20 17:02:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2022-02-20 17:02:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:02:34,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:34,285 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:34,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:02:34,287 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:34,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1567835227, now seen corresponding path program 1 times [2022-02-20 17:02:34,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:34,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702836528] [2022-02-20 17:02:34,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:34,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:34,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {736#true} assume { :begin_inline_ULTIMATE.init } 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; {736#true} is VALID [2022-02-20 17:02:34,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {736#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {736#true} is VALID [2022-02-20 17:02:34,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {736#true} assume !!(main_~main__urilen~0#1 <= 1000000); {736#true} is VALID [2022-02-20 17:02:34,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {736#true} assume !!(main_~main__urilen~0#1 >= -1000000); {736#true} is VALID [2022-02-20 17:02:34,389 INFO L290 TraceCheckUtils]: 4: Hoare triple {736#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {736#true} is VALID [2022-02-20 17:02:34,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {736#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {736#true} is VALID [2022-02-20 17:02:34,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {736#true} assume !!(main_~main__scheme~0#1 <= 1000000); {736#true} is VALID [2022-02-20 17:02:34,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {736#true} assume !!(main_~main__scheme~0#1 >= -1000000); {736#true} is VALID [2022-02-20 17:02:34,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {736#true} assume main_~main__urilen~0#1 > 0; {736#true} is VALID [2022-02-20 17:02:34,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {736#true} assume main_~main__tokenlen~0#1 > 0; {736#true} is VALID [2022-02-20 17:02:34,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {736#true} assume main_~main__scheme~0#1 >= 0; {736#true} is VALID [2022-02-20 17:02:34,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {736#true} assume !(0 == main_~main__scheme~0#1); {736#true} is VALID [2022-02-20 17:02:34,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {738#(<= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:34,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {738#(<= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {738#(<= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:34,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {738#(<= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {738#(<= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:34,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {738#(<= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {739#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))} is VALID [2022-02-20 17:02:34,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~2#1; {737#false} is VALID [2022-02-20 17:02:34,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {737#false} assume !false; {737#false} is VALID [2022-02-20 17:02:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:34,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:34,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702836528] [2022-02-20 17:02:34,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702836528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:34,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:34,394 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:02:34,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027542296] [2022-02-20 17:02:34,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:34,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2022-02-20 17:02:34,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:34,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-02-20 17:02:34,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:02:34,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:02:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:02:34,408 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-02-20 17:02:34,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,536 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-02-20 17:02:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:34,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2022-02-20 17:02:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:34,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-02-20 17:02:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-02-20 17:02:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-02-20 17:02:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-02-20 17:02:34,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 102 transitions. [2022-02-20 17:02:34,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,606 INFO L225 Difference]: With dead ends: 97 [2022-02-20 17:02:34,606 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 17:02:34,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-20 17:02:34,607 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 110 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:34,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 120 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 17:02:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2022-02-20 17:02:34,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:34,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 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-02-20 17:02:34,619 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 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-02-20 17:02:34,619 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 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-02-20 17:02:34,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,621 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-02-20 17:02:34,621 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-02-20 17:02:34,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,622 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 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 95 states. [2022-02-20 17:02:34,622 INFO L87 Difference]: Start difference. First operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 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 95 states. [2022-02-20 17:02:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,624 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-02-20 17:02:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-02-20 17:02:34,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,625 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:34,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:34,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 71 states have internal predecessors, (75), 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-02-20 17:02:34,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-02-20 17:02:34,626 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 18 [2022-02-20 17:02:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:34,627 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-02-20 17:02:34,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-02-20 17:02:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 17:02:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:02:34,627 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:34,628 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:02:34,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:02:34,628 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:34,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1358247672, now seen corresponding path program 1 times [2022-02-20 17:02:34,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:34,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299438099] [2022-02-20 17:02:34,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:34,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:34,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {1113#true} assume { :begin_inline_ULTIMATE.init } 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; {1113#true} is VALID [2022-02-20 17:02:34,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {1113#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1113#true} is VALID [2022-02-20 17:02:34,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {1113#true} assume !!(main_~main__urilen~0#1 <= 1000000); {1113#true} is VALID [2022-02-20 17:02:34,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {1113#true} assume !!(main_~main__urilen~0#1 >= -1000000); {1113#true} is VALID [2022-02-20 17:02:34,698 INFO L290 TraceCheckUtils]: 4: Hoare triple {1113#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {1113#true} is VALID [2022-02-20 17:02:34,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {1113#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {1113#true} is VALID [2022-02-20 17:02:34,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {1113#true} assume !!(main_~main__scheme~0#1 <= 1000000); {1113#true} is VALID [2022-02-20 17:02:34,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {1113#true} assume !!(main_~main__scheme~0#1 >= -1000000); {1113#true} is VALID [2022-02-20 17:02:34,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {1113#true} assume main_~main__urilen~0#1 > 0; {1113#true} is VALID [2022-02-20 17:02:34,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#true} assume main_~main__tokenlen~0#1 > 0; {1113#true} is VALID [2022-02-20 17:02:34,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {1113#true} assume main_~main__scheme~0#1 >= 0; {1115#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} is VALID [2022-02-20 17:02:34,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} assume !(0 == main_~main__scheme~0#1); {1115#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} is VALID [2022-02-20 17:02:34,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {1115#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1116#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:34,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {1116#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:34,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1116#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:34,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {1116#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:34,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {1117#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0))} is VALID [2022-02-20 17:02:34,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {1117#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~3#1; {1114#false} is VALID [2022-02-20 17:02:34,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {1114#false} assume !false; {1114#false} is VALID [2022-02-20 17:02:34,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-02-20 17:02:34,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:34,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299438099] [2022-02-20 17:02:34,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299438099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:34,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:34,702 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:34,702 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055697460] [2022-02-20 17:02:34,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:34,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19 [2022-02-20 17:02:34,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:34,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:34,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:34,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:34,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:34,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:34,714 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,852 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 17:02:34,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:34,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) Word has length 19 [2022-02-20 17:02:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-02-20 17:02:34,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:34,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-02-20 17:02:34,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2022-02-20 17:02:34,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:34,904 INFO L225 Difference]: With dead ends: 72 [2022-02-20 17:02:34,904 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 17:02:34,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:34,906 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 165 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:34,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 77 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:34,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 17:02:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-02-20 17:02:34,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:34,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 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-02-20 17:02:34,936 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 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-02-20 17:02:34,937 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 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-02-20 17:02:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,938 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-02-20 17:02:34,939 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-02-20 17:02:34,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 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 70 states. [2022-02-20 17:02:34,940 INFO L87 Difference]: Start difference. First operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 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 70 states. [2022-02-20 17:02:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:34,941 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2022-02-20 17:02:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-02-20 17:02:34,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:34,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:34,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:34,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 69 states have internal predecessors, (73), 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-02-20 17:02:34,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2022-02-20 17:02:34,943 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 19 [2022-02-20 17:02:34,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:34,944 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2022-02-20 17:02:34,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-20 17:02:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2022-02-20 17:02:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:02:34,945 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:34,945 INFO L514 BasicCegarLoop]: 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-02-20 17:02:34,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:02:34,945 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash -665385716, now seen corresponding path program 1 times [2022-02-20 17:02:34,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:34,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092285334] [2022-02-20 17:02:34,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:34,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {1414#true} assume { :begin_inline_ULTIMATE.init } 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; {1414#true} is VALID [2022-02-20 17:02:35,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {1414#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1414#true} is VALID [2022-02-20 17:02:35,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {1414#true} assume !!(main_~main__urilen~0#1 <= 1000000); {1414#true} is VALID [2022-02-20 17:02:35,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {1414#true} assume !!(main_~main__urilen~0#1 >= -1000000); {1414#true} is VALID [2022-02-20 17:02:35,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {1414#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {1414#true} is VALID [2022-02-20 17:02:35,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {1414#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {1414#true} is VALID [2022-02-20 17:02:35,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {1414#true} assume !!(main_~main__scheme~0#1 <= 1000000); {1414#true} is VALID [2022-02-20 17:02:35,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {1414#true} assume !!(main_~main__scheme~0#1 >= -1000000); {1414#true} is VALID [2022-02-20 17:02:35,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {1414#true} assume main_~main__urilen~0#1 > 0; {1414#true} is VALID [2022-02-20 17:02:35,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {1414#true} assume main_~main__tokenlen~0#1 > 0; {1414#true} is VALID [2022-02-20 17:02:35,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {1414#true} assume main_~main__scheme~0#1 >= 0; {1414#true} is VALID [2022-02-20 17:02:35,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {1414#true} assume !(0 == main_~main__scheme~0#1); {1414#true} is VALID [2022-02-20 17:02:35,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {1414#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1414#true} is VALID [2022-02-20 17:02:35,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {1414#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {1414#true} is VALID [2022-02-20 17:02:35,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {1414#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1414#true} is VALID [2022-02-20 17:02:35,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {1414#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {1416#(or (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1)) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)))} is VALID [2022-02-20 17:02:35,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {1416#(or (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1)) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)))} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {1417#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:35,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {1417#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {1417#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:35,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {1417#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {1417#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:35,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {1417#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {1418#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))} is VALID [2022-02-20 17:02:35,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {1418#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~16#1; {1415#false} is VALID [2022-02-20 17:02:35,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {1415#false} assume !false; {1415#false} is VALID [2022-02-20 17:02:35,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-02-20 17:02:35,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:35,034 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092285334] [2022-02-20 17:02:35,034 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092285334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:35,035 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:35,035 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:35,035 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538540184] [2022-02-20 17:02:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:35,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2022-02-20 17:02:35,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:35,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:35,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:35,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:35,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:35,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:35,049 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,325 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2022-02-20 17:02:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:02:35,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2022-02-20 17:02:35,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-02-20 17:02:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-02-20 17:02:35,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 143 transitions. [2022-02-20 17:02:35,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:35,421 INFO L225 Difference]: With dead ends: 137 [2022-02-20 17:02:35,421 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 17:02:35,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02-20 17:02:35,422 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 128 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:35,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 295 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 17:02:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 73. [2022-02-20 17:02:35,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:35,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 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-02-20 17:02:35,440 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 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-02-20 17:02:35,440 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 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-02-20 17:02:35,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,443 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2022-02-20 17:02:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2022-02-20 17:02:35,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:35,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:35,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 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 135 states. [2022-02-20 17:02:35,444 INFO L87 Difference]: Start difference. First operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 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 135 states. [2022-02-20 17:02:35,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,447 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2022-02-20 17:02:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2022-02-20 17:02:35,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:35,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:35,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:35,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:35,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 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-02-20 17:02:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-02-20 17:02:35,449 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 22 [2022-02-20 17:02:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:35,450 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-02-20 17:02:35,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-02-20 17:02:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 17:02:35,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:35,452 INFO L514 BasicCegarLoop]: 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-02-20 17:02:35,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 17:02:35,452 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash -661217951, now seen corresponding path program 1 times [2022-02-20 17:02:35,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:35,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365846378] [2022-02-20 17:02:35,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:35,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {1921#true} assume { :begin_inline_ULTIMATE.init } 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; {1921#true} is VALID [2022-02-20 17:02:35,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {1921#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {1921#true} is VALID [2022-02-20 17:02:35,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {1921#true} assume !!(main_~main__urilen~0#1 <= 1000000); {1921#true} is VALID [2022-02-20 17:02:35,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {1921#true} assume !!(main_~main__urilen~0#1 >= -1000000); {1921#true} is VALID [2022-02-20 17:02:35,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {1921#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {1921#true} is VALID [2022-02-20 17:02:35,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {1921#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {1921#true} is VALID [2022-02-20 17:02:35,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {1921#true} assume !!(main_~main__scheme~0#1 <= 1000000); {1921#true} is VALID [2022-02-20 17:02:35,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {1921#true} assume !!(main_~main__scheme~0#1 >= -1000000); {1921#true} is VALID [2022-02-20 17:02:35,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {1921#true} assume main_~main__urilen~0#1 > 0; {1921#true} is VALID [2022-02-20 17:02:35,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1921#true} assume main_~main__tokenlen~0#1 > 0; {1921#true} is VALID [2022-02-20 17:02:35,540 INFO L290 TraceCheckUtils]: 10: Hoare triple {1921#true} assume main_~main__scheme~0#1 >= 0; {1921#true} is VALID [2022-02-20 17:02:35,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {1921#true} assume !(0 == main_~main__scheme~0#1); {1921#true} is VALID [2022-02-20 17:02:35,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {1921#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1921#true} is VALID [2022-02-20 17:02:35,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {1921#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {1921#true} is VALID [2022-02-20 17:02:35,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {1921#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1921#true} is VALID [2022-02-20 17:02:35,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {1921#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {1923#(or (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1)) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)))} is VALID [2022-02-20 17:02:35,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {1923#(or (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1)) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)))} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {1924#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:35,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {1924#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {1924#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:35,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {1924#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(main_~main__cp~0#1 != main_~main__urilen~0#1 - 1); {1924#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:35,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {1924#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {1925#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 0))} is VALID [2022-02-20 17:02:35,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {1925#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~4#1; {1922#false} is VALID [2022-02-20 17:02:35,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {1922#false} assume !false; {1922#false} is VALID [2022-02-20 17:02:35,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:35,546 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:35,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365846378] [2022-02-20 17:02:35,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365846378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:35,546 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:35,546 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:35,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045935921] [2022-02-20 17:02:35,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:35,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2022-02-20 17:02:35,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:35,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:35,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:35,560 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:35,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:35,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:35,561 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,784 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-02-20 17:02:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:02:35,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) Word has length 22 [2022-02-20 17:02:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 17:02:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 17:02:35,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 110 transitions. [2022-02-20 17:02:35,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:35,833 INFO L225 Difference]: With dead ends: 104 [2022-02-20 17:02:35,833 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 17:02:35,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-02-20 17:02:35,834 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 117 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:35,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 171 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:35,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 17:02:35,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 75. [2022-02-20 17:02:35,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:35,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 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-02-20 17:02:35,867 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 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-02-20 17:02:35,867 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 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-02-20 17:02:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,868 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-02-20 17:02:35,869 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-02-20 17:02:35,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:35,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:35,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 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 102 states. [2022-02-20 17:02:35,869 INFO L87 Difference]: Start difference. First operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 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 102 states. [2022-02-20 17:02:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:35,871 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-02-20 17:02:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-02-20 17:02:35,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:35,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:35,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:35,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 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-02-20 17:02:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-02-20 17:02:35,873 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 22 [2022-02-20 17:02:35,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:35,873 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-02-20 17:02:35,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-02-20 17:02:35,873 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-02-20 17:02:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:02:35,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:35,874 INFO L514 BasicCegarLoop]: 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-02-20 17:02:35,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 17:02:35,874 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash 847883539, now seen corresponding path program 1 times [2022-02-20 17:02:35,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:35,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779363495] [2022-02-20 17:02:35,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:35,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:35,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {2330#true} assume { :begin_inline_ULTIMATE.init } 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; {2330#true} is VALID [2022-02-20 17:02:35,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {2330#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2330#true} is VALID [2022-02-20 17:02:35,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {2330#true} assume !!(main_~main__urilen~0#1 <= 1000000); {2330#true} is VALID [2022-02-20 17:02:35,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {2330#true} assume !!(main_~main__urilen~0#1 >= -1000000); {2330#true} is VALID [2022-02-20 17:02:35,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {2330#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {2330#true} is VALID [2022-02-20 17:02:35,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {2330#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {2330#true} is VALID [2022-02-20 17:02:35,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {2330#true} assume !!(main_~main__scheme~0#1 <= 1000000); {2330#true} is VALID [2022-02-20 17:02:35,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {2330#true} assume !!(main_~main__scheme~0#1 >= -1000000); {2330#true} is VALID [2022-02-20 17:02:35,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {2330#true} assume main_~main__urilen~0#1 > 0; {2330#true} is VALID [2022-02-20 17:02:35,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {2330#true} assume main_~main__tokenlen~0#1 > 0; {2330#true} is VALID [2022-02-20 17:02:35,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {2330#true} assume main_~main__scheme~0#1 >= 0; {2330#true} is VALID [2022-02-20 17:02:35,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {2330#true} assume !(0 == main_~main__scheme~0#1); {2330#true} is VALID [2022-02-20 17:02:35,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {2330#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {2330#true} is VALID [2022-02-20 17:02:35,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {2330#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {2330#true} is VALID [2022-02-20 17:02:35,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {2330#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2330#true} is VALID [2022-02-20 17:02:35,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {2330#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {2330#true} is VALID [2022-02-20 17:02:35,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {2330#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {2332#(or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0) (not (<= 0 |ULTIMATE.start_main_~main__cp~0#1|))) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)))} is VALID [2022-02-20 17:02:35,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {2332#(or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0) (not (<= 0 |ULTIMATE.start_main_~main__cp~0#1|))) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)))} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {2333#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:35,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {2333#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {2333#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:35,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {2333#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {2333#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:35,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {2333#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~16#1);havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~17#1;main_~__VERIFIER_assert__cond~17#1 := main_~__tmp_18~0#1; {2334#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0))} is VALID [2022-02-20 17:02:35,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {2334#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~17#1; {2331#false} is VALID [2022-02-20 17:02:35,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {2331#false} assume !false; {2331#false} is VALID [2022-02-20 17:02:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:35,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:35,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779363495] [2022-02-20 17:02:35,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779363495] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:35,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:35,957 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:35,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600887242] [2022-02-20 17:02:35,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:35,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) Word has length 23 [2022-02-20 17:02:35,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:35,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:35,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:35,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:35,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:35,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:35,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:35,970 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,179 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2022-02-20 17:02:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:36,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) Word has length 23 [2022-02-20 17:02:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:36,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-02-20 17:02:36,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2022-02-20 17:02:36,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 121 transitions. [2022-02-20 17:02:36,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:36,258 INFO L225 Difference]: With dead ends: 117 [2022-02-20 17:02:36,258 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 17:02:36,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:36,259 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 148 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:36,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 154 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:36,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 17:02:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2022-02-20 17:02:36,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:36,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 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-02-20 17:02:36,274 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 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-02-20 17:02:36,274 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 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-02-20 17:02:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,276 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-02-20 17:02:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-02-20 17:02:36,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 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 115 states. [2022-02-20 17:02:36,277 INFO L87 Difference]: Start difference. First operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 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 115 states. [2022-02-20 17:02:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,279 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-02-20 17:02:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-02-20 17:02:36,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:36,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 60 states have (on average 1.3) internal successors, (78), 72 states have internal predecessors, (78), 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-02-20 17:02:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-02-20 17:02:36,280 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 23 [2022-02-20 17:02:36,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:36,281 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-02-20 17:02:36,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:36,281 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-02-20 17:02:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:02:36,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:36,281 INFO L514 BasicCegarLoop]: 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-02-20 17:02:36,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 17:02:36,282 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash 977084131, now seen corresponding path program 1 times [2022-02-20 17:02:36,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:36,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098724859] [2022-02-20 17:02:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {2776#true} assume { :begin_inline_ULTIMATE.init } 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; {2776#true} is VALID [2022-02-20 17:02:36,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {2776#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {2776#true} is VALID [2022-02-20 17:02:36,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {2776#true} assume !!(main_~main__urilen~0#1 <= 1000000); {2776#true} is VALID [2022-02-20 17:02:36,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {2776#true} assume !!(main_~main__urilen~0#1 >= -1000000); {2776#true} is VALID [2022-02-20 17:02:36,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {2776#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {2776#true} is VALID [2022-02-20 17:02:36,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {2776#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {2776#true} is VALID [2022-02-20 17:02:36,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {2776#true} assume !!(main_~main__scheme~0#1 <= 1000000); {2776#true} is VALID [2022-02-20 17:02:36,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {2776#true} assume !!(main_~main__scheme~0#1 >= -1000000); {2776#true} is VALID [2022-02-20 17:02:36,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {2776#true} assume main_~main__urilen~0#1 > 0; {2776#true} is VALID [2022-02-20 17:02:36,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {2776#true} assume main_~main__tokenlen~0#1 > 0; {2776#true} is VALID [2022-02-20 17:02:36,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {2776#true} assume main_~main__scheme~0#1 >= 0; {2776#true} is VALID [2022-02-20 17:02:36,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {2776#true} assume !(0 == main_~main__scheme~0#1); {2776#true} is VALID [2022-02-20 17:02:36,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {2776#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {2776#true} is VALID [2022-02-20 17:02:36,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {2776#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {2776#true} is VALID [2022-02-20 17:02:36,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {2776#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {2776#true} is VALID [2022-02-20 17:02:36,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {2776#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {2776#true} is VALID [2022-02-20 17:02:36,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {2776#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {2778#(or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0) (not (<= 0 |ULTIMATE.start_main_~main__cp~0#1|))) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)))} is VALID [2022-02-20 17:02:36,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {2778#(or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 0) (not (<= 0 |ULTIMATE.start_main_~main__cp~0#1|))) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)))} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {2779#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:36,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {2779#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(main_~main__cp~0#1 != main_~main__urilen~0#1 - 1); {2779#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:36,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {2779#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {2779#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:36,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {2779#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {2780#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))} is VALID [2022-02-20 17:02:36,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {2780#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~5#1; {2777#false} is VALID [2022-02-20 17:02:36,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {2777#false} assume !false; {2777#false} is VALID [2022-02-20 17:02:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:36,335 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:36,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098724859] [2022-02-20 17:02:36,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098724859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:36,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:36,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:36,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143923006] [2022-02-20 17:02:36,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:36,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) Word has length 23 [2022-02-20 17:02:36,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:36,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:36,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:36,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:36,349 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:36,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:36,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:36,349 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,511 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-02-20 17:02:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:36,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) Word has length 23 [2022-02-20 17:02:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-02-20 17:02:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-02-20 17:02:36,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-02-20 17:02:36,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:36,552 INFO L225 Difference]: With dead ends: 73 [2022-02-20 17:02:36,552 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:02:36,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:36,553 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 132 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:36,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 94 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:36,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:02:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-20 17:02:36,568 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:36,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 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-02-20 17:02:36,568 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 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-02-20 17:02:36,568 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 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-02-20 17:02:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,569 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-02-20 17:02:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-02-20 17:02:36,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 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 71 states. [2022-02-20 17:02:36,570 INFO L87 Difference]: Start difference. First operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 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 71 states. [2022-02-20 17:02:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,571 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-02-20 17:02:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-02-20 17:02:36,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:36,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:36,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 70 states have internal predecessors, (76), 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-02-20 17:02:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-02-20 17:02:36,573 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 23 [2022-02-20 17:02:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:36,573 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-02-20 17:02:36,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-02-20 17:02:36,573 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-02-20 17:02:36,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:02:36,574 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:36,574 INFO L514 BasicCegarLoop]: 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] [2022-02-20 17:02:36,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 17:02:36,574 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1619855478, now seen corresponding path program 1 times [2022-02-20 17:02:36,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:36,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80420962] [2022-02-20 17:02:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:36,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {3085#true} assume { :begin_inline_ULTIMATE.init } 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; {3085#true} is VALID [2022-02-20 17:02:36,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {3085#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3085#true} is VALID [2022-02-20 17:02:36,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {3085#true} assume !!(main_~main__urilen~0#1 <= 1000000); {3085#true} is VALID [2022-02-20 17:02:36,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {3085#true} assume !!(main_~main__urilen~0#1 >= -1000000); {3085#true} is VALID [2022-02-20 17:02:36,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {3085#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {3085#true} is VALID [2022-02-20 17:02:36,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {3085#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {3085#true} is VALID [2022-02-20 17:02:36,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {3085#true} assume !!(main_~main__scheme~0#1 <= 1000000); {3085#true} is VALID [2022-02-20 17:02:36,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {3085#true} assume !!(main_~main__scheme~0#1 >= -1000000); {3085#true} is VALID [2022-02-20 17:02:36,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {3085#true} assume main_~main__urilen~0#1 > 0; {3085#true} is VALID [2022-02-20 17:02:36,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {3085#true} assume main_~main__tokenlen~0#1 > 0; {3085#true} is VALID [2022-02-20 17:02:36,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {3085#true} assume main_~main__scheme~0#1 >= 0; {3085#true} is VALID [2022-02-20 17:02:36,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {3085#true} assume !(0 == main_~main__scheme~0#1); {3085#true} is VALID [2022-02-20 17:02:36,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {3085#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {3085#true} is VALID [2022-02-20 17:02:36,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {3085#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {3085#true} is VALID [2022-02-20 17:02:36,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {3085#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {3085#true} is VALID [2022-02-20 17:02:36,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {3085#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {3085#true} is VALID [2022-02-20 17:02:36,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {3085#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {3085#true} is VALID [2022-02-20 17:02:36,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {3085#true} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {3085#true} is VALID [2022-02-20 17:02:36,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {3085#true} assume !(main_~main__cp~0#1 != main_~main__urilen~0#1 - 1); {3087#(= (+ (- 1) (* (- 1) |ULTIMATE.start_main_~main__cp~0#1|) |ULTIMATE.start_main_~main__urilen~0#1|) 0)} is VALID [2022-02-20 17:02:36,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {3087#(= (+ (- 1) (* (- 1) |ULTIMATE.start_main_~main__cp~0#1|) |ULTIMATE.start_main_~main__urilen~0#1|) 0)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {3087#(= (+ (- 1) (* (- 1) |ULTIMATE.start_main_~main__cp~0#1|) |ULTIMATE.start_main_~main__urilen~0#1|) 0)} is VALID [2022-02-20 17:02:36,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {3087#(= (+ (- 1) (* (- 1) |ULTIMATE.start_main_~main__cp~0#1|) |ULTIMATE.start_main_~main__urilen~0#1|) 0)} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {3087#(= (+ (- 1) (* (- 1) |ULTIMATE.start_main_~main__cp~0#1|) |ULTIMATE.start_main_~main__urilen~0#1|) 0)} is VALID [2022-02-20 17:02:36,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {3087#(= (+ (- 1) (* (- 1) |ULTIMATE.start_main_~main__cp~0#1|) |ULTIMATE.start_main_~main__urilen~0#1|) 0)} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {3087#(= (+ (- 1) (* (- 1) |ULTIMATE.start_main_~main__cp~0#1|) |ULTIMATE.start_main_~main__urilen~0#1|) 0)} is VALID [2022-02-20 17:02:36,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {3087#(= (+ (- 1) (* (- 1) |ULTIMATE.start_main_~main__cp~0#1|) |ULTIMATE.start_main_~main__urilen~0#1|) 0)} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {3086#false} is VALID [2022-02-20 17:02:36,624 INFO L290 TraceCheckUtils]: 23: Hoare triple {3086#false} assume 0 == main_~__VERIFIER_assert__cond~6#1; {3086#false} is VALID [2022-02-20 17:02:36,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {3086#false} assume !false; {3086#false} is VALID [2022-02-20 17:02:36,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:36,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:36,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80420962] [2022-02-20 17:02:36,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80420962] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:36,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:36,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:02:36,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956433181] [2022-02-20 17:02:36,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:36,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 25 [2022-02-20 17:02:36,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:36,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-20 17:02:36,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:36,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:02:36,640 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:36,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:02:36,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:02:36,640 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-20 17:02:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,742 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2022-02-20 17:02:36,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:02:36,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 25 [2022-02-20 17:02:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:36,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-20 17:02:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 17:02:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-20 17:02:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 17:02:36,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-20 17:02:36,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:36,804 INFO L225 Difference]: With dead ends: 111 [2022-02-20 17:02:36,804 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:02:36,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:02:36,805 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:36,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:02:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-20 17:02:36,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:36,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 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-02-20 17:02:36,820 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 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-02-20 17:02:36,820 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 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-02-20 17:02:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,822 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-02-20 17:02:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-02-20 17:02:36,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 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 71 states. [2022-02-20 17:02:36,822 INFO L87 Difference]: Start difference. First operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 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 71 states. [2022-02-20 17:02:36,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:36,823 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-02-20 17:02:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-02-20 17:02:36,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:36,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:36,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:36,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 70 states have internal predecessors, (74), 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-02-20 17:02:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-02-20 17:02:36,825 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 25 [2022-02-20 17:02:36,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:36,825 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-02-20 17:02:36,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-02-20 17:02:36,825 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-02-20 17:02:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:02:36,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:36,826 INFO L514 BasicCegarLoop]: 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] [2022-02-20 17:02:36,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 17:02:36,826 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 595608307, now seen corresponding path program 1 times [2022-02-20 17:02:36,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:36,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851495014] [2022-02-20 17:02:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {3429#true} assume { :begin_inline_ULTIMATE.init } 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; {3429#true} is VALID [2022-02-20 17:02:36,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {3429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3429#true} is VALID [2022-02-20 17:02:36,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {3429#true} assume !!(main_~main__urilen~0#1 <= 1000000); {3429#true} is VALID [2022-02-20 17:02:36,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {3429#true} assume !!(main_~main__urilen~0#1 >= -1000000); {3429#true} is VALID [2022-02-20 17:02:36,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {3429#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {3429#true} is VALID [2022-02-20 17:02:36,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {3429#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {3429#true} is VALID [2022-02-20 17:02:36,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#true} assume !!(main_~main__scheme~0#1 <= 1000000); {3429#true} is VALID [2022-02-20 17:02:36,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#true} assume !!(main_~main__scheme~0#1 >= -1000000); {3429#true} is VALID [2022-02-20 17:02:36,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {3429#true} assume main_~main__urilen~0#1 > 0; {3429#true} is VALID [2022-02-20 17:02:36,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {3429#true} assume main_~main__tokenlen~0#1 > 0; {3429#true} is VALID [2022-02-20 17:02:36,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {3429#true} assume main_~main__scheme~0#1 >= 0; {3429#true} is VALID [2022-02-20 17:02:36,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {3429#true} assume !(0 == main_~main__scheme~0#1); {3429#true} is VALID [2022-02-20 17:02:36,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {3429#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,879 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~16#1);havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~17#1;main_~__VERIFIER_assert__cond~17#1 := main_~__tmp_18~0#1; {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~17#1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:36,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {3433#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))} is VALID [2022-02-20 17:02:36,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {3433#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~16#1; {3430#false} is VALID [2022-02-20 17:02:36,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {3430#false} assume !false; {3430#false} is VALID [2022-02-20 17:02:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:02:36,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:36,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851495014] [2022-02-20 17:02:36,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851495014] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:02:36,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806784552] [2022-02-20 17:02:36,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:36,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:36,886 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-02-20 17:02:36,887 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-02-20 17:02:36,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:02:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:36,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:02:37,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {3429#true} assume { :begin_inline_ULTIMATE.init } 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; {3429#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {3429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3429#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {3429#true} assume !!(main_~main__urilen~0#1 <= 1000000); {3429#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {3429#true} assume !!(main_~main__urilen~0#1 >= -1000000); {3429#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {3429#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {3429#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {3429#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {3429#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#true} assume !!(main_~main__scheme~0#1 <= 1000000); {3429#true} is VALID [2022-02-20 17:02:37,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#true} assume !!(main_~main__scheme~0#1 >= -1000000); {3429#true} is VALID [2022-02-20 17:02:37,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {3429#true} assume main_~main__urilen~0#1 > 0; {3429#true} is VALID [2022-02-20 17:02:37,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {3429#true} assume main_~main__tokenlen~0#1 > 0; {3429#true} is VALID [2022-02-20 17:02:37,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {3429#true} assume main_~main__scheme~0#1 >= 0; {3429#true} is VALID [2022-02-20 17:02:37,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {3429#true} assume !(0 == main_~main__scheme~0#1); {3429#true} is VALID [2022-02-20 17:02:37,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {3429#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~16#1);havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~17#1;main_~__VERIFIER_assert__cond~17#1 := main_~__tmp_18~0#1; {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~17#1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {3506#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|)} is VALID [2022-02-20 17:02:37,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {3506#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|)} assume 0 == main_~__VERIFIER_assert__cond~16#1; {3430#false} is VALID [2022-02-20 17:02:37,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {3430#false} assume !false; {3430#false} is VALID [2022-02-20 17:02:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:02:37,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:02:37,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {3430#false} assume !false; {3430#false} is VALID [2022-02-20 17:02:37,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {3506#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|)} assume 0 == main_~__VERIFIER_assert__cond~16#1; {3430#false} is VALID [2022-02-20 17:02:37,218 INFO L290 TraceCheckUtils]: 23: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {3506#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|)} is VALID [2022-02-20 17:02:37,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~17#1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~16#1);havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~17#1;main_~__VERIFIER_assert__cond~17#1 := main_~__tmp_18~0#1; {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {3432#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {3429#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {3431#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {3429#true} assume !(0 == main_~main__scheme~0#1); {3429#true} is VALID [2022-02-20 17:02:37,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {3429#true} assume main_~main__scheme~0#1 >= 0; {3429#true} is VALID [2022-02-20 17:02:37,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {3429#true} assume main_~main__tokenlen~0#1 > 0; {3429#true} is VALID [2022-02-20 17:02:37,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {3429#true} assume main_~main__urilen~0#1 > 0; {3429#true} is VALID [2022-02-20 17:02:37,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {3429#true} assume !!(main_~main__scheme~0#1 >= -1000000); {3429#true} is VALID [2022-02-20 17:02:37,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {3429#true} assume !!(main_~main__scheme~0#1 <= 1000000); {3429#true} is VALID [2022-02-20 17:02:37,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {3429#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {3429#true} is VALID [2022-02-20 17:02:37,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {3429#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {3429#true} is VALID [2022-02-20 17:02:37,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {3429#true} assume !!(main_~main__urilen~0#1 >= -1000000); {3429#true} is VALID [2022-02-20 17:02:37,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {3429#true} assume !!(main_~main__urilen~0#1 <= 1000000); {3429#true} is VALID [2022-02-20 17:02:37,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {3429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {3429#true} is VALID [2022-02-20 17:02:37,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {3429#true} assume { :begin_inline_ULTIMATE.init } 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; {3429#true} is VALID [2022-02-20 17:02:37,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:02:37,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806784552] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:02:37,225 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:02:37,226 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-02-20 17:02:37,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735947444] [2022-02-20 17:02:37,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:02:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) Word has length 26 [2022-02-20 17:02:37,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:37,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-02-20 17:02:37,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:37,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:37,240 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:37,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:37,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:37,241 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-02-20 17:02:37,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:37,450 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-02-20 17:02:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:37,450 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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) Word has length 26 [2022-02-20 17:02:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-02-20 17:02:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-02-20 17:02:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-02-20 17:02:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-02-20 17:02:37,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2022-02-20 17:02:37,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:37,530 INFO L225 Difference]: With dead ends: 111 [2022-02-20 17:02:37,530 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 17:02:37,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:02:37,531 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 177 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:37,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 128 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:37,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 17:02:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 68. [2022-02-20 17:02:37,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:37,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 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-02-20 17:02:37,553 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 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-02-20 17:02:37,553 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 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-02-20 17:02:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:37,554 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-02-20 17:02:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-02-20 17:02:37,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:37,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:37,555 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 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 109 states. [2022-02-20 17:02:37,555 INFO L87 Difference]: Start difference. First operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 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 109 states. [2022-02-20 17:02:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:37,556 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-02-20 17:02:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2022-02-20 17:02:37,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:37,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:37,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:37,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 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-02-20 17:02:37,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2022-02-20 17:02:37,558 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 26 [2022-02-20 17:02:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:37,558 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2022-02-20 17:02:37,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-02-20 17:02:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2022-02-20 17:02:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:02:37,559 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:37,559 INFO L514 BasicCegarLoop]: 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-02-20 17:02:37,593 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-02-20 17:02:37,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 17:02:37,772 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:37,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:37,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1780382557, now seen corresponding path program 1 times [2022-02-20 17:02:37,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:37,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730950067] [2022-02-20 17:02:37,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:37,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:37,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {4004#true} assume { :begin_inline_ULTIMATE.init } 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; {4004#true} is VALID [2022-02-20 17:02:37,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {4004#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4004#true} is VALID [2022-02-20 17:02:37,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {4004#true} assume !!(main_~main__urilen~0#1 <= 1000000); {4004#true} is VALID [2022-02-20 17:02:37,856 INFO L290 TraceCheckUtils]: 3: Hoare triple {4004#true} assume !!(main_~main__urilen~0#1 >= -1000000); {4004#true} is VALID [2022-02-20 17:02:37,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {4004#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {4004#true} is VALID [2022-02-20 17:02:37,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {4004#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {4004#true} is VALID [2022-02-20 17:02:37,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {4004#true} assume !!(main_~main__scheme~0#1 <= 1000000); {4004#true} is VALID [2022-02-20 17:02:37,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {4004#true} assume !!(main_~main__scheme~0#1 >= -1000000); {4004#true} is VALID [2022-02-20 17:02:37,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {4004#true} assume main_~main__urilen~0#1 > 0; {4004#true} is VALID [2022-02-20 17:02:37,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {4004#true} assume main_~main__tokenlen~0#1 > 0; {4004#true} is VALID [2022-02-20 17:02:37,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {4004#true} assume main_~main__scheme~0#1 >= 0; {4004#true} is VALID [2022-02-20 17:02:37,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {4004#true} assume !(0 == main_~main__scheme~0#1); {4004#true} is VALID [2022-02-20 17:02:37,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {4004#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:37,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {4006#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} is VALID [2022-02-20 17:02:37,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} is VALID [2022-02-20 17:02:37,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} is VALID [2022-02-20 17:02:37,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} is VALID [2022-02-20 17:02:37,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} is VALID [2022-02-20 17:02:37,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {4007#(and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (not (= (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)))} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {4008#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))} is VALID [2022-02-20 17:02:37,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {4008#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~6#1; {4005#false} is VALID [2022-02-20 17:02:37,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {4005#false} assume !false; {4005#false} is VALID [2022-02-20 17:02:37,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:37,864 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:37,864 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730950067] [2022-02-20 17:02:37,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730950067] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:37,864 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:37,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:37,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263277545] [2022-02-20 17:02:37,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:37,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) Word has length 26 [2022-02-20 17:02:37,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:37,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-02-20 17:02:37,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:37,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:37,878 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:37,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:37,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:37,879 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-02-20 17:02:38,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:38,017 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2022-02-20 17:02:38,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:38,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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) Word has length 26 [2022-02-20 17:02:38,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-02-20 17:02:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-02-20 17:02:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-02-20 17:02:38,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-02-20 17:02:38,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2022-02-20 17:02:38,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:38,066 INFO L225 Difference]: With dead ends: 69 [2022-02-20 17:02:38,066 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 17:02:38,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:38,067 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 116 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:38,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 72 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 17:02:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2022-02-20 17:02:38,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:38,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 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-02-20 17:02:38,085 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 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-02-20 17:02:38,085 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 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-02-20 17:02:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:38,086 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-02-20 17:02:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-02-20 17:02:38,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:38,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:38,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 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 67 states. [2022-02-20 17:02:38,087 INFO L87 Difference]: Start difference. First operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 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 67 states. [2022-02-20 17:02:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:38,088 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-02-20 17:02:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-02-20 17:02:38,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:38,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:38,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:38,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 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-02-20 17:02:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-02-20 17:02:38,089 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 26 [2022-02-20 17:02:38,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:38,090 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-02-20 17:02:38,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-02-20 17:02:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 17:02:38,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 17:02:38,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:38,090 INFO L514 BasicCegarLoop]: 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] [2022-02-20 17:02:38,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 17:02:38,091 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:38,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:38,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1280139623, now seen corresponding path program 1 times [2022-02-20 17:02:38,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:38,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312408926] [2022-02-20 17:02:38,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:38,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:38,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {4297#true} assume { :begin_inline_ULTIMATE.init } 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; {4297#true} is VALID [2022-02-20 17:02:38,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {4297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4297#true} is VALID [2022-02-20 17:02:38,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {4297#true} assume !!(main_~main__urilen~0#1 <= 1000000); {4297#true} is VALID [2022-02-20 17:02:38,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {4297#true} assume !!(main_~main__urilen~0#1 >= -1000000); {4297#true} is VALID [2022-02-20 17:02:38,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {4297#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {4297#true} is VALID [2022-02-20 17:02:38,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {4297#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {4297#true} is VALID [2022-02-20 17:02:38,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {4297#true} assume !!(main_~main__scheme~0#1 <= 1000000); {4297#true} is VALID [2022-02-20 17:02:38,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {4297#true} assume !!(main_~main__scheme~0#1 >= -1000000); {4297#true} is VALID [2022-02-20 17:02:38,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {4297#true} assume main_~main__urilen~0#1 > 0; {4297#true} is VALID [2022-02-20 17:02:38,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {4297#true} assume main_~main__tokenlen~0#1 > 0; {4297#true} is VALID [2022-02-20 17:02:38,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {4297#true} assume main_~main__scheme~0#1 >= 0; {4297#true} is VALID [2022-02-20 17:02:38,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {4297#true} assume !(0 == main_~main__scheme~0#1); {4297#true} is VALID [2022-02-20 17:02:38,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {4297#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~16#1);havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~17#1;main_~__VERIFIER_assert__cond~17#1 := main_~__tmp_18~0#1; {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,138 INFO L290 TraceCheckUtils]: 21: Hoare triple {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~17#1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,139 INFO L290 TraceCheckUtils]: 24: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {4301#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 0))} is VALID [2022-02-20 17:02:38,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {4301#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~4#1; {4298#false} is VALID [2022-02-20 17:02:38,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2022-02-20 17:02:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:02:38,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:38,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312408926] [2022-02-20 17:02:38,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312408926] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:02:38,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747285062] [2022-02-20 17:02:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:38,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:38,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:38,147 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-02-20 17:02:38,148 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-02-20 17:02:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:38,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:02:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:38,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:02:38,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {4297#true} assume { :begin_inline_ULTIMATE.init } 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; {4297#true} is VALID [2022-02-20 17:02:38,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {4297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4297#true} is VALID [2022-02-20 17:02:38,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {4297#true} assume !!(main_~main__urilen~0#1 <= 1000000); {4297#true} is VALID [2022-02-20 17:02:38,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {4297#true} assume !!(main_~main__urilen~0#1 >= -1000000); {4297#true} is VALID [2022-02-20 17:02:38,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {4297#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {4297#true} is VALID [2022-02-20 17:02:38,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {4297#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {4297#true} is VALID [2022-02-20 17:02:38,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {4297#true} assume !!(main_~main__scheme~0#1 <= 1000000); {4297#true} is VALID [2022-02-20 17:02:38,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {4297#true} assume !!(main_~main__scheme~0#1 >= -1000000); {4297#true} is VALID [2022-02-20 17:02:38,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {4297#true} assume main_~main__urilen~0#1 > 0; {4297#true} is VALID [2022-02-20 17:02:38,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {4297#true} assume main_~main__tokenlen~0#1 > 0; {4297#true} is VALID [2022-02-20 17:02:38,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {4297#true} assume main_~main__scheme~0#1 >= 0; {4297#true} is VALID [2022-02-20 17:02:38,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {4297#true} assume !(0 == main_~main__scheme~0#1); {4297#true} is VALID [2022-02-20 17:02:38,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {4297#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,343 INFO L290 TraceCheckUtils]: 18: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~16#1);havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~17#1;main_~__VERIFIER_assert__cond~17#1 := main_~__tmp_18~0#1; {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~17#1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {4377#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)} is VALID [2022-02-20 17:02:38,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {4377#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)} assume 0 == main_~__VERIFIER_assert__cond~4#1; {4298#false} is VALID [2022-02-20 17:02:38,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2022-02-20 17:02:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:02:38,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:02:38,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2022-02-20 17:02:38,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {4377#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)} assume 0 == main_~__VERIFIER_assert__cond~4#1; {4298#false} is VALID [2022-02-20 17:02:38,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {4377#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)} is VALID [2022-02-20 17:02:38,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~17#1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~16#1);havoc main_~__tmp_18~0#1;main_~__tmp_18~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~17#1;main_~__VERIFIER_assert__cond~17#1 := main_~__tmp_18~0#1; {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_1~0#1);havoc main_~__tmp_17~0#1;main_~__tmp_17~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~16#1;main_~__VERIFIER_assert__cond~16#1 := main_~__tmp_17~0#1; {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4300#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {4297#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {4299#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:38,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {4297#true} assume !(0 == main_~main__scheme~0#1); {4297#true} is VALID [2022-02-20 17:02:38,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {4297#true} assume main_~main__scheme~0#1 >= 0; {4297#true} is VALID [2022-02-20 17:02:38,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {4297#true} assume main_~main__tokenlen~0#1 > 0; {4297#true} is VALID [2022-02-20 17:02:38,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {4297#true} assume main_~main__urilen~0#1 > 0; {4297#true} is VALID [2022-02-20 17:02:38,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {4297#true} assume !!(main_~main__scheme~0#1 >= -1000000); {4297#true} is VALID [2022-02-20 17:02:38,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {4297#true} assume !!(main_~main__scheme~0#1 <= 1000000); {4297#true} is VALID [2022-02-20 17:02:38,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {4297#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {4297#true} is VALID [2022-02-20 17:02:38,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {4297#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {4297#true} is VALID [2022-02-20 17:02:38,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {4297#true} assume !!(main_~main__urilen~0#1 >= -1000000); {4297#true} is VALID [2022-02-20 17:02:38,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {4297#true} assume !!(main_~main__urilen~0#1 <= 1000000); {4297#true} is VALID [2022-02-20 17:02:38,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {4297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4297#true} is VALID [2022-02-20 17:02:38,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {4297#true} assume { :begin_inline_ULTIMATE.init } 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; {4297#true} is VALID [2022-02-20 17:02:38,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:02:38,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747285062] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:02:38,511 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:02:38,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-02-20 17:02:38,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252329195] [2022-02-20 17:02:38,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:02:38,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) Word has length 27 [2022-02-20 17:02:38,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:38,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-02-20 17:02:38,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:38,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:38,530 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:38,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:38,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:38,530 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-02-20 17:02:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:38,668 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-02-20 17:02:38,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:38,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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) Word has length 27 [2022-02-20 17:02:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-02-20 17:02:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-02-20 17:02:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-02-20 17:02:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-02-20 17:02:38,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2022-02-20 17:02:38,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:38,710 INFO L225 Difference]: With dead ends: 67 [2022-02-20 17:02:38,710 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 17:02:38,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:02:38,710 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 77 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:38,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 90 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:38,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 17:02:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2022-02-20 17:02:38,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:38,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 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-02-20 17:02:38,726 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 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-02-20 17:02:38,726 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 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-02-20 17:02:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:38,727 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-02-20 17:02:38,727 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-02-20 17:02:38,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:38,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:38,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 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 65 states. [2022-02-20 17:02:38,728 INFO L87 Difference]: Start difference. First operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 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 65 states. [2022-02-20 17:02:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:38,728 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-02-20 17:02:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-02-20 17:02:38,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:38,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:38,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:38,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:38,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 59 states have internal predecessors, (62), 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-02-20 17:02:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-02-20 17:02:38,730 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 27 [2022-02-20 17:02:38,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:38,730 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-02-20 17:02:38,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-02-20 17:02:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-02-20 17:02:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 17:02:38,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:38,731 INFO L514 BasicCegarLoop]: 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-02-20 17:02:38,752 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-02-20 17:02:38,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 17:02:38,939 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:38,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:38,940 INFO L85 PathProgramCache]: Analyzing trace with hash -642711428, now seen corresponding path program 1 times [2022-02-20 17:02:38,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:38,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882804953] [2022-02-20 17:02:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:38,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:38,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {4733#true} assume { :begin_inline_ULTIMATE.init } 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; {4733#true} is VALID [2022-02-20 17:02:38,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {4733#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4733#true} is VALID [2022-02-20 17:02:38,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {4733#true} assume !!(main_~main__urilen~0#1 <= 1000000); {4733#true} is VALID [2022-02-20 17:02:38,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {4733#true} assume !!(main_~main__urilen~0#1 >= -1000000); {4733#true} is VALID [2022-02-20 17:02:38,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {4733#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {4733#true} is VALID [2022-02-20 17:02:38,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {4733#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {4733#true} is VALID [2022-02-20 17:02:38,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {4733#true} assume !!(main_~main__scheme~0#1 <= 1000000); {4733#true} is VALID [2022-02-20 17:02:38,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {4733#true} assume !!(main_~main__scheme~0#1 >= -1000000); {4733#true} is VALID [2022-02-20 17:02:38,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {4733#true} assume main_~main__urilen~0#1 > 0; {4733#true} is VALID [2022-02-20 17:02:38,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {4733#true} assume main_~main__tokenlen~0#1 > 0; {4733#true} is VALID [2022-02-20 17:02:38,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {4733#true} assume main_~main__scheme~0#1 >= 0; {4735#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} is VALID [2022-02-20 17:02:38,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {4735#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} assume !(0 == main_~main__scheme~0#1); {4735#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} is VALID [2022-02-20 17:02:38,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {4735#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:38,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {4736#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {4737#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0))} is VALID [2022-02-20 17:02:38,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {4737#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~7#1; {4734#false} is VALID [2022-02-20 17:02:38,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {4734#false} assume !false; {4734#false} is VALID [2022-02-20 17:02:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:38,993 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:38,993 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882804953] [2022-02-20 17:02:38,993 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882804953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:38,993 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:38,993 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:38,993 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801398079] [2022-02-20 17:02:38,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:38,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) Word has length 27 [2022-02-20 17:02:38,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:38,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-02-20 17:02:39,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:39,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:39,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:39,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:39,014 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-02-20 17:02:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:39,140 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2022-02-20 17:02:39,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:39,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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) Word has length 27 [2022-02-20 17:02:39,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-02-20 17:02:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:02:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-02-20 17:02:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:02:39,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-02-20 17:02:39,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:39,184 INFO L225 Difference]: With dead ends: 60 [2022-02-20 17:02:39,184 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 17:02:39,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:39,184 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 108 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:39,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 68 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 17:02:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-20 17:02:39,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:39,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 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-02-20 17:02:39,213 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 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-02-20 17:02:39,214 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 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-02-20 17:02:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:39,214 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-02-20 17:02:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-02-20 17:02:39,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:39,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:39,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 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 58 states. [2022-02-20 17:02:39,215 INFO L87 Difference]: Start difference. First operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 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 58 states. [2022-02-20 17:02:39,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:39,215 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2022-02-20 17:02:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-02-20 17:02:39,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:39,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:39,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:39,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 50 states have (on average 1.2) internal successors, (60), 57 states have internal predecessors, (60), 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-02-20 17:02:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-02-20 17:02:39,217 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 27 [2022-02-20 17:02:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:39,217 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-02-20 17:02:39,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-02-20 17:02:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-02-20 17:02:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:02:39,218 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:39,218 INFO L514 BasicCegarLoop]: 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-02-20 17:02:39,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 17:02:39,218 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:39,219 INFO L85 PathProgramCache]: Analyzing trace with hash -47880409, now seen corresponding path program 1 times [2022-02-20 17:02:39,219 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:39,219 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806565268] [2022-02-20 17:02:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:39,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {4986#true} assume { :begin_inline_ULTIMATE.init } 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; {4986#true} is VALID [2022-02-20 17:02:39,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {4986#true} is VALID [2022-02-20 17:02:39,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} assume !!(main_~main__urilen~0#1 <= 1000000); {4986#true} is VALID [2022-02-20 17:02:39,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {4986#true} assume !!(main_~main__urilen~0#1 >= -1000000); {4986#true} is VALID [2022-02-20 17:02:39,270 INFO L290 TraceCheckUtils]: 4: Hoare triple {4986#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {4986#true} is VALID [2022-02-20 17:02:39,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {4986#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {4986#true} is VALID [2022-02-20 17:02:39,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {4986#true} assume !!(main_~main__scheme~0#1 <= 1000000); {4986#true} is VALID [2022-02-20 17:02:39,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {4986#true} assume !!(main_~main__scheme~0#1 >= -1000000); {4986#true} is VALID [2022-02-20 17:02:39,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {4986#true} assume main_~main__urilen~0#1 > 0; {4986#true} is VALID [2022-02-20 17:02:39,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {4986#true} assume main_~main__tokenlen~0#1 > 0; {4986#true} is VALID [2022-02-20 17:02:39,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {4986#true} assume main_~main__scheme~0#1 >= 0; {4986#true} is VALID [2022-02-20 17:02:39,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {4986#true} assume !(0 == main_~main__scheme~0#1); {4986#true} is VALID [2022-02-20 17:02:39,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {4986#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {4989#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:39,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {4988#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {4990#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))} is VALID [2022-02-20 17:02:39,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {4990#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~8#1; {4987#false} is VALID [2022-02-20 17:02:39,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2022-02-20 17:02:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:39,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:39,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806565268] [2022-02-20 17:02:39,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806565268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:39,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:39,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:39,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751972527] [2022-02-20 17:02:39,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:39,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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) Word has length 30 [2022-02-20 17:02:39,282 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:39,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-02-20 17:02:39,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:39,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:39,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:39,305 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-02-20 17:02:39,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:39,424 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-02-20 17:02:39,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:39,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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) Word has length 30 [2022-02-20 17:02:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-02-20 17:02:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 17:02:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-02-20 17:02:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 17:02:39,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-02-20 17:02:39,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:39,463 INFO L225 Difference]: With dead ends: 59 [2022-02-20 17:02:39,463 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 17:02:39,464 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:39,464 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 64 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:39,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:39,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 17:02:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-02-20 17:02:39,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:39,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 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-02-20 17:02:39,480 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 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-02-20 17:02:39,480 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 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-02-20 17:02:39,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:39,481 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-02-20 17:02:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-02-20 17:02:39,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:39,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:39,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 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 57 states. [2022-02-20 17:02:39,481 INFO L87 Difference]: Start difference. First operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 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 57 states. [2022-02-20 17:02:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:39,482 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-02-20 17:02:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-02-20 17:02:39,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:39,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:39,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:39,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.183673469387755) internal successors, (58), 55 states have internal predecessors, (58), 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-02-20 17:02:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-02-20 17:02:39,483 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 30 [2022-02-20 17:02:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:39,484 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-02-20 17:02:39,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-02-20 17:02:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-02-20 17:02:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:02:39,484 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:39,485 INFO L514 BasicCegarLoop]: 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-02-20 17:02:39,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 17:02:39,485 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1484288504, now seen corresponding path program 1 times [2022-02-20 17:02:39,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:39,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748573787] [2022-02-20 17:02:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:39,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {5235#true} assume { :begin_inline_ULTIMATE.init } 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; {5235#true} is VALID [2022-02-20 17:02:39,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {5235#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {5235#true} is VALID [2022-02-20 17:02:39,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {5235#true} assume !!(main_~main__urilen~0#1 <= 1000000); {5235#true} is VALID [2022-02-20 17:02:39,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {5235#true} assume !!(main_~main__urilen~0#1 >= -1000000); {5235#true} is VALID [2022-02-20 17:02:39,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {5235#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {5235#true} is VALID [2022-02-20 17:02:39,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {5235#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {5235#true} is VALID [2022-02-20 17:02:39,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {5235#true} assume !!(main_~main__scheme~0#1 <= 1000000); {5235#true} is VALID [2022-02-20 17:02:39,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {5235#true} assume !!(main_~main__scheme~0#1 >= -1000000); {5235#true} is VALID [2022-02-20 17:02:39,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {5235#true} assume main_~main__urilen~0#1 > 0; {5235#true} is VALID [2022-02-20 17:02:39,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {5235#true} assume main_~main__tokenlen~0#1 > 0; {5235#true} is VALID [2022-02-20 17:02:39,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {5235#true} assume main_~main__scheme~0#1 >= 0; {5237#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} is VALID [2022-02-20 17:02:39,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {5237#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} assume !(0 == main_~main__scheme~0#1); {5237#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} is VALID [2022-02-20 17:02:39,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {5237#(<= 0 |ULTIMATE.start_main_~main__scheme~0#1|)} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {5238#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {5239#(<= 1 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {5239#(<= 1 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {5239#(<= 1 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:39,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {5239#(<= 1 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {5240#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0))} is VALID [2022-02-20 17:02:39,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {5240#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~9#1; {5236#false} is VALID [2022-02-20 17:02:39,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {5236#false} assume !false; {5236#false} is VALID [2022-02-20 17:02:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:39,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:39,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748573787] [2022-02-20 17:02:39,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748573787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:39,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:39,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:02:39,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68855335] [2022-02-20 17:02:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:39,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) Word has length 31 [2022-02-20 17:02:39,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:39,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-02-20 17:02:39,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:39,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:39,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:39,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:39,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:39,569 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-02-20 17:02:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:39,746 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-02-20 17:02:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:39,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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) Word has length 31 [2022-02-20 17:02:39,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-02-20 17:02:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-02-20 17:02:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-02-20 17:02:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-02-20 17:02:39,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-02-20 17:02:39,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:39,797 INFO L225 Difference]: With dead ends: 67 [2022-02-20 17:02:39,797 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 17:02:39,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:02:39,797 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 101 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:39,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 86 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 17:02:39,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-02-20 17:02:39,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:39,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 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-02-20 17:02:39,813 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 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-02-20 17:02:39,813 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 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-02-20 17:02:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:39,814 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-02-20 17:02:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-02-20 17:02:39,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:39,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:39,814 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 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 65 states. [2022-02-20 17:02:39,814 INFO L87 Difference]: Start difference. First operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 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 65 states. [2022-02-20 17:02:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:39,815 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-02-20 17:02:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-02-20 17:02:39,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:39,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:39,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:39,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 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-02-20 17:02:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-02-20 17:02:39,816 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2022-02-20 17:02:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:39,817 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-02-20 17:02:39,817 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-02-20 17:02:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-02-20 17:02:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 17:02:39,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:39,817 INFO L514 BasicCegarLoop]: 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-02-20 17:02:39,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 17:02:39,818 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:39,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1746453711, now seen corresponding path program 1 times [2022-02-20 17:02:39,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:39,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278352087] [2022-02-20 17:02:39,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:39,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:39,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {5510#true} assume { :begin_inline_ULTIMATE.init } 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; {5510#true} is VALID [2022-02-20 17:02:39,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {5510#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {5510#true} is VALID [2022-02-20 17:02:39,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {5510#true} assume !!(main_~main__urilen~0#1 <= 1000000); {5510#true} is VALID [2022-02-20 17:02:39,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {5510#true} assume !!(main_~main__urilen~0#1 >= -1000000); {5510#true} is VALID [2022-02-20 17:02:39,869 INFO L290 TraceCheckUtils]: 4: Hoare triple {5510#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {5510#true} is VALID [2022-02-20 17:02:39,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {5510#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {5510#true} is VALID [2022-02-20 17:02:39,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {5510#true} assume !!(main_~main__scheme~0#1 <= 1000000); {5510#true} is VALID [2022-02-20 17:02:39,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {5510#true} assume !!(main_~main__scheme~0#1 >= -1000000); {5510#true} is VALID [2022-02-20 17:02:39,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {5510#true} assume main_~main__urilen~0#1 > 0; {5510#true} is VALID [2022-02-20 17:02:39,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {5510#true} assume main_~main__tokenlen~0#1 > 0; {5510#true} is VALID [2022-02-20 17:02:39,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {5510#true} assume main_~main__scheme~0#1 >= 0; {5510#true} is VALID [2022-02-20 17:02:39,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {5510#true} assume !(0 == main_~main__scheme~0#1); {5510#true} is VALID [2022-02-20 17:02:39,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {5510#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {5510#true} is VALID [2022-02-20 17:02:39,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {5510#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {5510#true} is VALID [2022-02-20 17:02:39,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {5510#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {5510#true} is VALID [2022-02-20 17:02:39,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {5510#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {5510#true} is VALID [2022-02-20 17:02:39,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {5510#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {5510#true} is VALID [2022-02-20 17:02:39,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {5510#true} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {5510#true} is VALID [2022-02-20 17:02:39,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {5510#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {5510#true} is VALID [2022-02-20 17:02:39,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {5510#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {5510#true} is VALID [2022-02-20 17:02:39,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {5510#true} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {5510#true} is VALID [2022-02-20 17:02:39,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {5510#true} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {5510#true} is VALID [2022-02-20 17:02:39,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {5510#true} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {5510#true} is VALID [2022-02-20 17:02:39,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {5510#true} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {5510#true} is VALID [2022-02-20 17:02:39,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {5510#true} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {5510#true} is VALID [2022-02-20 17:02:39,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {5510#true} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {5510#true} is VALID [2022-02-20 17:02:39,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {5510#true} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {5510#true} is VALID [2022-02-20 17:02:39,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {5510#true} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {5512#(or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1)))} is VALID [2022-02-20 17:02:39,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {5512#(or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1)))} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {5513#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:39,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {5513#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {5513#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:39,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {5513#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {5513#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:39,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {5513#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {5514#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))} is VALID [2022-02-20 17:02:39,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {5514#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~10#1; {5511#false} is VALID [2022-02-20 17:02:39,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {5511#false} assume !false; {5511#false} is VALID [2022-02-20 17:02:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:39,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:39,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278352087] [2022-02-20 17:02:39,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278352087] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:39,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:39,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:39,875 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861276393] [2022-02-20 17:02:39,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:39,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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) Word has length 34 [2022-02-20 17:02:39,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:39,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-02-20 17:02:39,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:39,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:39,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:39,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:39,898 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-02-20 17:02:40,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,114 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 17:02:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:02:40,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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) Word has length 34 [2022-02-20 17:02:40,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-02-20 17:02:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-02-20 17:02:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-02-20 17:02:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2022-02-20 17:02:40,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 91 transitions. [2022-02-20 17:02:40,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:40,171 INFO L225 Difference]: With dead ends: 87 [2022-02-20 17:02:40,171 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 17:02:40,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:40,172 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 93 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:40,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 117 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:40,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 17:02:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 57. [2022-02-20 17:02:40,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:40,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 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-02-20 17:02:40,192 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 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-02-20 17:02:40,192 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 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-02-20 17:02:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,193 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-20 17:02:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-02-20 17:02:40,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:40,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:40,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 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 85 states. [2022-02-20 17:02:40,194 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 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 85 states. [2022-02-20 17:02:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,194 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-02-20 17:02:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2022-02-20 17:02:40,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:40,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:40,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:40,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 56 states have internal predecessors, (59), 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-02-20 17:02:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-02-20 17:02:40,196 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 34 [2022-02-20 17:02:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:40,196 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-02-20 17:02:40,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-02-20 17:02:40,196 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-02-20 17:02:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 17:02:40,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:40,197 INFO L514 BasicCegarLoop]: 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-02-20 17:02:40,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 17:02:40,197 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:40,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1694514003, now seen corresponding path program 1 times [2022-02-20 17:02:40,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:40,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476925585] [2022-02-20 17:02:40,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:40,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:40,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {5848#true} assume { :begin_inline_ULTIMATE.init } 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; {5848#true} is VALID [2022-02-20 17:02:40,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {5848#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {5848#true} is VALID [2022-02-20 17:02:40,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {5848#true} assume !!(main_~main__urilen~0#1 <= 1000000); {5848#true} is VALID [2022-02-20 17:02:40,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {5848#true} assume !!(main_~main__urilen~0#1 >= -1000000); {5848#true} is VALID [2022-02-20 17:02:40,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {5848#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {5848#true} is VALID [2022-02-20 17:02:40,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {5848#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {5848#true} is VALID [2022-02-20 17:02:40,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {5848#true} assume !!(main_~main__scheme~0#1 <= 1000000); {5848#true} is VALID [2022-02-20 17:02:40,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {5848#true} assume !!(main_~main__scheme~0#1 >= -1000000); {5848#true} is VALID [2022-02-20 17:02:40,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {5848#true} assume main_~main__urilen~0#1 > 0; {5848#true} is VALID [2022-02-20 17:02:40,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {5848#true} assume main_~main__tokenlen~0#1 > 0; {5848#true} is VALID [2022-02-20 17:02:40,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {5848#true} assume main_~main__scheme~0#1 >= 0; {5848#true} is VALID [2022-02-20 17:02:40,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {5848#true} assume !(0 == main_~main__scheme~0#1); {5848#true} is VALID [2022-02-20 17:02:40,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {5848#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {5848#true} is VALID [2022-02-20 17:02:40,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {5848#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {5848#true} is VALID [2022-02-20 17:02:40,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {5848#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {5848#true} is VALID [2022-02-20 17:02:40,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {5848#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {5848#true} is VALID [2022-02-20 17:02:40,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {5848#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {5848#true} is VALID [2022-02-20 17:02:40,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {5848#true} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {5848#true} is VALID [2022-02-20 17:02:40,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {5848#true} is VALID [2022-02-20 17:02:40,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {5848#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {5848#true} is VALID [2022-02-20 17:02:40,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {5848#true} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {5848#true} is VALID [2022-02-20 17:02:40,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {5848#true} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {5848#true} is VALID [2022-02-20 17:02:40,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {5848#true} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {5848#true} is VALID [2022-02-20 17:02:40,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {5848#true} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {5848#true} is VALID [2022-02-20 17:02:40,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {5848#true} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {5848#true} is VALID [2022-02-20 17:02:40,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {5848#true} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {5848#true} is VALID [2022-02-20 17:02:40,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {5848#true} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {5848#true} is VALID [2022-02-20 17:02:40,249 INFO L290 TraceCheckUtils]: 27: Hoare triple {5848#true} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {5848#true} is VALID [2022-02-20 17:02:40,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {5848#true} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {5850#(or (and (not (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0)) (and (<= 0 |ULTIMATE.start_main_~main__cp~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)))} is VALID [2022-02-20 17:02:40,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {5850#(or (and (not (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0)) (and (<= 0 |ULTIMATE.start_main_~main__cp~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)))} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {5851#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:40,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {5851#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {5851#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:40,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {5851#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {5851#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:40,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {5851#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {5852#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))} is VALID [2022-02-20 17:02:40,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {5852#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~11#1; {5849#false} is VALID [2022-02-20 17:02:40,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {5849#false} assume !false; {5849#false} is VALID [2022-02-20 17:02:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:40,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:40,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476925585] [2022-02-20 17:02:40,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476925585] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:40,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:40,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:40,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926307364] [2022-02-20 17:02:40,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:40,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) Word has length 35 [2022-02-20 17:02:40,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:40,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-02-20 17:02:40,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:40,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:40,288 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:40,289 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-02-20 17:02:40,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,432 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-02-20 17:02:40,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:40,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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) Word has length 35 [2022-02-20 17:02:40,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-02-20 17:02:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 17:02:40,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-02-20 17:02:40,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-02-20 17:02:40,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-02-20 17:02:40,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:40,470 INFO L225 Difference]: With dead ends: 57 [2022-02-20 17:02:40,470 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 17:02:40,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:40,471 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 58 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:40,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 17:02:40,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-02-20 17:02:40,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:40,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 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-02-20 17:02:40,493 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 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-02-20 17:02:40,493 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 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-02-20 17:02:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,494 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-02-20 17:02:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-02-20 17:02:40,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:40,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:40,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 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 55 states. [2022-02-20 17:02:40,495 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 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 55 states. [2022-02-20 17:02:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,495 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-02-20 17:02:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-02-20 17:02:40,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:40,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:40,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:40,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 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-02-20 17:02:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-02-20 17:02:40,497 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 35 [2022-02-20 17:02:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:40,497 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-02-20 17:02:40,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-02-20 17:02:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-02-20 17:02:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:02:40,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:40,498 INFO L514 BasicCegarLoop]: 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] [2022-02-20 17:02:40,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 17:02:40,498 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash 635482230, now seen corresponding path program 1 times [2022-02-20 17:02:40,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:40,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767561613] [2022-02-20 17:02:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:40,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {6091#true} assume { :begin_inline_ULTIMATE.init } 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; {6091#true} is VALID [2022-02-20 17:02:40,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {6091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6091#true} is VALID [2022-02-20 17:02:40,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {6091#true} assume !!(main_~main__urilen~0#1 <= 1000000); {6091#true} is VALID [2022-02-20 17:02:40,529 INFO L290 TraceCheckUtils]: 3: Hoare triple {6091#true} assume !!(main_~main__urilen~0#1 >= -1000000); {6091#true} is VALID [2022-02-20 17:02:40,530 INFO L290 TraceCheckUtils]: 4: Hoare triple {6091#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {6091#true} is VALID [2022-02-20 17:02:40,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {6091#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {6091#true} is VALID [2022-02-20 17:02:40,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {6091#true} assume !!(main_~main__scheme~0#1 <= 1000000); {6091#true} is VALID [2022-02-20 17:02:40,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {6091#true} assume !!(main_~main__scheme~0#1 >= -1000000); {6091#true} is VALID [2022-02-20 17:02:40,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {6091#true} assume main_~main__urilen~0#1 > 0; {6091#true} is VALID [2022-02-20 17:02:40,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {6091#true} assume main_~main__tokenlen~0#1 > 0; {6091#true} is VALID [2022-02-20 17:02:40,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {6091#true} assume main_~main__scheme~0#1 >= 0; {6091#true} is VALID [2022-02-20 17:02:40,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {6091#true} assume !(0 == main_~main__scheme~0#1); {6091#true} is VALID [2022-02-20 17:02:40,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {6091#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {6091#true} is VALID [2022-02-20 17:02:40,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {6091#true} is VALID [2022-02-20 17:02:40,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {6091#true} is VALID [2022-02-20 17:02:40,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {6091#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {6091#true} is VALID [2022-02-20 17:02:40,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {6091#true} is VALID [2022-02-20 17:02:40,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {6091#true} is VALID [2022-02-20 17:02:40,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {6091#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {6091#true} is VALID [2022-02-20 17:02:40,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {6091#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {6091#true} is VALID [2022-02-20 17:02:40,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {6091#true} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {6091#true} is VALID [2022-02-20 17:02:40,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {6091#true} is VALID [2022-02-20 17:02:40,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {6091#true} is VALID [2022-02-20 17:02:40,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {6091#true} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {6091#true} is VALID [2022-02-20 17:02:40,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {6091#true} is VALID [2022-02-20 17:02:40,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {6091#true} is VALID [2022-02-20 17:02:40,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {6091#true} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {6091#true} is VALID [2022-02-20 17:02:40,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {6091#true} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {6091#true} is VALID [2022-02-20 17:02:40,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {6091#true} is VALID [2022-02-20 17:02:40,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {6091#true} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {6091#true} is VALID [2022-02-20 17:02:40,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {6091#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {6091#true} is VALID [2022-02-20 17:02:40,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {6091#true} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {6093#(<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|)} is VALID [2022-02-20 17:02:40,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {6093#(<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {6093#(<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|)} is VALID [2022-02-20 17:02:40,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {6093#(<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~main____CPAchecker_TMP_3~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~main____CPAchecker_TMP_3~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {6093#(<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|)} is VALID [2022-02-20 17:02:40,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {6093#(<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_3~0#1);main_~main__c~0#1 := 1 + main_~main__c~0#1;havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if main_~main__c~0#1 < main_~main__tokenlen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~12#1;main_~__VERIFIER_assert__cond~12#1 := main_~__tmp_13~0#1; {6094#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0))} is VALID [2022-02-20 17:02:40,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {6094#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~12#1; {6092#false} is VALID [2022-02-20 17:02:40,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {6092#false} assume !false; {6092#false} is VALID [2022-02-20 17:02:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:40,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:40,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767561613] [2022-02-20 17:02:40,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767561613] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:40,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:40,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:02:40,536 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267918602] [2022-02-20 17:02:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:40,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) Word has length 37 [2022-02-20 17:02:40,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:40,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-20 17:02:40,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:40,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:02:40,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:40,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:02:40,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:02:40,557 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-20 17:02:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,664 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-02-20 17:02:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:40,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) Word has length 37 [2022-02-20 17:02:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-20 17:02:40,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-02-20 17:02:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-20 17:02:40,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-02-20 17:02:40,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-02-20 17:02:40,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:40,705 INFO L225 Difference]: With dead ends: 66 [2022-02-20 17:02:40,705 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 17:02:40,705 INFO L932 BasicCegarLoop]: 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-02-20 17:02:40,705 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 23 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:40,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 142 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 17:02:40,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2022-02-20 17:02:40,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:40,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 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-02-20 17:02:40,726 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 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-02-20 17:02:40,726 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 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-02-20 17:02:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,727 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-02-20 17:02:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-02-20 17:02:40,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:40,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:40,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 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 64 states. [2022-02-20 17:02:40,727 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 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 64 states. [2022-02-20 17:02:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,728 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2022-02-20 17:02:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2022-02-20 17:02:40,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:40,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:40,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:40,728 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 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-02-20 17:02:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-02-20 17:02:40,729 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 37 [2022-02-20 17:02:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:40,730 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-02-20 17:02:40,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-20 17:02:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-02-20 17:02:40,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:02:40,730 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:40,730 INFO L514 BasicCegarLoop]: 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-02-20 17:02:40,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 17:02:40,731 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:40,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:40,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1774883137, now seen corresponding path program 1 times [2022-02-20 17:02:40,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:40,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767255331] [2022-02-20 17:02:40,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:40,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:40,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {6361#true} assume { :begin_inline_ULTIMATE.init } 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; {6361#true} is VALID [2022-02-20 17:02:40,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {6361#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6361#true} is VALID [2022-02-20 17:02:40,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {6361#true} assume !!(main_~main__urilen~0#1 <= 1000000); {6361#true} is VALID [2022-02-20 17:02:40,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {6361#true} assume !!(main_~main__urilen~0#1 >= -1000000); {6361#true} is VALID [2022-02-20 17:02:40,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {6361#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {6361#true} is VALID [2022-02-20 17:02:40,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {6361#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {6361#true} is VALID [2022-02-20 17:02:40,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {6361#true} assume !!(main_~main__scheme~0#1 <= 1000000); {6361#true} is VALID [2022-02-20 17:02:40,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {6361#true} assume !!(main_~main__scheme~0#1 >= -1000000); {6361#true} is VALID [2022-02-20 17:02:40,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {6361#true} assume main_~main__urilen~0#1 > 0; {6361#true} is VALID [2022-02-20 17:02:40,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {6361#true} assume main_~main__tokenlen~0#1 > 0; {6361#true} is VALID [2022-02-20 17:02:40,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {6361#true} assume main_~main__scheme~0#1 >= 0; {6361#true} is VALID [2022-02-20 17:02:40,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {6361#true} assume !(0 == main_~main__scheme~0#1); {6361#true} is VALID [2022-02-20 17:02:40,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {6361#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {6361#true} is VALID [2022-02-20 17:02:40,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {6361#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {6361#true} is VALID [2022-02-20 17:02:40,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {6361#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {6361#true} is VALID [2022-02-20 17:02:40,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {6361#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {6361#true} is VALID [2022-02-20 17:02:40,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {6361#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {6361#true} is VALID [2022-02-20 17:02:40,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {6361#true} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {6361#true} is VALID [2022-02-20 17:02:40,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {6361#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {6361#true} is VALID [2022-02-20 17:02:40,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {6361#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {6361#true} is VALID [2022-02-20 17:02:40,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {6361#true} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {6361#true} is VALID [2022-02-20 17:02:40,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {6361#true} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {6361#true} is VALID [2022-02-20 17:02:40,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {6361#true} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {6361#true} is VALID [2022-02-20 17:02:40,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {6361#true} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {6361#true} is VALID [2022-02-20 17:02:40,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {6361#true} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {6361#true} is VALID [2022-02-20 17:02:40,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {6361#true} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {6361#true} is VALID [2022-02-20 17:02:40,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {6361#true} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {6361#true} is VALID [2022-02-20 17:02:40,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {6361#true} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} is VALID [2022-02-20 17:02:40,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} is VALID [2022-02-20 17:02:40,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} is VALID [2022-02-20 17:02:40,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} is VALID [2022-02-20 17:02:40,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} is VALID [2022-02-20 17:02:40,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} is VALID [2022-02-20 17:02:40,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~main____CPAchecker_TMP_3~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~main____CPAchecker_TMP_3~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} is VALID [2022-02-20 17:02:40,776 INFO L290 TraceCheckUtils]: 34: Hoare triple {6363#(= |ULTIMATE.start_main_~main__c~0#1| 0)} assume !(0 == main_~main____CPAchecker_TMP_3~0#1);main_~main__c~0#1 := 1 + main_~main__c~0#1;havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if main_~main__c~0#1 < main_~main__tokenlen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~12#1;main_~__VERIFIER_assert__cond~12#1 := main_~__tmp_13~0#1; {6364#(<= 1 |ULTIMATE.start_main_~main__c~0#1|)} is VALID [2022-02-20 17:02:40,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {6364#(<= 1 |ULTIMATE.start_main_~main__c~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~12#1);havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 <= main_~main__c~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~13#1;main_~__VERIFIER_assert__cond~13#1 := main_~__tmp_14~0#1; {6365#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0))} is VALID [2022-02-20 17:02:40,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {6365#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~13#1; {6362#false} is VALID [2022-02-20 17:02:40,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {6362#false} assume !false; {6362#false} is VALID [2022-02-20 17:02:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:40,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:40,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767255331] [2022-02-20 17:02:40,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767255331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:40,777 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:40,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:40,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475981460] [2022-02-20 17:02:40,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:40,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) Word has length 38 [2022-02-20 17:02:40,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:40,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-02-20 17:02:40,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:40,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:40,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:40,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:40,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:40,802 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-02-20 17:02:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,925 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2022-02-20 17:02:40,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:40,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) Word has length 38 [2022-02-20 17:02:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-02-20 17:02:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:02:40,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-02-20 17:02:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-02-20 17:02:40,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2022-02-20 17:02:40,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:40,962 INFO L225 Difference]: With dead ends: 62 [2022-02-20 17:02:40,962 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 17:02:40,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:40,963 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 35 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:40,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 172 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:40,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 17:02:40,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2022-02-20 17:02:40,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:40,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 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-02-20 17:02:40,986 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 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-02-20 17:02:40,986 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 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-02-20 17:02:40,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,986 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-02-20 17:02:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-02-20 17:02:40,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:40,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:40,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 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 60 states. [2022-02-20 17:02:40,987 INFO L87 Difference]: Start difference. First operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 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 60 states. [2022-02-20 17:02:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:40,987 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-02-20 17:02:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-02-20 17:02:40,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:40,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:40,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:40,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:40,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 50 states have internal predecessors, (53), 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-02-20 17:02:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-02-20 17:02:40,989 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 38 [2022-02-20 17:02:40,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:40,989 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-02-20 17:02:40,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-02-20 17:02:40,989 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-02-20 17:02:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 17:02:40,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:40,990 INFO L514 BasicCegarLoop]: 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-02-20 17:02:40,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 17:02:40,990 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:40,990 INFO L85 PathProgramCache]: Analyzing trace with hash 813201821, now seen corresponding path program 1 times [2022-02-20 17:02:40,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:40,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270246560] [2022-02-20 17:02:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:41,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {6615#true} assume { :begin_inline_ULTIMATE.init } 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; {6615#true} is VALID [2022-02-20 17:02:41,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {6615#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6615#true} is VALID [2022-02-20 17:02:41,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {6615#true} assume !!(main_~main__urilen~0#1 <= 1000000); {6615#true} is VALID [2022-02-20 17:02:41,038 INFO L290 TraceCheckUtils]: 3: Hoare triple {6615#true} assume !!(main_~main__urilen~0#1 >= -1000000); {6615#true} is VALID [2022-02-20 17:02:41,038 INFO L290 TraceCheckUtils]: 4: Hoare triple {6615#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {6615#true} is VALID [2022-02-20 17:02:41,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {6615#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {6615#true} is VALID [2022-02-20 17:02:41,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {6615#true} assume !!(main_~main__scheme~0#1 <= 1000000); {6615#true} is VALID [2022-02-20 17:02:41,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {6615#true} assume !!(main_~main__scheme~0#1 >= -1000000); {6615#true} is VALID [2022-02-20 17:02:41,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {6615#true} assume main_~main__urilen~0#1 > 0; {6615#true} is VALID [2022-02-20 17:02:41,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {6615#true} assume main_~main__tokenlen~0#1 > 0; {6615#true} is VALID [2022-02-20 17:02:41,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {6615#true} assume main_~main__scheme~0#1 >= 0; {6615#true} is VALID [2022-02-20 17:02:41,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {6615#true} assume !(0 == main_~main__scheme~0#1); {6615#true} is VALID [2022-02-20 17:02:41,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {6615#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {6615#true} is VALID [2022-02-20 17:02:41,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {6615#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {6615#true} is VALID [2022-02-20 17:02:41,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {6615#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {6615#true} is VALID [2022-02-20 17:02:41,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {6615#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {6615#true} is VALID [2022-02-20 17:02:41,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {6615#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {6615#true} is VALID [2022-02-20 17:02:41,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {6615#true} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {6615#true} is VALID [2022-02-20 17:02:41,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {6615#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {6615#true} is VALID [2022-02-20 17:02:41,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {6615#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {6615#true} is VALID [2022-02-20 17:02:41,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {6615#true} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {6615#true} is VALID [2022-02-20 17:02:41,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {6615#true} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {6615#true} is VALID [2022-02-20 17:02:41,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {6615#true} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {6615#true} is VALID [2022-02-20 17:02:41,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {6615#true} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {6615#true} is VALID [2022-02-20 17:02:41,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {6615#true} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {6615#true} is VALID [2022-02-20 17:02:41,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {6615#true} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {6615#true} is VALID [2022-02-20 17:02:41,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {6615#true} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {6615#true} is VALID [2022-02-20 17:02:41,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {6615#true} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {6617#(or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1)))} is VALID [2022-02-20 17:02:41,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {6617#(or (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1)))} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:41,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:41,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:41,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:41,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:41,043 INFO L290 TraceCheckUtils]: 33: Hoare triple {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~main____CPAchecker_TMP_3~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~main____CPAchecker_TMP_3~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:41,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~main____CPAchecker_TMP_3~0#1);main_~main__c~0#1 := 1 + main_~main__c~0#1;havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if main_~main__c~0#1 < main_~main__tokenlen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~12#1;main_~__VERIFIER_assert__cond~12#1 := main_~__tmp_13~0#1; {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:41,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~12#1);havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 <= main_~main__c~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~13#1;main_~__VERIFIER_assert__cond~13#1 := main_~__tmp_14~0#1; {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:41,044 INFO L290 TraceCheckUtils]: 36: Hoare triple {6618#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~13#1);havoc main_~__tmp_15~0#1;main_~__tmp_15~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~14#1;main_~__VERIFIER_assert__cond~14#1 := main_~__tmp_15~0#1; {6619#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~14#1| 0))} is VALID [2022-02-20 17:02:41,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {6619#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~14#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~14#1; {6616#false} is VALID [2022-02-20 17:02:41,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {6616#false} assume !false; {6616#false} is VALID [2022-02-20 17:02:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:41,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:41,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270246560] [2022-02-20 17:02:41,045 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270246560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:41,045 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:41,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:41,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980877759] [2022-02-20 17:02:41,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:41,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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) Word has length 39 [2022-02-20 17:02:41,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:41,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-02-20 17:02:41,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:41,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:41,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:41,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:41,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:41,072 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-02-20 17:02:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:41,289 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-02-20 17:02:41,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:02:41,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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) Word has length 39 [2022-02-20 17:02:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-02-20 17:02:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-02-20 17:02:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-02-20 17:02:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2022-02-20 17:02:41,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 89 transitions. [2022-02-20 17:02:41,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:41,343 INFO L225 Difference]: With dead ends: 84 [2022-02-20 17:02:41,343 INFO L226 Difference]: Without dead ends: 82 [2022-02-20 17:02:41,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:41,344 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 52 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:41,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 125 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:02:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-02-20 17:02:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 56. [2022-02-20 17:02:41,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:41,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 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-02-20 17:02:41,367 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 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-02-20 17:02:41,367 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 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-02-20 17:02:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:41,367 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-02-20 17:02:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-02-20 17:02:41,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:41,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:41,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 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 82 states. [2022-02-20 17:02:41,368 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 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 82 states. [2022-02-20 17:02:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:41,369 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2022-02-20 17:02:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-02-20 17:02:41,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:41,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:41,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:41,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 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-02-20 17:02:41,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-02-20 17:02:41,370 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 39 [2022-02-20 17:02:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:41,370 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-02-20 17:02:41,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 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-02-20 17:02:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-02-20 17:02:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 17:02:41,371 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:41,371 INFO L514 BasicCegarLoop]: 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] [2022-02-20 17:02:41,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 17:02:41,371 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash -560543098, now seen corresponding path program 1 times [2022-02-20 17:02:41,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:41,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808032979] [2022-02-20 17:02:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:41,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {6946#true} assume { :begin_inline_ULTIMATE.init } 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; {6946#true} is VALID [2022-02-20 17:02:41,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {6946#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {6946#true} is VALID [2022-02-20 17:02:41,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {6946#true} assume !!(main_~main__urilen~0#1 <= 1000000); {6946#true} is VALID [2022-02-20 17:02:41,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {6946#true} assume !!(main_~main__urilen~0#1 >= -1000000); {6946#true} is VALID [2022-02-20 17:02:41,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {6946#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {6946#true} is VALID [2022-02-20 17:02:41,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {6946#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {6946#true} is VALID [2022-02-20 17:02:41,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {6946#true} assume !!(main_~main__scheme~0#1 <= 1000000); {6946#true} is VALID [2022-02-20 17:02:41,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {6946#true} assume !!(main_~main__scheme~0#1 >= -1000000); {6946#true} is VALID [2022-02-20 17:02:41,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {6946#true} assume main_~main__urilen~0#1 > 0; {6946#true} is VALID [2022-02-20 17:02:41,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {6946#true} assume main_~main__tokenlen~0#1 > 0; {6946#true} is VALID [2022-02-20 17:02:41,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {6946#true} assume main_~main__scheme~0#1 >= 0; {6946#true} is VALID [2022-02-20 17:02:41,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {6946#true} assume !(0 == main_~main__scheme~0#1); {6946#true} is VALID [2022-02-20 17:02:41,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {6946#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {6946#true} is VALID [2022-02-20 17:02:41,424 INFO L290 TraceCheckUtils]: 13: Hoare triple {6946#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {6946#true} is VALID [2022-02-20 17:02:41,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {6946#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {6946#true} is VALID [2022-02-20 17:02:41,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {6946#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {6946#true} is VALID [2022-02-20 17:02:41,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {6946#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {6946#true} is VALID [2022-02-20 17:02:41,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {6946#true} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {6946#true} is VALID [2022-02-20 17:02:41,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {6946#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {6946#true} is VALID [2022-02-20 17:02:41,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {6946#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {6946#true} is VALID [2022-02-20 17:02:41,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {6946#true} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {6946#true} is VALID [2022-02-20 17:02:41,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {6946#true} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {6946#true} is VALID [2022-02-20 17:02:41,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {6946#true} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {6946#true} is VALID [2022-02-20 17:02:41,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {6946#true} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {6946#true} is VALID [2022-02-20 17:02:41,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {6946#true} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {6946#true} is VALID [2022-02-20 17:02:41,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {6946#true} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {6946#true} is VALID [2022-02-20 17:02:41,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {6946#true} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {6946#true} is VALID [2022-02-20 17:02:41,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {6946#true} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {6946#true} is VALID [2022-02-20 17:02:41,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {6946#true} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {6948#(or (and (not (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0)) (and (<= 0 |ULTIMATE.start_main_~main__cp~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)))} is VALID [2022-02-20 17:02:41,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {6948#(or (and (not (<= 0 |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 0)) (and (<= 0 |ULTIMATE.start_main_~main__cp~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)))} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:41,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:41,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:41,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:41,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~main____CPAchecker_TMP_3~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~main____CPAchecker_TMP_3~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:41,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_3~0#1);main_~main__c~0#1 := 1 + main_~main__c~0#1;havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if main_~main__c~0#1 < main_~main__tokenlen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~12#1;main_~__VERIFIER_assert__cond~12#1 := main_~__tmp_13~0#1; {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:41,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~12#1);havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 <= main_~main__c~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~13#1;main_~__VERIFIER_assert__cond~13#1 := main_~__tmp_14~0#1; {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:41,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~13#1);havoc main_~__tmp_15~0#1;main_~__tmp_15~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~14#1;main_~__VERIFIER_assert__cond~14#1 := main_~__tmp_15~0#1; {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} is VALID [2022-02-20 17:02:41,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {6949#(<= 0 |ULTIMATE.start_main_~main__cp~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~14#1);havoc main_~__tmp_16~0#1;main_~__tmp_16~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~15#1;main_~__VERIFIER_assert__cond~15#1 := main_~__tmp_16~0#1; {6950#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~15#1| 0))} is VALID [2022-02-20 17:02:41,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {6950#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~15#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~15#1; {6947#false} is VALID [2022-02-20 17:02:41,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {6947#false} assume !false; {6947#false} is VALID [2022-02-20 17:02:41,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:41,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:41,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808032979] [2022-02-20 17:02:41,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808032979] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:41,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:41,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:41,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514366561] [2022-02-20 17:02:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:41,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) Word has length 40 [2022-02-20 17:02:41,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:41,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-02-20 17:02:41,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:41,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:41,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:41,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:41,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:41,465 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-02-20 17:02:41,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:41,613 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-02-20 17:02:41,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:02:41,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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) Word has length 40 [2022-02-20 17:02:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-02-20 17:02:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-02-20 17:02:41,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-02-20 17:02:41,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-02-20 17:02:41,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-02-20 17:02:41,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:41,651 INFO L225 Difference]: With dead ends: 69 [2022-02-20 17:02:41,651 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 17:02:41,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:02:41,652 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:41,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 119 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:41,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 17:02:41,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2022-02-20 17:02:41,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:41,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 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-02-20 17:02:41,673 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 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-02-20 17:02:41,674 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 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-02-20 17:02:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:41,674 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-02-20 17:02:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-20 17:02:41,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:41,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:41,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 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 67 states. [2022-02-20 17:02:41,675 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 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 67 states. [2022-02-20 17:02:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:41,675 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-02-20 17:02:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-20 17:02:41,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:41,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:41,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:41,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 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-02-20 17:02:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-02-20 17:02:41,677 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2022-02-20 17:02:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:41,677 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-02-20 17:02:41,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-02-20 17:02:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-02-20 17:02:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 17:02:41,677 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:41,678 INFO L514 BasicCegarLoop]: 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] [2022-02-20 17:02:41,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 17:02:41,678 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:41,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:41,678 INFO L85 PathProgramCache]: Analyzing trace with hash 375780089, now seen corresponding path program 1 times [2022-02-20 17:02:41,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:41,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398865831] [2022-02-20 17:02:41,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:41,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:41,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {7226#true} assume { :begin_inline_ULTIMATE.init } 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; {7226#true} is VALID [2022-02-20 17:02:41,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {7226#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {7226#true} is VALID [2022-02-20 17:02:41,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {7226#true} assume !!(main_~main__urilen~0#1 <= 1000000); {7226#true} is VALID [2022-02-20 17:02:41,757 INFO L290 TraceCheckUtils]: 3: Hoare triple {7226#true} assume !!(main_~main__urilen~0#1 >= -1000000); {7226#true} is VALID [2022-02-20 17:02:41,757 INFO L290 TraceCheckUtils]: 4: Hoare triple {7226#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {7226#true} is VALID [2022-02-20 17:02:41,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {7226#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {7226#true} is VALID [2022-02-20 17:02:41,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {7226#true} assume !!(main_~main__scheme~0#1 <= 1000000); {7226#true} is VALID [2022-02-20 17:02:41,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {7226#true} assume !!(main_~main__scheme~0#1 >= -1000000); {7226#true} is VALID [2022-02-20 17:02:41,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {7226#true} assume main_~main__urilen~0#1 > 0; {7226#true} is VALID [2022-02-20 17:02:41,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {7226#true} assume main_~main__tokenlen~0#1 > 0; {7226#true} is VALID [2022-02-20 17:02:41,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {7226#true} assume main_~main__scheme~0#1 >= 0; {7226#true} is VALID [2022-02-20 17:02:41,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {7226#true} assume !(0 == main_~main__scheme~0#1); {7226#true} is VALID [2022-02-20 17:02:41,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {7226#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~main____CPAchecker_TMP_3~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~main____CPAchecker_TMP_3~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_3~0#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,766 INFO L290 TraceCheckUtils]: 35: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:41,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {7230#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))} is VALID [2022-02-20 17:02:41,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {7230#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~10#1; {7227#false} is VALID [2022-02-20 17:02:41,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {7227#false} assume !false; {7227#false} is VALID [2022-02-20 17:02:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:41,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:41,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398865831] [2022-02-20 17:02:41,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398865831] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:02:41,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060348231] [2022-02-20 17:02:41,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:41,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:41,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:02:41,770 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-02-20 17:02:41,823 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-02-20 17:02:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:41,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:02:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:41,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:02:42,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {7226#true} assume { :begin_inline_ULTIMATE.init } 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; {7226#true} is VALID [2022-02-20 17:02:42,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {7226#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {7226#true} is VALID [2022-02-20 17:02:42,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {7226#true} assume !!(main_~main__urilen~0#1 <= 1000000); {7226#true} is VALID [2022-02-20 17:02:42,124 INFO L290 TraceCheckUtils]: 3: Hoare triple {7226#true} assume !!(main_~main__urilen~0#1 >= -1000000); {7226#true} is VALID [2022-02-20 17:02:42,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {7226#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {7226#true} is VALID [2022-02-20 17:02:42,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {7226#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {7226#true} is VALID [2022-02-20 17:02:42,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {7226#true} assume !!(main_~main__scheme~0#1 <= 1000000); {7226#true} is VALID [2022-02-20 17:02:42,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {7226#true} assume !!(main_~main__scheme~0#1 >= -1000000); {7226#true} is VALID [2022-02-20 17:02:42,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {7226#true} assume main_~main__urilen~0#1 > 0; {7226#true} is VALID [2022-02-20 17:02:42,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {7226#true} assume main_~main__tokenlen~0#1 > 0; {7226#true} is VALID [2022-02-20 17:02:42,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {7226#true} assume main_~main__scheme~0#1 >= 0; {7226#true} is VALID [2022-02-20 17:02:42,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {7226#true} assume !(0 == main_~main__scheme~0#1); {7226#true} is VALID [2022-02-20 17:02:42,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {7226#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,131 INFO L290 TraceCheckUtils]: 27: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~main____CPAchecker_TMP_3~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~main____CPAchecker_TMP_3~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_3~0#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,134 INFO L290 TraceCheckUtils]: 35: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {7345#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)} is VALID [2022-02-20 17:02:42,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {7345#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)} assume 0 == main_~__VERIFIER_assert__cond~10#1; {7227#false} is VALID [2022-02-20 17:02:42,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {7227#false} assume !false; {7227#false} is VALID [2022-02-20 17:02:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:42,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:02:42,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {7227#false} assume !false; {7227#false} is VALID [2022-02-20 17:02:42,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {7345#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)} assume 0 == main_~__VERIFIER_assert__cond~10#1; {7227#false} is VALID [2022-02-20 17:02:42,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {7345#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)} is VALID [2022-02-20 17:02:42,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !!(0 == main_~main____CPAchecker_TMP_3~0#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~main____CPAchecker_TMP_3~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~main____CPAchecker_TMP_3~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,342 INFO L290 TraceCheckUtils]: 30: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {7229#(< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {7226#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {7228#(< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {7226#true} assume !(0 == main_~main__scheme~0#1); {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {7226#true} assume main_~main__scheme~0#1 >= 0; {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {7226#true} assume main_~main__tokenlen~0#1 > 0; {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {7226#true} assume main_~main__urilen~0#1 > 0; {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {7226#true} assume !!(main_~main__scheme~0#1 >= -1000000); {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {7226#true} assume !!(main_~main__scheme~0#1 <= 1000000); {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {7226#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {7226#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {7226#true} assume !!(main_~main__urilen~0#1 >= -1000000); {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {7226#true} assume !!(main_~main__urilen~0#1 <= 1000000); {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {7226#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {7226#true} is VALID [2022-02-20 17:02:42,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {7226#true} assume { :begin_inline_ULTIMATE.init } 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; {7226#true} is VALID [2022-02-20 17:02:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:02:42,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060348231] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:02:42,349 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:02:42,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-02-20 17:02:42,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536310813] [2022-02-20 17:02:42,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:02:42,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) Word has length 40 [2022-02-20 17:02:42,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:42,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-02-20 17:02:42,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:42,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:02:42,374 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:42,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:02:42,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:02:42,374 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-02-20 17:02:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:42,494 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-02-20 17:02:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:02:42,494 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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) Word has length 40 [2022-02-20 17:02:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-02-20 17:02:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-02-20 17:02:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-02-20 17:02:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2022-02-20 17:02:42,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2022-02-20 17:02:42,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:42,527 INFO L225 Difference]: With dead ends: 54 [2022-02-20 17:02:42,527 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:02:42,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 7 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:02:42,527 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:42,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 62 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:42,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:02:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-20 17:02:42,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:42,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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-02-20 17:02:42,550 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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-02-20 17:02:42,550 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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-02-20 17:02:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:42,550 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-02-20 17:02:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-02-20 17:02:42,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:42,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:42,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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 52 states. [2022-02-20 17:02:42,551 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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 52 states. [2022-02-20 17:02:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:42,551 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-02-20 17:02:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-02-20 17:02:42,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:42,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:42,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:42,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 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-02-20 17:02:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-02-20 17:02:42,553 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 40 [2022-02-20 17:02:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:42,553 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-02-20 17:02:42,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-02-20 17:02:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-02-20 17:02:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 17:02:42,553 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:02:42,554 INFO L514 BasicCegarLoop]: 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] [2022-02-20 17:02:42,577 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-02-20 17:02:42,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:02:42,754 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 15 more)] === [2022-02-20 17:02:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:02:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1394778411, now seen corresponding path program 1 times [2022-02-20 17:02:42,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:02:42,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555648355] [2022-02-20 17:02:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:02:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:02:42,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:02:42,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {7692#true} assume { :begin_inline_ULTIMATE.init } 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; {7692#true} is VALID [2022-02-20 17:02:42,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {7692#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1, main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1, main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1, main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1, main_~main____CPAchecker_TMP_3~0#1, main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1, main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1, main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1, main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1, main_~main____CPAchecker_TMP_2~0#1, main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1, main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1, main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1, main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1, main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1, main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1, main_~main____CPAchecker_TMP_1~0#1, main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1, main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__scheme~0#1, main_~main__urilen~0#1, main_~main__tokenlen~0#1, main_~main__cp~0#1, main_~main__c~0#1;havoc main_~main__scheme~0#1;havoc main_~main__urilen~0#1;havoc main_~main__tokenlen~0#1;havoc main_~main__cp~0#1;havoc main_~main__c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__urilen~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main__tokenlen~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~main__scheme~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; {7692#true} is VALID [2022-02-20 17:02:42,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {7692#true} assume !!(main_~main__urilen~0#1 <= 1000000); {7692#true} is VALID [2022-02-20 17:02:42,802 INFO L290 TraceCheckUtils]: 3: Hoare triple {7692#true} assume !!(main_~main__urilen~0#1 >= -1000000); {7692#true} is VALID [2022-02-20 17:02:42,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {7692#true} assume !!(main_~main__tokenlen~0#1 <= 1000000); {7692#true} is VALID [2022-02-20 17:02:42,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {7692#true} assume !!(main_~main__tokenlen~0#1 >= -1000000); {7692#true} is VALID [2022-02-20 17:02:42,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {7692#true} assume !!(main_~main__scheme~0#1 <= 1000000); {7692#true} is VALID [2022-02-20 17:02:42,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {7692#true} assume !!(main_~main__scheme~0#1 >= -1000000); {7692#true} is VALID [2022-02-20 17:02:42,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {7692#true} assume main_~main__urilen~0#1 > 0; {7692#true} is VALID [2022-02-20 17:02:42,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {7692#true} assume main_~main__tokenlen~0#1 > 0; {7692#true} is VALID [2022-02-20 17:02:42,803 INFO L290 TraceCheckUtils]: 10: Hoare triple {7692#true} assume main_~main__scheme~0#1 >= 0; {7692#true} is VALID [2022-02-20 17:02:42,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {7692#true} assume !(0 == main_~main__scheme~0#1); {7692#true} is VALID [2022-02-20 17:02:42,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {7692#true} assume !(main_~main__urilen~0#1 - 1 < main_~main__scheme~0#1);main_~main__cp~0#1 := main_~main__scheme~0#1;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__cp~0#1 - 1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {7692#true} is VALID [2022-02-20 17:02:42,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~0#1);havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 <= main_~main__cp~0#1 - 1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {7692#true} is VALID [2022-02-20 17:02:42,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~1#1);havoc main_~main____CPAchecker_TMP_0~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~main____CPAchecker_TMP_0~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {7692#true} is VALID [2022-02-20 17:02:42,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {7692#true} assume !(0 == main_~main____CPAchecker_TMP_0~0#1);havoc main_~__tmp_3~0#1;main_~__tmp_3~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~2#1;main_~__VERIFIER_assert__cond~2#1 := main_~__tmp_3~0#1; {7692#true} is VALID [2022-02-20 17:02:42,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~2#1);havoc main_~__tmp_4~0#1;main_~__tmp_4~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~3#1;main_~__VERIFIER_assert__cond~3#1 := main_~__tmp_4~0#1; {7692#true} is VALID [2022-02-20 17:02:42,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~3#1); {7692#true} is VALID [2022-02-20 17:02:42,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {7692#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; {7692#true} is VALID [2022-02-20 17:02:42,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {7692#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1); {7692#true} is VALID [2022-02-20 17:02:42,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {7692#true} havoc main_~__tmp_5~0#1;main_~__tmp_5~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~4#1;main_~__VERIFIER_assert__cond~4#1 := main_~__tmp_5~0#1; {7692#true} is VALID [2022-02-20 17:02:42,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~4#1);havoc main_~__tmp_6~0#1;main_~__tmp_6~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~5#1;main_~__VERIFIER_assert__cond~5#1 := main_~__tmp_6~0#1; {7692#true} is VALID [2022-02-20 17:02:42,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~5#1); {7692#true} is VALID [2022-02-20 17:02:42,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {7692#true} assume !(main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);havoc main_~__tmp_7~0#1;main_~__tmp_7~0#1 := (if 1 + main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~6#1;main_~__VERIFIER_assert__cond~6#1 := main_~__tmp_7~0#1; {7692#true} is VALID [2022-02-20 17:02:42,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~6#1);havoc main_~__tmp_8~0#1;main_~__tmp_8~0#1 := (if 0 <= 1 + main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~7#1;main_~__VERIFIER_assert__cond~7#1 := main_~__tmp_8~0#1; {7692#true} is VALID [2022-02-20 17:02:42,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~7#1); {7692#true} is VALID [2022-02-20 17:02:42,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {7692#true} assume !(1 + main_~main__cp~0#1 == main_~main__urilen~0#1 - 1);main_~main__cp~0#1 := 1 + main_~main__cp~0#1;main_~main__scheme~0#1 := main_~main__cp~0#1;havoc main_~main____CPAchecker_TMP_2~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~main____CPAchecker_TMP_2~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {7692#true} is VALID [2022-02-20 17:02:42,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {7692#true} assume !(0 == main_~main____CPAchecker_TMP_2~0#1);main_~main__c~0#1 := 0;havoc main_~__tmp_9~0#1;main_~__tmp_9~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~8#1;main_~__VERIFIER_assert__cond~8#1 := main_~__tmp_9~0#1; {7692#true} is VALID [2022-02-20 17:02:42,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~8#1);havoc main_~__tmp_10~0#1;main_~__tmp_10~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~9#1;main_~__VERIFIER_assert__cond~9#1 := main_~__tmp_10~0#1; {7692#true} is VALID [2022-02-20 17:02:42,805 INFO L290 TraceCheckUtils]: 29: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~9#1); {7692#true} is VALID [2022-02-20 17:02:42,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {7692#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {7692#true} is VALID [2022-02-20 17:02:42,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {7692#true} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {7692#true} is VALID [2022-02-20 17:02:42,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {7692#true} is VALID [2022-02-20 17:02:42,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {7692#true} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~main____CPAchecker_TMP_3~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~main____CPAchecker_TMP_3~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7692#true} is VALID [2022-02-20 17:02:42,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {7692#true} assume !!(0 == main_~main____CPAchecker_TMP_3~0#1); {7692#true} is VALID [2022-02-20 17:02:42,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {7692#true} main_~main__cp~0#1 := 1 + main_~main__cp~0#1; {7692#true} is VALID [2022-02-20 17:02:42,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {7692#true} assume main_~main__cp~0#1 != main_~main__urilen~0#1 - 1; {7692#true} is VALID [2022-02-20 17:02:42,806 INFO L290 TraceCheckUtils]: 37: Hoare triple {7692#true} assume main_~main__c~0#1 < main_~main__tokenlen~0#1 - 1;havoc main_~__tmp_11~0#1;main_~__tmp_11~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~10#1;main_~__VERIFIER_assert__cond~10#1 := main_~__tmp_11~0#1; {7694#(or (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1)) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)))} is VALID [2022-02-20 17:02:42,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {7694#(or (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1)) (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0) (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)))} assume !(0 == main_~__VERIFIER_assert__cond~10#1);havoc main_~__tmp_12~0#1;main_~__tmp_12~0#1 := (if 0 <= main_~main__cp~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~11#1;main_~__VERIFIER_assert__cond~11#1 := main_~__tmp_12~0#1; {7695#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:42,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {7695#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~11#1);havoc main_~main____CPAchecker_TMP_3~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~main____CPAchecker_TMP_3~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7695#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:42,807 INFO L290 TraceCheckUtils]: 40: Hoare triple {7695#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~main____CPAchecker_TMP_3~0#1);main_~main__c~0#1 := 1 + main_~main__c~0#1;havoc main_~__tmp_13~0#1;main_~__tmp_13~0#1 := (if main_~main__c~0#1 < main_~main__tokenlen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~12#1;main_~__VERIFIER_assert__cond~12#1 := main_~__tmp_13~0#1; {7695#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:42,807 INFO L290 TraceCheckUtils]: 41: Hoare triple {7695#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~12#1);havoc main_~__tmp_14~0#1;main_~__tmp_14~0#1 := (if 0 <= main_~main__c~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~13#1;main_~__VERIFIER_assert__cond~13#1 := main_~__tmp_14~0#1; {7695#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} is VALID [2022-02-20 17:02:42,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {7695#(not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|))} assume !(0 == main_~__VERIFIER_assert__cond~13#1);havoc main_~__tmp_15~0#1;main_~__tmp_15~0#1 := (if main_~main__cp~0#1 < main_~main__urilen~0#1 then 1 else 0);havoc main_~__VERIFIER_assert__cond~14#1;main_~__VERIFIER_assert__cond~14#1 := main_~__tmp_15~0#1; {7696#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~14#1| 0))} is VALID [2022-02-20 17:02:42,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {7696#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~14#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~14#1; {7693#false} is VALID [2022-02-20 17:02:42,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {7693#false} assume !false; {7693#false} is VALID [2022-02-20 17:02:42,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:02:42,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:02:42,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555648355] [2022-02-20 17:02:42,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555648355] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:02:42,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:02:42,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:02:42,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614889644] [2022-02-20 17:02:42,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:02:42,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) Word has length 45 [2022-02-20 17:02:42,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:02:42,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-02-20 17:02:42,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:42,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:02:42,834 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:02:42,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:02:42,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:02:42,834 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-02-20 17:02:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:43,022 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-02-20 17:02:43,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:02:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) Word has length 45 [2022-02-20 17:02:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:02:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-02-20 17:02:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-02-20 17:02:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-02-20 17:02:43,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-02-20 17:02:43,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 67 transitions. [2022-02-20 17:02:43,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:02:43,065 INFO L225 Difference]: With dead ends: 71 [2022-02-20 17:02:43,065 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:02:43,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-02-20 17:02:43,066 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:02:43,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 86 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:02:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:02:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:02:43,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:02:43,067 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-02-20 17:02:43,067 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-02-20 17:02:43,067 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-02-20 17:02:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:43,067 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:43,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:43,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:43,067 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-02-20 17:02:43,067 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-02-20 17:02:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:02:43,068 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:02:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:43,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:43,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:02:43,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:02:43,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:02:43,068 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-02-20 17:02:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:02:43,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-02-20 17:02:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:02:43,068 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:02:43,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-02-20 17:02:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:02:43,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:02:43,070 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 18 remaining) [2022-02-20 17:02:43,070 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (16 of 18 remaining) [2022-02-20 17:02:43,070 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (15 of 18 remaining) [2022-02-20 17:02:43,070 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 18 remaining) [2022-02-20 17:02:43,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (13 of 18 remaining) [2022-02-20 17:02:43,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (12 of 18 remaining) [2022-02-20 17:02:43,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (11 of 18 remaining) [2022-02-20 17:02:43,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (10 of 18 remaining) [2022-02-20 17:02:43,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (9 of 18 remaining) [2022-02-20 17:02:43,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (8 of 18 remaining) [2022-02-20 17:02:43,071 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (7 of 18 remaining) [2022-02-20 17:02:43,072 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (6 of 18 remaining) [2022-02-20 17:02:43,072 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (5 of 18 remaining) [2022-02-20 17:02:43,072 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (4 of 18 remaining) [2022-02-20 17:02:43,072 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (3 of 18 remaining) [2022-02-20 17:02:43,072 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (2 of 18 remaining) [2022-02-20 17:02:43,072 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (1 of 18 remaining) [2022-02-20 17:02:43,072 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (0 of 18 remaining) [2022-02-20 17:02:43,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 17:02:43,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:03:05,447 WARN L228 SmtUtils]: Spent 22.37s on a formula simplification. DAG size of input: 120 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-20 17:03:10,564 WARN L228 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 114 DAG size of output: 109 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-02-20 17:03:11,831 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 97) no Hoare annotation was computed. [2022-02-20 17:03:11,831 INFO L858 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-02-20 17:03:11,831 INFO L858 garLoopResultBuilder]: For program point L234(lines 234 338) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 272) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point L135(lines 135 397) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point L284(line 284) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 433) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point L384(lines 384 393) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 255) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L854 garLoopResultBuilder]: At program point L401(lines 131 402) the Hoare annotation is: (and (not (<= |ULTIMATE.start_main_~main__urilen~0#1| |ULTIMATE.start_main_~main__cp~0#1|)) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse2 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse4 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1| 0))) (and .cse0 .cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse2 .cse3 .cse4)))) [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 411) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point L71(lines 71 416) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point L253(lines 253 329) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point L187(lines 187 355) no Hoare annotation was computed. [2022-02-20 17:03:11,832 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 386) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 322) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L204(lines 204 353) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L386(line 386) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 360) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L23(lines 23 438) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L255(line 255) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L189(line 189) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 403) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 214) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L272(line 272) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 435) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L372(lines 372 395) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L306(lines 306 316) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L224(lines 224 344) no Hoare annotation was computed. [2022-02-20 17:03:11,833 INFO L858 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L59(lines 59 432) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 113) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L241(lines 241 331) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L175(lines 175 357) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 284) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 226) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L374(line 374) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L308(line 308) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 362) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L226(line 226) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 427) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L243(line 243) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point L111(lines 111 405) no Hoare annotation was computed. [2022-02-20 17:03:11,834 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 308) no Hoare annotation was computed. [2022-02-20 17:03:11,835 INFO L854 garLoopResultBuilder]: At program point L392(lines 129 403) the Hoare annotation is: (and (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|) (let ((.cse0 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse1 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse3 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse5 (not (<= |ULTIMATE.start_main_~main__scheme~0#1| 0)))) (or (and .cse0 .cse1 .cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~17#1| 0)) .cse3 .cse4 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~16#1|) .cse5) (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 1) .cse3 .cse4 .cse5)))) [2022-02-20 17:03:11,835 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 354) no Hoare annotation was computed. [2022-02-20 17:03:11,835 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 412) no Hoare annotation was computed. [2022-02-20 17:03:11,836 INFO L858 garLoopResultBuilder]: For program point L29(lines 29 437) no Hoare annotation was computed. [2022-02-20 17:03:11,836 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 125) no Hoare annotation was computed. [2022-02-20 17:03:11,836 INFO L858 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-02-20 17:03:11,836 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 296) no Hoare annotation was computed. [2022-02-20 17:03:11,836 INFO L854 garLoopResultBuilder]: At program point L327(lines 262 328) the Hoare annotation is: (and (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 1) (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1) (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) (let ((.cse0 (let ((.cse1 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse3 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse4 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse5 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse6 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse7 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse8 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0))) (.cse9 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse13 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0)))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse12 .cse13) (and .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))))) (or (and .cse0 (= |ULTIMATE.start_main_~main__c~0#1| 0)) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse0)))) [2022-02-20 17:03:11,836 INFO L858 garLoopResultBuilder]: For program point L294(lines 294 318) no Hoare annotation was computed. [2022-02-20 17:03:11,836 INFO L858 garLoopResultBuilder]: For program point L162(lines 162 359) no Hoare annotation was computed. [2022-02-20 17:03:11,836 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 422) no Hoare annotation was computed. [2022-02-20 17:03:11,836 INFO L854 garLoopResultBuilder]: At program point L410(lines 104 411) the Hoare annotation is: (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) [2022-02-20 17:03:11,836 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 346) no Hoare annotation was computed. [2022-02-20 17:03:11,836 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-02-20 17:03:11,837 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 434) no Hoare annotation was computed. [2022-02-20 17:03:11,837 INFO L858 garLoopResultBuilder]: For program point L262(lines 262 328) no Hoare annotation was computed. [2022-02-20 17:03:11,837 INFO L858 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2022-02-20 17:03:11,837 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 157) no Hoare annotation was computed. [2022-02-20 17:03:11,837 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 374) no Hoare annotation was computed. [2022-02-20 17:03:11,837 INFO L858 garLoopResultBuilder]: For program point L296(line 296) no Hoare annotation was computed. [2022-02-20 17:03:11,837 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 417) no Hoare annotation was computed. [2022-02-20 17:03:11,837 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:03:11,837 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2022-02-20 17:03:11,838 INFO L858 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2022-02-20 17:03:11,838 INFO L858 garLoopResultBuilder]: For program point L83(lines 83 414) no Hoare annotation was computed. [2022-02-20 17:03:11,838 INFO L854 garLoopResultBuilder]: At program point L315(lines 230 344) the Hoare annotation is: (let ((.cse2 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~6#1| 0))) (.cse3 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))) (.cse4 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~3#1| 1)) (.cse5 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| 0))) (.cse6 (< 0 |ULTIMATE.start_main_~main__scheme~0#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~4#1|)) (.cse8 (< |ULTIMATE.start_main_~main__cp~0#1| |ULTIMATE.start_main_~main__urilen~0#1|)) (.cse11 (<= 1 |ULTIMATE.start_main_~main__cp~0#1|)) (.cse12 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~2#1| 0))) (.cse13 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~9#1| 1)) (.cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 0))) (.cse15 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~5#1| 0))) (.cse16 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~7#1| 0))) (.cse1 (= |ULTIMATE.start_main_~main__c~0#1| 0))) (or (and (let ((.cse0 (let ((.cse9 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1| 0))) (.cse10 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~11#1| 0)))) (or (and .cse2 .cse3 (<= (+ 2 |ULTIMATE.start_main_~main__c~0#1|) |ULTIMATE.start_main_~main__tokenlen~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~12#1| 0)) .cse15 .cse16))))) (or (and .cse0 .cse1) (and (<= 1 |ULTIMATE.start_main_~main__c~0#1|) (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~13#1| 0)) .cse0))) (<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~10#1|)) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~8#1| 1) .cse11 .cse12 .cse13 .cse14 (< (+ |ULTIMATE.start_main_~main__cp~0#1| 1) |ULTIMATE.start_main_~main__urilen~0#1|) .cse15 .cse16 .cse1))) [2022-02-20 17:03:11,838 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 243) no Hoare annotation was computed. [2022-02-20 17:03:11,838 INFO L858 garLoopResultBuilder]: For program point L282(lines 282 320) no Hoare annotation was computed. [2022-02-20 17:03:11,838 INFO L861 garLoopResultBuilder]: At program point L431(lines 13 439) the Hoare annotation is: true [2022-02-20 17:03:11,838 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 436) no Hoare annotation was computed. [2022-02-20 17:03:11,841 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:03:11,841 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 17:03:11,844 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 17:03:11,845 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-02-20 17:03:11,846 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 17:03:11,847 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-02-20 17:03:11,849 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L374 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2022-02-20 17:03:11,850 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L386 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 17:03:11,851 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 17:03:11,852 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L214 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 17:03:11,853 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-02-20 17:03:11,857 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-02-20 17:03:11,857 WARN L170 areAnnotationChecker]: L234 has no Hoare annotation [2022-02-20 17:03:11,857 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-02-20 17:03:11,857 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2022-02-20 17:03:11,857 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-02-20 17:03:11,857 WARN L170 areAnnotationChecker]: L243 has no Hoare annotation [2022-02-20 17:03:11,857 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-02-20 17:03:11,857 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2022-02-20 17:03:11,857 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-02-20 17:03:11,858 WARN L170 areAnnotationChecker]: L255 has no Hoare annotation [2022-02-20 17:03:11,858 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-02-20 17:03:11,858 WARN L170 areAnnotationChecker]: L262 has no Hoare annotation [2022-02-20 17:03:11,858 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-02-20 17:03:11,858 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2022-02-20 17:03:11,861 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-20 17:03:11,861 WARN L170 areAnnotationChecker]: L272 has no Hoare annotation [2022-02-20 17:03:11,861 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-02-20 17:03:11,861 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2022-02-20 17:03:11,861 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-02-20 17:03:11,862 WARN L170 areAnnotationChecker]: L284 has no Hoare annotation [2022-02-20 17:03:11,862 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-02-20 17:03:11,862 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2022-02-20 17:03:11,862 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 17:03:11,862 WARN L170 areAnnotationChecker]: L296 has no Hoare annotation [2022-02-20 17:03:11,862 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-02-20 17:03:11,862 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2022-02-20 17:03:11,862 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-02-20 17:03:11,862 WARN L170 areAnnotationChecker]: L308 has no Hoare annotation [2022-02-20 17:03:11,863 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:03:11,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:03:11 BoogieIcfgContainer [2022-02-20 17:03:11,881 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:03:11,882 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:03:11,882 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:03:11,882 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:03:11,882 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:02:33" (3/4) ... [2022-02-20 17:03:11,885 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:03:11,895 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 17:03:11,895 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:03:11,896 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:03:11,896 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:03:11,952 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:03:11,953 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:03:11,954 INFO L158 Benchmark]: Toolchain (without parser) took 39595.85ms. Allocated memory was 83.9MB in the beginning and 545.3MB in the end (delta: 461.4MB). Free memory was 58.0MB in the beginning and 504.3MB in the end (delta: -446.4MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-02-20 17:03:11,954 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:03:11,954 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.08ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 57.7MB in the beginning and 68.1MB in the end (delta: -10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:03:11,954 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.55ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 65.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:03:11,954 INFO L158 Benchmark]: Boogie Preprocessor took 22.81ms. Allocated memory is still 102.8MB. Free memory was 65.4MB in the beginning and 64.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:03:11,955 INFO L158 Benchmark]: RCFGBuilder took 504.53ms. Allocated memory is still 102.8MB. Free memory was 64.0MB in the beginning and 77.3MB in the end (delta: -13.3MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-02-20 17:03:11,955 INFO L158 Benchmark]: TraceAbstraction took 38563.28ms. Allocated memory was 102.8MB in the beginning and 545.3MB in the end (delta: 442.5MB). Free memory was 76.9MB in the beginning and 509.6MB in the end (delta: -432.7MB). Peak memory consumption was 326.9MB. Max. memory is 16.1GB. [2022-02-20 17:03:11,955 INFO L158 Benchmark]: Witness Printer took 71.04ms. Allocated memory is still 545.3MB. Free memory was 509.6MB in the beginning and 504.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:03:11,956 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.15ms. Allocated memory is still 83.9MB. Free memory is still 41.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.08ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 57.7MB in the beginning and 68.1MB in the end (delta: -10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.55ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 65.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.81ms. Allocated memory is still 102.8MB. Free memory was 65.4MB in the beginning and 64.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 504.53ms. Allocated memory is still 102.8MB. Free memory was 64.0MB in the beginning and 77.3MB in the end (delta: -13.3MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 38563.28ms. Allocated memory was 102.8MB in the beginning and 545.3MB in the end (delta: 442.5MB). Free memory was 76.9MB in the beginning and 509.6MB in the end (delta: -432.7MB). Peak memory consumption was 326.9MB. Max. memory is 16.1GB. * Witness Printer took 71.04ms. Allocated memory is still 545.3MB. Free memory was 509.6MB in the beginning and 504.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 1 procedures, 82 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 38.5s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 28.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2142 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2142 mSDsluCounter, 2674 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1427 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1148 IncrementalHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 1247 mSDtfsCounter, 1148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 342 GetRequests, 213 SyntacticMatches, 18 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 300 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 16 NumberOfFragments, 679 HoareAnnotationTreeSize, 6 FomulaSimplifications, 68221 FormulaSimplificationTreeSizeReduction, 28.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 312870 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 1807 SizeOfPredicates, 12 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 29 InterpolantComputations, 20 PerfectInterpolantSequences, 11/29 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__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 == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__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__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__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 == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__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))))) && 1 <= __VERIFIER_assert__cond) || (((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && main__cp < main__urilen) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__cp + 1 < main__urilen) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && main__c == 0) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && __VERIFIER_assert__cond == 1) && main__cp + 1 < main__urilen) && ((((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))) && main__c == 0) || ((1 <= main__c && !(__VERIFIER_assert__cond == 0)) && ((((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) || (((((((((((((!(__VERIFIER_assert__cond == 0) && !(__VERIFIER_assert__cond == 0)) && 2 + main__c <= main__tokenlen) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && 0 < main__scheme) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0))))) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: main__cp < main__urilen && ((((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && !(main__scheme <= 0)) || ((((((!(__VERIFIER_assert__cond == 0) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0))) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (!(main__urilen <= main__cp) && __VERIFIER_assert__cond == 1) && ((((((!(__VERIFIER_assert__cond == 0) && !(__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 == 0)) && __VERIFIER_assert__cond == 1) && 1 <= main__cp) && !(__VERIFIER_assert__cond == 0)) && !(main__scheme <= 0))) RESULT: Ultimate proved your program to be correct! [2022-02-20 17:03:12,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE