./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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 -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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 66a6484937b469ad7100c203ac276ab0d9015bbe .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:15:14,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:15:14,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:15:14,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:15:14,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:15:14,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:15:14,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:15:14,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:15:14,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:15:14,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:15:14,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:15:14,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:15:14,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:15:14,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:15:14,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:15:14,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:15:14,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:15:14,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:15:14,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:15:14,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:15:14,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:15:14,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:15:14,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:15:14,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:15:14,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:15:14,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:15:14,988 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:15:14,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:15:14,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:15:14,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:15:14,992 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:15:14,993 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:15:14,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:15:14,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:15:14,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:15:14,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:15:14,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:15:14,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:15:14,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:15:14,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:15:15,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:15:15,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:15:15,018 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:15:15,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:15:15,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:15:15,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:15:15,020 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:15:15,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:15:15,021 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:15:15,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:15:15,022 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:15:15,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:15:15,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:15:15,023 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:15:15,023 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:15:15,023 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:15:15,023 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:15:15,024 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:15:15,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:15:15,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:15:15,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:15:15,025 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:15:15,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:15:15,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:15:15,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:15:15,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:15:15,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:15:15,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:15:15,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:15:15,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:15:15,028 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:15:15,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 66a6484937b469ad7100c203ac276ab0d9015bbe [2020-07-28 18:15:15,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:15:15,429 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:15:15,433 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:15:15,435 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:15:15,435 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:15:15,436 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2020-07-28 18:15:15,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b2fd9d6/67781864e98144e6af2ccb4b32385b87/FLAG49d736987 [2020-07-28 18:15:15,961 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:15:15,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2020-07-28 18:15:15,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b2fd9d6/67781864e98144e6af2ccb4b32385b87/FLAG49d736987 [2020-07-28 18:15:16,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10b2fd9d6/67781864e98144e6af2ccb4b32385b87 [2020-07-28 18:15:16,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:15:16,322 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:15:16,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:15:16,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:15:16,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:15:16,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b622eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16, skipping insertion in model container [2020-07-28 18:15:16,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:15:16,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:15:16,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:15:16,561 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:15:16,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:15:16,613 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:15:16,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16 WrapperNode [2020-07-28 18:15:16,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:15:16,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:15:16,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:15:16,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:15:16,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:15:16,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:15:16,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:15:16,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:15:16,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... [2020-07-28 18:15:16,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:15:16,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:15:16,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:15:16,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:15:16,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:15:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:15:16,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:15:17,416 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:15:17,416 INFO L295 CfgBuilder]: Removed 42 assume(true) statements. [2020-07-28 18:15:17,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:15:17 BoogieIcfgContainer [2020-07-28 18:15:17,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:15:17,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:15:17,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:15:17,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:15:17,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:15:16" (1/3) ... [2020-07-28 18:15:17,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d2794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:15:17, skipping insertion in model container [2020-07-28 18:15:17,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:15:16" (2/3) ... [2020-07-28 18:15:17,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684d2794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:15:17, skipping insertion in model container [2020-07-28 18:15:17,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:15:17" (3/3) ... [2020-07-28 18:15:17,432 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-07-28 18:15:17,445 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:15:17,453 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-07-28 18:15:17,474 INFO L251 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-07-28 18:15:17,509 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:15:17,509 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:15:17,510 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:15:17,510 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:15:17,511 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:15:17,511 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:15:17,511 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:15:17,512 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:15:17,542 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-07-28 18:15:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:15:17,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:17,551 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:17,553 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash -374051301, now seen corresponding path program 1 times [2020-07-28 18:15:17,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:17,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832011053] [2020-07-28 18:15:17,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:17,819 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~pre5, main_#t~pre6, main_#t~nondet7, main_#t~nondet8, main_#t~pre9, main_#t~pre10, main_~scheme~0, main_~urilen~0, main_~tokenlen~0, main_~cp~0, main_~c~0;havoc main_~scheme~0;havoc main_~urilen~0;havoc main_~tokenlen~0;havoc main_~cp~0;havoc main_~c~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~urilen~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~tokenlen~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~scheme~0 := main_#t~nondet2;havoc main_#t~nondet2; {92#true} is VALID [2020-07-28 18:15:17,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#true} assume !!(main_~urilen~0 <= 1000000 && main_~urilen~0 >= -1000000); {92#true} is VALID [2020-07-28 18:15:17,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#true} assume !!(main_~tokenlen~0 <= 1000000 && main_~tokenlen~0 >= -1000000); {92#true} is VALID [2020-07-28 18:15:17,820 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#true} assume !!(main_~scheme~0 <= 1000000 && main_~scheme~0 >= -1000000); {92#true} is VALID [2020-07-28 18:15:17,821 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#true} assume main_~urilen~0 > 0; {92#true} is VALID [2020-07-28 18:15:17,821 INFO L280 TraceCheckUtils]: 5: Hoare triple {92#true} assume main_~tokenlen~0 > 0; {92#true} is VALID [2020-07-28 18:15:17,822 INFO L280 TraceCheckUtils]: 6: Hoare triple {92#true} assume main_~scheme~0 >= 0; {92#true} is VALID [2020-07-28 18:15:17,824 INFO L280 TraceCheckUtils]: 7: Hoare triple {92#true} assume !(0 == main_~scheme~0 || main_~urilen~0 - 1 < main_~scheme~0);main_~cp~0 := main_~scheme~0;__VERIFIER_assert_#in~cond := (if main_~cp~0 - 1 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {94#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:17,826 INFO L280 TraceCheckUtils]: 8: Hoare triple {94#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {93#false} is VALID [2020-07-28 18:15:17,827 INFO L280 TraceCheckUtils]: 9: Hoare triple {93#false} assume !false; {93#false} is VALID [2020-07-28 18:15:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:15:17,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832011053] [2020-07-28 18:15:17,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:17,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:15:17,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555376753] [2020-07-28 18:15:17,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-28 18:15:17,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:17,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:15:17,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:17,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:15:17,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:17,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:15:17,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:15:17,893 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 3 states. [2020-07-28 18:15:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:18,302 INFO L93 Difference]: Finished difference Result 171 states and 230 transitions. [2020-07-28 18:15:18,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:15:18,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-28 18:15:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:15:18,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-28 18:15:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:15:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 230 transitions. [2020-07-28 18:15:18,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 230 transitions. [2020-07-28 18:15:18,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:18,638 INFO L225 Difference]: With dead ends: 171 [2020-07-28 18:15:18,639 INFO L226 Difference]: Without dead ends: 83 [2020-07-28 18:15:18,644 INFO L675 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 [2020-07-28 18:15:18,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-28 18:15:18,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-07-28 18:15:18,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:18,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2020-07-28 18:15:18,716 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2020-07-28 18:15:18,716 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2020-07-28 18:15:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:18,725 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2020-07-28 18:15:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2020-07-28 18:15:18,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:18,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:18,727 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2020-07-28 18:15:18,727 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2020-07-28 18:15:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:18,734 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2020-07-28 18:15:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2020-07-28 18:15:18,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:18,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:18,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:18,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-28 18:15:18,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2020-07-28 18:15:18,744 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 10 [2020-07-28 18:15:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:18,745 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2020-07-28 18:15:18,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:15:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2020-07-28 18:15:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 18:15:18,746 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:18,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:18,747 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:15:18,748 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:18,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1314109022, now seen corresponding path program 1 times [2020-07-28 18:15:18,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:18,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697940300] [2020-07-28 18:15:18,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:18,833 INFO L280 TraceCheckUtils]: 0: Hoare triple {577#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~pre5, main_#t~pre6, main_#t~nondet7, main_#t~nondet8, main_#t~pre9, main_#t~pre10, main_~scheme~0, main_~urilen~0, main_~tokenlen~0, main_~cp~0, main_~c~0;havoc main_~scheme~0;havoc main_~urilen~0;havoc main_~tokenlen~0;havoc main_~cp~0;havoc main_~c~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~urilen~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~tokenlen~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~scheme~0 := main_#t~nondet2;havoc main_#t~nondet2; {577#true} is VALID [2020-07-28 18:15:18,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {577#true} assume !!(main_~urilen~0 <= 1000000 && main_~urilen~0 >= -1000000); {577#true} is VALID [2020-07-28 18:15:18,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {577#true} assume !!(main_~tokenlen~0 <= 1000000 && main_~tokenlen~0 >= -1000000); {577#true} is VALID [2020-07-28 18:15:18,834 INFO L280 TraceCheckUtils]: 3: Hoare triple {577#true} assume !!(main_~scheme~0 <= 1000000 && main_~scheme~0 >= -1000000); {577#true} is VALID [2020-07-28 18:15:18,835 INFO L280 TraceCheckUtils]: 4: Hoare triple {577#true} assume main_~urilen~0 > 0; {577#true} is VALID [2020-07-28 18:15:18,835 INFO L280 TraceCheckUtils]: 5: Hoare triple {577#true} assume main_~tokenlen~0 > 0; {577#true} is VALID [2020-07-28 18:15:18,836 INFO L280 TraceCheckUtils]: 6: Hoare triple {577#true} assume main_~scheme~0 >= 0; {579#(< 0 (+ ULTIMATE.start_main_~scheme~0 1))} is VALID [2020-07-28 18:15:18,838 INFO L280 TraceCheckUtils]: 7: Hoare triple {579#(< 0 (+ ULTIMATE.start_main_~scheme~0 1))} assume !(0 == main_~scheme~0 || main_~urilen~0 - 1 < main_~scheme~0);main_~cp~0 := main_~scheme~0;__VERIFIER_assert_#in~cond := (if main_~cp~0 - 1 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {580#(<= 1 ULTIMATE.start_main_~cp~0)} is VALID [2020-07-28 18:15:18,838 INFO L280 TraceCheckUtils]: 8: Hoare triple {580#(<= 1 ULTIMATE.start_main_~cp~0)} assume !(0 == __VERIFIER_assert_~cond); {580#(<= 1 ULTIMATE.start_main_~cp~0)} is VALID [2020-07-28 18:15:18,840 INFO L280 TraceCheckUtils]: 9: Hoare triple {580#(<= 1 ULTIMATE.start_main_~cp~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 - 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {581#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:18,840 INFO L280 TraceCheckUtils]: 10: Hoare triple {581#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {578#false} is VALID [2020-07-28 18:15:18,841 INFO L280 TraceCheckUtils]: 11: Hoare triple {578#false} assume !false; {578#false} is VALID [2020-07-28 18:15:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:15:18,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697940300] [2020-07-28 18:15:18,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:18,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:15:18,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170607805] [2020-07-28 18:15:18,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:15:18,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:18,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:15:18,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:18,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:15:18,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:18,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:15:18,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:18,863 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 5 states. [2020-07-28 18:15:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:19,315 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2020-07-28 18:15:19,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:15:19,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-28 18:15:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2020-07-28 18:15:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2020-07-28 18:15:19,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2020-07-28 18:15:19,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:19,432 INFO L225 Difference]: With dead ends: 83 [2020-07-28 18:15:19,432 INFO L226 Difference]: Without dead ends: 67 [2020-07-28 18:15:19,433 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:15:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-28 18:15:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-07-28 18:15:19,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:19,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2020-07-28 18:15:19,482 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-28 18:15:19,482 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-28 18:15:19,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:19,486 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-07-28 18:15:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2020-07-28 18:15:19,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:19,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:19,487 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2020-07-28 18:15:19,488 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2020-07-28 18:15:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:19,491 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-07-28 18:15:19,492 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2020-07-28 18:15:19,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:19,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:19,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:19,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:19,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-28 18:15:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2020-07-28 18:15:19,496 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 12 [2020-07-28 18:15:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:19,497 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2020-07-28 18:15:19,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:15:19,497 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2020-07-28 18:15:19,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 18:15:19,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:19,498 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:19,498 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:15:19,499 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:19,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:19,499 INFO L82 PathProgramCache]: Analyzing trace with hash -168637, now seen corresponding path program 1 times [2020-07-28 18:15:19,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:19,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236454124] [2020-07-28 18:15:19,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:19,562 INFO L280 TraceCheckUtils]: 0: Hoare triple {908#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~pre5, main_#t~pre6, main_#t~nondet7, main_#t~nondet8, main_#t~pre9, main_#t~pre10, main_~scheme~0, main_~urilen~0, main_~tokenlen~0, main_~cp~0, main_~c~0;havoc main_~scheme~0;havoc main_~urilen~0;havoc main_~tokenlen~0;havoc main_~cp~0;havoc main_~c~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~urilen~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~tokenlen~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~scheme~0 := main_#t~nondet2;havoc main_#t~nondet2; {908#true} is VALID [2020-07-28 18:15:19,563 INFO L280 TraceCheckUtils]: 1: Hoare triple {908#true} assume !!(main_~urilen~0 <= 1000000 && main_~urilen~0 >= -1000000); {908#true} is VALID [2020-07-28 18:15:19,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {908#true} assume !!(main_~tokenlen~0 <= 1000000 && main_~tokenlen~0 >= -1000000); {908#true} is VALID [2020-07-28 18:15:19,563 INFO L280 TraceCheckUtils]: 3: Hoare triple {908#true} assume !!(main_~scheme~0 <= 1000000 && main_~scheme~0 >= -1000000); {908#true} is VALID [2020-07-28 18:15:19,564 INFO L280 TraceCheckUtils]: 4: Hoare triple {908#true} assume main_~urilen~0 > 0; {908#true} is VALID [2020-07-28 18:15:19,564 INFO L280 TraceCheckUtils]: 5: Hoare triple {908#true} assume main_~tokenlen~0 > 0; {908#true} is VALID [2020-07-28 18:15:19,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {908#true} assume main_~scheme~0 >= 0; {908#true} is VALID [2020-07-28 18:15:19,566 INFO L280 TraceCheckUtils]: 7: Hoare triple {908#true} assume !(0 == main_~scheme~0 || main_~urilen~0 - 1 < main_~scheme~0);main_~cp~0 := main_~scheme~0;__VERIFIER_assert_#in~cond := (if main_~cp~0 - 1 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:19,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:19,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 - 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:19,569 INFO L280 TraceCheckUtils]: 10: Hoare triple {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:19,571 INFO L280 TraceCheckUtils]: 11: Hoare triple {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:19,572 INFO L280 TraceCheckUtils]: 12: Hoare triple {910#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume 0 != main_#t~nondet3;havoc main_#t~nondet3;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {911#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:19,573 INFO L280 TraceCheckUtils]: 13: Hoare triple {911#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {909#false} is VALID [2020-07-28 18:15:19,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {909#false} assume !false; {909#false} is VALID [2020-07-28 18:15:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:15:19,575 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236454124] [2020-07-28 18:15:19,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:19,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:15:19,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993738969] [2020-07-28 18:15:19,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 18:15:19,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:19,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:15:19,594 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:19,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:15:19,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:19,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:15:19,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:15:19,595 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 4 states. [2020-07-28 18:15:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:19,997 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2020-07-28 18:15:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:15:19,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 18:15:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2020-07-28 18:15:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2020-07-28 18:15:20,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 93 transitions. [2020-07-28 18:15:20,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:20,114 INFO L225 Difference]: With dead ends: 88 [2020-07-28 18:15:20,114 INFO L226 Difference]: Without dead ends: 80 [2020-07-28 18:15:20,115 INFO L675 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 [2020-07-28 18:15:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-28 18:15:20,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2020-07-28 18:15:20,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:20,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 74 states. [2020-07-28 18:15:20,172 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 74 states. [2020-07-28 18:15:20,172 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 74 states. [2020-07-28 18:15:20,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:20,176 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-28 18:15:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-28 18:15:20,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:20,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:20,177 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 80 states. [2020-07-28 18:15:20,178 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 80 states. [2020-07-28 18:15:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:20,184 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-28 18:15:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2020-07-28 18:15:20,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:20,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:20,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:20,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:20,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-28 18:15:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2020-07-28 18:15:20,194 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 15 [2020-07-28 18:15:20,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:20,195 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2020-07-28 18:15:20,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:15:20,195 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2020-07-28 18:15:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 18:15:20,202 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:20,202 INFO L422 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] [2020-07-28 18:15:20,203 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 18:15:20,206 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:20,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:20,208 INFO L82 PathProgramCache]: Analyzing trace with hash -749433183, now seen corresponding path program 1 times [2020-07-28 18:15:20,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:20,209 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747588009] [2020-07-28 18:15:20,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:20,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {1284#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~pre5, main_#t~pre6, main_#t~nondet7, main_#t~nondet8, main_#t~pre9, main_#t~pre10, main_~scheme~0, main_~urilen~0, main_~tokenlen~0, main_~cp~0, main_~c~0;havoc main_~scheme~0;havoc main_~urilen~0;havoc main_~tokenlen~0;havoc main_~cp~0;havoc main_~c~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~urilen~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~tokenlen~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~scheme~0 := main_#t~nondet2;havoc main_#t~nondet2; {1284#true} is VALID [2020-07-28 18:15:20,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} assume !!(main_~urilen~0 <= 1000000 && main_~urilen~0 >= -1000000); {1284#true} is VALID [2020-07-28 18:15:20,375 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} assume !!(main_~tokenlen~0 <= 1000000 && main_~tokenlen~0 >= -1000000); {1284#true} is VALID [2020-07-28 18:15:20,376 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} assume !!(main_~scheme~0 <= 1000000 && main_~scheme~0 >= -1000000); {1284#true} is VALID [2020-07-28 18:15:20,376 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} assume main_~urilen~0 > 0; {1284#true} is VALID [2020-07-28 18:15:20,376 INFO L280 TraceCheckUtils]: 5: Hoare triple {1284#true} assume main_~tokenlen~0 > 0; {1284#true} is VALID [2020-07-28 18:15:20,377 INFO L280 TraceCheckUtils]: 6: Hoare triple {1284#true} assume main_~scheme~0 >= 0; {1284#true} is VALID [2020-07-28 18:15:20,378 INFO L280 TraceCheckUtils]: 7: Hoare triple {1284#true} assume !(0 == main_~scheme~0 || main_~urilen~0 - 1 < main_~scheme~0);main_~cp~0 := main_~scheme~0;__VERIFIER_assert_#in~cond := (if main_~cp~0 - 1 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,379 INFO L280 TraceCheckUtils]: 9: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 - 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,379 INFO L280 TraceCheckUtils]: 11: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,380 INFO L280 TraceCheckUtils]: 12: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume 0 != main_#t~nondet3;havoc main_#t~nondet3;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,380 INFO L280 TraceCheckUtils]: 13: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,381 INFO L280 TraceCheckUtils]: 14: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,383 INFO L280 TraceCheckUtils]: 15: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,385 INFO L280 TraceCheckUtils]: 16: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !!(main_~cp~0 != main_~urilen~0 - 1);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,386 INFO L280 TraceCheckUtils]: 17: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,388 INFO L280 TraceCheckUtils]: 18: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,390 INFO L280 TraceCheckUtils]: 19: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,393 INFO L280 TraceCheckUtils]: 20: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,395 INFO L280 TraceCheckUtils]: 21: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} main_#t~pre5 := 1 + main_~cp~0;main_~cp~0 := 1 + main_~cp~0;havoc main_#t~pre5; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,395 INFO L280 TraceCheckUtils]: 22: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !!(main_~cp~0 != main_~urilen~0 - 1);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,396 INFO L280 TraceCheckUtils]: 23: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1288#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:20,397 INFO L280 TraceCheckUtils]: 24: Hoare triple {1288#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {1285#false} is VALID [2020-07-28 18:15:20,397 INFO L280 TraceCheckUtils]: 25: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2020-07-28 18:15:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:15:20,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747588009] [2020-07-28 18:15:20,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291516311] [2020-07-28 18:15:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:15:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:20,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 18:15:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:20,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:15:20,668 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:15:20,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {1284#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~pre5, main_#t~pre6, main_#t~nondet7, main_#t~nondet8, main_#t~pre9, main_#t~pre10, main_~scheme~0, main_~urilen~0, main_~tokenlen~0, main_~cp~0, main_~c~0;havoc main_~scheme~0;havoc main_~urilen~0;havoc main_~tokenlen~0;havoc main_~cp~0;havoc main_~c~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~urilen~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~tokenlen~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~scheme~0 := main_#t~nondet2;havoc main_#t~nondet2; {1284#true} is VALID [2020-07-28 18:15:20,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {1284#true} assume !!(main_~urilen~0 <= 1000000 && main_~urilen~0 >= -1000000); {1284#true} is VALID [2020-07-28 18:15:20,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {1284#true} assume !!(main_~tokenlen~0 <= 1000000 && main_~tokenlen~0 >= -1000000); {1284#true} is VALID [2020-07-28 18:15:20,786 INFO L280 TraceCheckUtils]: 3: Hoare triple {1284#true} assume !!(main_~scheme~0 <= 1000000 && main_~scheme~0 >= -1000000); {1284#true} is VALID [2020-07-28 18:15:20,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {1284#true} assume main_~urilen~0 > 0; {1284#true} is VALID [2020-07-28 18:15:20,786 INFO L280 TraceCheckUtils]: 5: Hoare triple {1284#true} assume main_~tokenlen~0 > 0; {1284#true} is VALID [2020-07-28 18:15:20,787 INFO L280 TraceCheckUtils]: 6: Hoare triple {1284#true} assume main_~scheme~0 >= 0; {1284#true} is VALID [2020-07-28 18:15:20,789 INFO L280 TraceCheckUtils]: 7: Hoare triple {1284#true} assume !(0 == main_~scheme~0 || main_~urilen~0 - 1 < main_~scheme~0);main_~cp~0 := main_~scheme~0;__VERIFIER_assert_#in~cond := (if main_~cp~0 - 1 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,790 INFO L280 TraceCheckUtils]: 8: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,791 INFO L280 TraceCheckUtils]: 9: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 - 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,792 INFO L280 TraceCheckUtils]: 10: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,793 INFO L280 TraceCheckUtils]: 11: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,794 INFO L280 TraceCheckUtils]: 12: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume 0 != main_#t~nondet3;havoc main_#t~nondet3;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,794 INFO L280 TraceCheckUtils]: 13: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,795 INFO L280 TraceCheckUtils]: 14: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,796 INFO L280 TraceCheckUtils]: 15: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,798 INFO L280 TraceCheckUtils]: 16: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !!(main_~cp~0 != main_~urilen~0 - 1);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,800 INFO L280 TraceCheckUtils]: 17: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,801 INFO L280 TraceCheckUtils]: 18: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,802 INFO L280 TraceCheckUtils]: 19: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,802 INFO L280 TraceCheckUtils]: 20: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,804 INFO L280 TraceCheckUtils]: 21: Hoare triple {1287#(< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} main_#t~pre5 := 1 + main_~cp~0;main_~cp~0 := 1 + main_~cp~0;havoc main_#t~pre5; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,804 INFO L280 TraceCheckUtils]: 22: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !!(main_~cp~0 != main_~urilen~0 - 1);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:20,806 INFO L280 TraceCheckUtils]: 23: Hoare triple {1286#(<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 != main_#t~nondet4);havoc main_#t~nondet4;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1361#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:15:20,806 INFO L280 TraceCheckUtils]: 24: Hoare triple {1361#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {1285#false} is VALID [2020-07-28 18:15:20,807 INFO L280 TraceCheckUtils]: 25: Hoare triple {1285#false} assume !false; {1285#false} is VALID [2020-07-28 18:15:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:15:20,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:15:20,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-28 18:15:20,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993298283] [2020-07-28 18:15:20,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-28 18:15:20,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:20,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:15:20,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:20,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:15:20,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:20,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:15:20,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:15:20,845 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 6 states. [2020-07-28 18:15:21,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:21,279 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2020-07-28 18:15:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:15:21,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-28 18:15:21,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:15:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-28 18:15:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:15:21,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2020-07-28 18:15:21,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2020-07-28 18:15:21,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:21,379 INFO L225 Difference]: With dead ends: 80 [2020-07-28 18:15:21,379 INFO L226 Difference]: Without dead ends: 68 [2020-07-28 18:15:21,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:15:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-28 18:15:21,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2020-07-28 18:15:21,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:21,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 53 states. [2020-07-28 18:15:21,444 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 53 states. [2020-07-28 18:15:21,445 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 53 states. [2020-07-28 18:15:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:21,448 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2020-07-28 18:15:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2020-07-28 18:15:21,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:21,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:21,449 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 68 states. [2020-07-28 18:15:21,449 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 68 states. [2020-07-28 18:15:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:21,453 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2020-07-28 18:15:21,453 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2020-07-28 18:15:21,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:21,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:21,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:21,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-28 18:15:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2020-07-28 18:15:21,461 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 26 [2020-07-28 18:15:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:21,461 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2020-07-28 18:15:21,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:15:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2020-07-28 18:15:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-28 18:15:21,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:21,463 INFO L422 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] [2020-07-28 18:15:21,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:15:21,677 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:21,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1520484215, now seen corresponding path program 1 times [2020-07-28 18:15:21,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:21,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085557172] [2020-07-28 18:15:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:21,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {1686#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~pre5, main_#t~pre6, main_#t~nondet7, main_#t~nondet8, main_#t~pre9, main_#t~pre10, main_~scheme~0, main_~urilen~0, main_~tokenlen~0, main_~cp~0, main_~c~0;havoc main_~scheme~0;havoc main_~urilen~0;havoc main_~tokenlen~0;havoc main_~cp~0;havoc main_~c~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~urilen~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~tokenlen~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~scheme~0 := main_#t~nondet2;havoc main_#t~nondet2; {1686#true} is VALID [2020-07-28 18:15:21,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {1686#true} assume !!(main_~urilen~0 <= 1000000 && main_~urilen~0 >= -1000000); {1686#true} is VALID [2020-07-28 18:15:21,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {1686#true} assume !!(main_~tokenlen~0 <= 1000000 && main_~tokenlen~0 >= -1000000); {1686#true} is VALID [2020-07-28 18:15:21,734 INFO L280 TraceCheckUtils]: 3: Hoare triple {1686#true} assume !!(main_~scheme~0 <= 1000000 && main_~scheme~0 >= -1000000); {1686#true} is VALID [2020-07-28 18:15:21,734 INFO L280 TraceCheckUtils]: 4: Hoare triple {1686#true} assume main_~urilen~0 > 0; {1686#true} is VALID [2020-07-28 18:15:21,735 INFO L280 TraceCheckUtils]: 5: Hoare triple {1686#true} assume main_~tokenlen~0 > 0; {1686#true} is VALID [2020-07-28 18:15:21,735 INFO L280 TraceCheckUtils]: 6: Hoare triple {1686#true} assume main_~scheme~0 >= 0; {1686#true} is VALID [2020-07-28 18:15:21,735 INFO L280 TraceCheckUtils]: 7: Hoare triple {1686#true} assume !(0 == main_~scheme~0 || main_~urilen~0 - 1 < main_~scheme~0);main_~cp~0 := main_~scheme~0;__VERIFIER_assert_#in~cond := (if main_~cp~0 - 1 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#true} is VALID [2020-07-28 18:15:21,735 INFO L280 TraceCheckUtils]: 8: Hoare triple {1686#true} assume !(0 == __VERIFIER_assert_~cond); {1686#true} is VALID [2020-07-28 18:15:21,736 INFO L280 TraceCheckUtils]: 9: Hoare triple {1686#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 - 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#true} is VALID [2020-07-28 18:15:21,736 INFO L280 TraceCheckUtils]: 10: Hoare triple {1686#true} assume !(0 == __VERIFIER_assert_~cond); {1686#true} is VALID [2020-07-28 18:15:21,736 INFO L280 TraceCheckUtils]: 11: Hoare triple {1686#true} assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; {1686#true} is VALID [2020-07-28 18:15:21,736 INFO L280 TraceCheckUtils]: 12: Hoare triple {1686#true} assume 0 != main_#t~nondet3;havoc main_#t~nondet3;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#true} is VALID [2020-07-28 18:15:21,736 INFO L280 TraceCheckUtils]: 13: Hoare triple {1686#true} assume !(0 == __VERIFIER_assert_~cond); {1686#true} is VALID [2020-07-28 18:15:21,737 INFO L280 TraceCheckUtils]: 14: Hoare triple {1686#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1686#true} is VALID [2020-07-28 18:15:21,737 INFO L280 TraceCheckUtils]: 15: Hoare triple {1686#true} assume !(0 == __VERIFIER_assert_~cond); {1686#true} is VALID [2020-07-28 18:15:21,739 INFO L280 TraceCheckUtils]: 16: Hoare triple {1686#true} assume !(main_~cp~0 != main_~urilen~0 - 1); {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:21,741 INFO L280 TraceCheckUtils]: 17: Hoare triple {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} __VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:21,743 INFO L280 TraceCheckUtils]: 18: Hoare triple {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:21,745 INFO L280 TraceCheckUtils]: 19: Hoare triple {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:21,746 INFO L280 TraceCheckUtils]: 20: Hoare triple {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(0 == __VERIFIER_assert_~cond); {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} is VALID [2020-07-28 18:15:21,747 INFO L280 TraceCheckUtils]: 21: Hoare triple {1688#(= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)} assume !(main_~cp~0 == main_~urilen~0 - 1);__VERIFIER_assert_#in~cond := (if 1 + main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1687#false} is VALID [2020-07-28 18:15:21,747 INFO L280 TraceCheckUtils]: 22: Hoare triple {1687#false} assume !(0 == __VERIFIER_assert_~cond); {1687#false} is VALID [2020-07-28 18:15:21,748 INFO L280 TraceCheckUtils]: 23: Hoare triple {1687#false} __VERIFIER_assert_#in~cond := (if 0 <= 1 + main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1687#false} is VALID [2020-07-28 18:15:21,748 INFO L280 TraceCheckUtils]: 24: Hoare triple {1687#false} assume !(0 == __VERIFIER_assert_~cond); {1687#false} is VALID [2020-07-28 18:15:21,749 INFO L280 TraceCheckUtils]: 25: Hoare triple {1687#false} assume !(1 + main_~cp~0 == main_~urilen~0 - 1);main_#t~pre6 := 1 + main_~cp~0;main_~cp~0 := 1 + main_~cp~0;havoc main_#t~pre6;main_~scheme~0 := main_~cp~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1687#false} is VALID [2020-07-28 18:15:21,749 INFO L280 TraceCheckUtils]: 26: Hoare triple {1687#false} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~c~0 := 0;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1687#false} is VALID [2020-07-28 18:15:21,749 INFO L280 TraceCheckUtils]: 27: Hoare triple {1687#false} assume !(0 == __VERIFIER_assert_~cond); {1687#false} is VALID [2020-07-28 18:15:21,749 INFO L280 TraceCheckUtils]: 28: Hoare triple {1687#false} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1687#false} is VALID [2020-07-28 18:15:21,750 INFO L280 TraceCheckUtils]: 29: Hoare triple {1687#false} assume !(0 == __VERIFIER_assert_~cond); {1687#false} is VALID [2020-07-28 18:15:21,750 INFO L280 TraceCheckUtils]: 30: Hoare triple {1687#false} assume !!(main_~cp~0 != main_~urilen~0 - 1 && main_~c~0 < main_~tokenlen~0 - 1);__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1687#false} is VALID [2020-07-28 18:15:21,750 INFO L280 TraceCheckUtils]: 31: Hoare triple {1687#false} assume !(0 == __VERIFIER_assert_~cond); {1687#false} is VALID [2020-07-28 18:15:21,750 INFO L280 TraceCheckUtils]: 32: Hoare triple {1687#false} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1687#false} is VALID [2020-07-28 18:15:21,751 INFO L280 TraceCheckUtils]: 33: Hoare triple {1687#false} assume !(0 == __VERIFIER_assert_~cond); {1687#false} is VALID [2020-07-28 18:15:21,751 INFO L280 TraceCheckUtils]: 34: Hoare triple {1687#false} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {1687#false} is VALID [2020-07-28 18:15:21,751 INFO L280 TraceCheckUtils]: 35: Hoare triple {1687#false} assume 0 != main_#t~nondet8;havoc main_#t~nondet8;main_#t~pre9 := 1 + main_~c~0;main_~c~0 := 1 + main_~c~0;havoc main_#t~pre9;__VERIFIER_assert_#in~cond := (if main_~c~0 < main_~tokenlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1687#false} is VALID [2020-07-28 18:15:21,752 INFO L280 TraceCheckUtils]: 36: Hoare triple {1687#false} assume 0 == __VERIFIER_assert_~cond; {1687#false} is VALID [2020-07-28 18:15:21,752 INFO L280 TraceCheckUtils]: 37: Hoare triple {1687#false} assume !false; {1687#false} is VALID [2020-07-28 18:15:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:15:21,755 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085557172] [2020-07-28 18:15:21,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:21,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:15:21,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820727559] [2020-07-28 18:15:21,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-28 18:15:21,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:21,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:15:21,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:21,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:15:21,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:21,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:15:21,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:15:21,797 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 3 states. [2020-07-28 18:15:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:21,991 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-28 18:15:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:15:21,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2020-07-28 18:15:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:15:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2020-07-28 18:15:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:15:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2020-07-28 18:15:21,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2020-07-28 18:15:22,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:22,072 INFO L225 Difference]: With dead ends: 84 [2020-07-28 18:15:22,073 INFO L226 Difference]: Without dead ends: 53 [2020-07-28 18:15:22,073 INFO L675 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 [2020-07-28 18:15:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-28 18:15:22,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-07-28 18:15:22,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:22,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2020-07-28 18:15:22,140 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-28 18:15:22,140 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-28 18:15:22,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:22,142 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-28 18:15:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-28 18:15:22,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:22,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:22,142 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2020-07-28 18:15:22,143 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2020-07-28 18:15:22,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:22,144 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-07-28 18:15:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-28 18:15:22,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:22,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:22,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:22,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-28 18:15:22,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-28 18:15:22,147 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2020-07-28 18:15:22,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:22,147 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-28 18:15:22,147 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:15:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-28 18:15:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-28 18:15:22,148 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:22,148 INFO L422 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] [2020-07-28 18:15:22,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 18:15:22,149 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash 550411780, now seen corresponding path program 1 times [2020-07-28 18:15:22,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:22,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067640860] [2020-07-28 18:15:22,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:22,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {1982#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~pre5, main_#t~pre6, main_#t~nondet7, main_#t~nondet8, main_#t~pre9, main_#t~pre10, main_~scheme~0, main_~urilen~0, main_~tokenlen~0, main_~cp~0, main_~c~0;havoc main_~scheme~0;havoc main_~urilen~0;havoc main_~tokenlen~0;havoc main_~cp~0;havoc main_~c~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~urilen~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~tokenlen~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~scheme~0 := main_#t~nondet2;havoc main_#t~nondet2; {1982#true} is VALID [2020-07-28 18:15:22,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {1982#true} assume !!(main_~urilen~0 <= 1000000 && main_~urilen~0 >= -1000000); {1982#true} is VALID [2020-07-28 18:15:22,256 INFO L280 TraceCheckUtils]: 2: Hoare triple {1982#true} assume !!(main_~tokenlen~0 <= 1000000 && main_~tokenlen~0 >= -1000000); {1982#true} is VALID [2020-07-28 18:15:22,256 INFO L280 TraceCheckUtils]: 3: Hoare triple {1982#true} assume !!(main_~scheme~0 <= 1000000 && main_~scheme~0 >= -1000000); {1982#true} is VALID [2020-07-28 18:15:22,256 INFO L280 TraceCheckUtils]: 4: Hoare triple {1982#true} assume main_~urilen~0 > 0; {1982#true} is VALID [2020-07-28 18:15:22,257 INFO L280 TraceCheckUtils]: 5: Hoare triple {1982#true} assume main_~tokenlen~0 > 0; {1982#true} is VALID [2020-07-28 18:15:22,257 INFO L280 TraceCheckUtils]: 6: Hoare triple {1982#true} assume main_~scheme~0 >= 0; {1982#true} is VALID [2020-07-28 18:15:22,257 INFO L280 TraceCheckUtils]: 7: Hoare triple {1982#true} assume !(0 == main_~scheme~0 || main_~urilen~0 - 1 < main_~scheme~0);main_~cp~0 := main_~scheme~0;__VERIFIER_assert_#in~cond := (if main_~cp~0 - 1 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1982#true} is VALID [2020-07-28 18:15:22,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {1982#true} assume !(0 == __VERIFIER_assert_~cond); {1982#true} is VALID [2020-07-28 18:15:22,258 INFO L280 TraceCheckUtils]: 9: Hoare triple {1982#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 - 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1982#true} is VALID [2020-07-28 18:15:22,258 INFO L280 TraceCheckUtils]: 10: Hoare triple {1982#true} assume !(0 == __VERIFIER_assert_~cond); {1982#true} is VALID [2020-07-28 18:15:22,258 INFO L280 TraceCheckUtils]: 11: Hoare triple {1982#true} assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; {1982#true} is VALID [2020-07-28 18:15:22,259 INFO L280 TraceCheckUtils]: 12: Hoare triple {1982#true} assume 0 != main_#t~nondet3;havoc main_#t~nondet3;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1982#true} is VALID [2020-07-28 18:15:22,259 INFO L280 TraceCheckUtils]: 13: Hoare triple {1982#true} assume !(0 == __VERIFIER_assert_~cond); {1982#true} is VALID [2020-07-28 18:15:22,259 INFO L280 TraceCheckUtils]: 14: Hoare triple {1982#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1982#true} is VALID [2020-07-28 18:15:22,259 INFO L280 TraceCheckUtils]: 15: Hoare triple {1982#true} assume !(0 == __VERIFIER_assert_~cond); {1982#true} is VALID [2020-07-28 18:15:22,259 INFO L280 TraceCheckUtils]: 16: Hoare triple {1982#true} assume !!(main_~cp~0 != main_~urilen~0 - 1);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {1982#true} is VALID [2020-07-28 18:15:22,260 INFO L280 TraceCheckUtils]: 17: Hoare triple {1982#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {1982#true} is VALID [2020-07-28 18:15:22,260 INFO L280 TraceCheckUtils]: 18: Hoare triple {1982#true} __VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1982#true} is VALID [2020-07-28 18:15:22,260 INFO L280 TraceCheckUtils]: 19: Hoare triple {1982#true} assume !(0 == __VERIFIER_assert_~cond); {1982#true} is VALID [2020-07-28 18:15:22,261 INFO L280 TraceCheckUtils]: 20: Hoare triple {1982#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1982#true} is VALID [2020-07-28 18:15:22,261 INFO L280 TraceCheckUtils]: 21: Hoare triple {1982#true} assume !(0 == __VERIFIER_assert_~cond); {1982#true} is VALID [2020-07-28 18:15:22,261 INFO L280 TraceCheckUtils]: 22: Hoare triple {1982#true} assume !(main_~cp~0 == main_~urilen~0 - 1);__VERIFIER_assert_#in~cond := (if 1 + main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1982#true} is VALID [2020-07-28 18:15:22,264 INFO L280 TraceCheckUtils]: 23: Hoare triple {1982#true} assume !(0 == __VERIFIER_assert_~cond); {1982#true} is VALID [2020-07-28 18:15:22,264 INFO L280 TraceCheckUtils]: 24: Hoare triple {1982#true} __VERIFIER_assert_#in~cond := (if 0 <= 1 + main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1982#true} is VALID [2020-07-28 18:15:22,264 INFO L280 TraceCheckUtils]: 25: Hoare triple {1982#true} assume !(0 == __VERIFIER_assert_~cond); {1982#true} is VALID [2020-07-28 18:15:22,264 INFO L280 TraceCheckUtils]: 26: Hoare triple {1982#true} assume !(1 + main_~cp~0 == main_~urilen~0 - 1);main_#t~pre6 := 1 + main_~cp~0;main_~cp~0 := 1 + main_~cp~0;havoc main_#t~pre6;main_~scheme~0 := main_~cp~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {1982#true} is VALID [2020-07-28 18:15:22,265 INFO L280 TraceCheckUtils]: 27: Hoare triple {1982#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~c~0 := 0;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1984#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:22,266 INFO L280 TraceCheckUtils]: 28: Hoare triple {1984#(= 0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {1984#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:22,266 INFO L280 TraceCheckUtils]: 29: Hoare triple {1984#(= 0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1984#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:22,267 INFO L280 TraceCheckUtils]: 30: Hoare triple {1984#(= 0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {1984#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:22,268 INFO L280 TraceCheckUtils]: 31: Hoare triple {1984#(= 0 ULTIMATE.start_main_~c~0)} assume !!(main_~cp~0 != main_~urilen~0 - 1 && main_~c~0 < main_~tokenlen~0 - 1);__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} is VALID [2020-07-28 18:15:22,269 INFO L280 TraceCheckUtils]: 32: Hoare triple {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} assume !(0 == __VERIFIER_assert_~cond); {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} is VALID [2020-07-28 18:15:22,269 INFO L280 TraceCheckUtils]: 33: Hoare triple {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} is VALID [2020-07-28 18:15:22,270 INFO L280 TraceCheckUtils]: 34: Hoare triple {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} assume !(0 == __VERIFIER_assert_~cond); {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} is VALID [2020-07-28 18:15:22,271 INFO L280 TraceCheckUtils]: 35: Hoare triple {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} is VALID [2020-07-28 18:15:22,272 INFO L280 TraceCheckUtils]: 36: Hoare triple {1985#(and (= 0 ULTIMATE.start_main_~c~0) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0))} assume 0 != main_#t~nondet8;havoc main_#t~nondet8;main_#t~pre9 := 1 + main_~c~0;main_~c~0 := 1 + main_~c~0;havoc main_#t~pre9;__VERIFIER_assert_#in~cond := (if main_~c~0 < main_~tokenlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1986#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:22,273 INFO L280 TraceCheckUtils]: 37: Hoare triple {1986#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {1983#false} is VALID [2020-07-28 18:15:22,273 INFO L280 TraceCheckUtils]: 38: Hoare triple {1983#false} assume !false; {1983#false} is VALID [2020-07-28 18:15:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:15:22,276 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067640860] [2020-07-28 18:15:22,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:22,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:15:22,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162256321] [2020-07-28 18:15:22,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-28 18:15:22,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:22,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:15:22,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:22,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:15:22,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:22,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:15:22,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:22,319 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 5 states. [2020-07-28 18:15:22,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:22,650 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2020-07-28 18:15:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:15:22,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2020-07-28 18:15:22,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-28 18:15:22,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-28 18:15:22,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2020-07-28 18:15:22,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:22,754 INFO L225 Difference]: With dead ends: 64 [2020-07-28 18:15:22,754 INFO L226 Difference]: Without dead ends: 62 [2020-07-28 18:15:22,755 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:15:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-07-28 18:15:22,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2020-07-28 18:15:22,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:22,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 61 states. [2020-07-28 18:15:22,837 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 61 states. [2020-07-28 18:15:22,837 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 61 states. [2020-07-28 18:15:22,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:22,840 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-28 18:15:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-28 18:15:22,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:22,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:22,840 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 62 states. [2020-07-28 18:15:22,840 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 62 states. [2020-07-28 18:15:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:22,843 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-28 18:15:22,843 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2020-07-28 18:15:22,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:22,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:22,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:22,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-28 18:15:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2020-07-28 18:15:22,846 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 39 [2020-07-28 18:15:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:22,846 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2020-07-28 18:15:22,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:15:22,846 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2020-07-28 18:15:22,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-28 18:15:22,849 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:22,849 INFO L422 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, 1] [2020-07-28 18:15:22,849 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 18:15:22,849 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:22,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:22,850 INFO L82 PathProgramCache]: Analyzing trace with hash 664905863, now seen corresponding path program 1 times [2020-07-28 18:15:22,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:22,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459008826] [2020-07-28 18:15:22,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:22,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {2287#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~pre5, main_#t~pre6, main_#t~nondet7, main_#t~nondet8, main_#t~pre9, main_#t~pre10, main_~scheme~0, main_~urilen~0, main_~tokenlen~0, main_~cp~0, main_~c~0;havoc main_~scheme~0;havoc main_~urilen~0;havoc main_~tokenlen~0;havoc main_~cp~0;havoc main_~c~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~urilen~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~tokenlen~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~scheme~0 := main_#t~nondet2;havoc main_#t~nondet2; {2287#true} is VALID [2020-07-28 18:15:22,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {2287#true} assume !!(main_~urilen~0 <= 1000000 && main_~urilen~0 >= -1000000); {2287#true} is VALID [2020-07-28 18:15:22,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {2287#true} assume !!(main_~tokenlen~0 <= 1000000 && main_~tokenlen~0 >= -1000000); {2287#true} is VALID [2020-07-28 18:15:22,988 INFO L280 TraceCheckUtils]: 3: Hoare triple {2287#true} assume !!(main_~scheme~0 <= 1000000 && main_~scheme~0 >= -1000000); {2287#true} is VALID [2020-07-28 18:15:22,988 INFO L280 TraceCheckUtils]: 4: Hoare triple {2287#true} assume main_~urilen~0 > 0; {2287#true} is VALID [2020-07-28 18:15:22,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {2287#true} assume main_~tokenlen~0 > 0; {2287#true} is VALID [2020-07-28 18:15:22,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {2287#true} assume main_~scheme~0 >= 0; {2287#true} is VALID [2020-07-28 18:15:22,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {2287#true} assume !(0 == main_~scheme~0 || main_~urilen~0 - 1 < main_~scheme~0);main_~cp~0 := main_~scheme~0;__VERIFIER_assert_#in~cond := (if main_~cp~0 - 1 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2287#true} is VALID [2020-07-28 18:15:22,989 INFO L280 TraceCheckUtils]: 8: Hoare triple {2287#true} assume !(0 == __VERIFIER_assert_~cond); {2287#true} is VALID [2020-07-28 18:15:22,989 INFO L280 TraceCheckUtils]: 9: Hoare triple {2287#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 - 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2287#true} is VALID [2020-07-28 18:15:22,989 INFO L280 TraceCheckUtils]: 10: Hoare triple {2287#true} assume !(0 == __VERIFIER_assert_~cond); {2287#true} is VALID [2020-07-28 18:15:22,990 INFO L280 TraceCheckUtils]: 11: Hoare triple {2287#true} assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; {2287#true} is VALID [2020-07-28 18:15:22,990 INFO L280 TraceCheckUtils]: 12: Hoare triple {2287#true} assume 0 != main_#t~nondet3;havoc main_#t~nondet3;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2287#true} is VALID [2020-07-28 18:15:22,990 INFO L280 TraceCheckUtils]: 13: Hoare triple {2287#true} assume !(0 == __VERIFIER_assert_~cond); {2287#true} is VALID [2020-07-28 18:15:22,990 INFO L280 TraceCheckUtils]: 14: Hoare triple {2287#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2287#true} is VALID [2020-07-28 18:15:22,991 INFO L280 TraceCheckUtils]: 15: Hoare triple {2287#true} assume !(0 == __VERIFIER_assert_~cond); {2287#true} is VALID [2020-07-28 18:15:22,991 INFO L280 TraceCheckUtils]: 16: Hoare triple {2287#true} assume !!(main_~cp~0 != main_~urilen~0 - 1);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {2287#true} is VALID [2020-07-28 18:15:22,991 INFO L280 TraceCheckUtils]: 17: Hoare triple {2287#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {2287#true} is VALID [2020-07-28 18:15:22,991 INFO L280 TraceCheckUtils]: 18: Hoare triple {2287#true} __VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2287#true} is VALID [2020-07-28 18:15:22,991 INFO L280 TraceCheckUtils]: 19: Hoare triple {2287#true} assume !(0 == __VERIFIER_assert_~cond); {2287#true} is VALID [2020-07-28 18:15:22,992 INFO L280 TraceCheckUtils]: 20: Hoare triple {2287#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2287#true} is VALID [2020-07-28 18:15:22,992 INFO L280 TraceCheckUtils]: 21: Hoare triple {2287#true} assume !(0 == __VERIFIER_assert_~cond); {2287#true} is VALID [2020-07-28 18:15:22,992 INFO L280 TraceCheckUtils]: 22: Hoare triple {2287#true} assume !(main_~cp~0 == main_~urilen~0 - 1);__VERIFIER_assert_#in~cond := (if 1 + main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2287#true} is VALID [2020-07-28 18:15:22,992 INFO L280 TraceCheckUtils]: 23: Hoare triple {2287#true} assume !(0 == __VERIFIER_assert_~cond); {2287#true} is VALID [2020-07-28 18:15:22,992 INFO L280 TraceCheckUtils]: 24: Hoare triple {2287#true} __VERIFIER_assert_#in~cond := (if 0 <= 1 + main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2287#true} is VALID [2020-07-28 18:15:22,993 INFO L280 TraceCheckUtils]: 25: Hoare triple {2287#true} assume !(0 == __VERIFIER_assert_~cond); {2287#true} is VALID [2020-07-28 18:15:22,993 INFO L280 TraceCheckUtils]: 26: Hoare triple {2287#true} assume !(1 + main_~cp~0 == main_~urilen~0 - 1);main_#t~pre6 := 1 + main_~cp~0;main_~cp~0 := 1 + main_~cp~0;havoc main_#t~pre6;main_~scheme~0 := main_~cp~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2287#true} is VALID [2020-07-28 18:15:22,994 INFO L280 TraceCheckUtils]: 27: Hoare triple {2287#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~c~0 := 0;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2289#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:22,997 INFO L280 TraceCheckUtils]: 28: Hoare triple {2289#(= 0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {2289#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:22,998 INFO L280 TraceCheckUtils]: 29: Hoare triple {2289#(= 0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2289#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:22,999 INFO L280 TraceCheckUtils]: 30: Hoare triple {2289#(= 0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {2289#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:23,000 INFO L280 TraceCheckUtils]: 31: Hoare triple {2289#(= 0 ULTIMATE.start_main_~c~0)} assume !!(main_~cp~0 != main_~urilen~0 - 1 && main_~c~0 < main_~tokenlen~0 - 1);__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2289#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:23,000 INFO L280 TraceCheckUtils]: 32: Hoare triple {2289#(= 0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {2289#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:23,001 INFO L280 TraceCheckUtils]: 33: Hoare triple {2289#(= 0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2289#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:23,001 INFO L280 TraceCheckUtils]: 34: Hoare triple {2289#(= 0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {2289#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:23,002 INFO L280 TraceCheckUtils]: 35: Hoare triple {2289#(= 0 ULTIMATE.start_main_~c~0)} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {2289#(= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:23,003 INFO L280 TraceCheckUtils]: 36: Hoare triple {2289#(= 0 ULTIMATE.start_main_~c~0)} assume 0 != main_#t~nondet8;havoc main_#t~nondet8;main_#t~pre9 := 1 + main_~c~0;main_~c~0 := 1 + main_~c~0;havoc main_#t~pre9;__VERIFIER_assert_#in~cond := (if main_~c~0 < main_~tokenlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2290#(<= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:23,003 INFO L280 TraceCheckUtils]: 37: Hoare triple {2290#(<= 0 ULTIMATE.start_main_~c~0)} assume !(0 == __VERIFIER_assert_~cond); {2290#(<= 0 ULTIMATE.start_main_~c~0)} is VALID [2020-07-28 18:15:23,004 INFO L280 TraceCheckUtils]: 38: Hoare triple {2290#(<= 0 ULTIMATE.start_main_~c~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2291#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:23,006 INFO L280 TraceCheckUtils]: 39: Hoare triple {2291#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {2288#false} is VALID [2020-07-28 18:15:23,006 INFO L280 TraceCheckUtils]: 40: Hoare triple {2288#false} assume !false; {2288#false} is VALID [2020-07-28 18:15:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:15:23,008 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459008826] [2020-07-28 18:15:23,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:23,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 18:15:23,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179033643] [2020-07-28 18:15:23,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-28 18:15:23,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:23,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:15:23,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:23,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:15:23,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:23,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:15:23,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:23,055 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 5 states. [2020-07-28 18:15:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:23,330 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2020-07-28 18:15:23,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:15:23,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-07-28 18:15:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2020-07-28 18:15:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:15:23,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2020-07-28 18:15:23,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 63 transitions. [2020-07-28 18:15:23,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:23,403 INFO L225 Difference]: With dead ends: 61 [2020-07-28 18:15:23,403 INFO L226 Difference]: Without dead ends: 59 [2020-07-28 18:15:23,404 INFO L675 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 [2020-07-28 18:15:23,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-28 18:15:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-28 18:15:23,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:23,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-28 18:15:23,469 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-28 18:15:23,469 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-28 18:15:23,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:23,472 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-28 18:15:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-28 18:15:23,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:23,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:23,473 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-28 18:15:23,473 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-28 18:15:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:23,475 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2020-07-28 18:15:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-28 18:15:23,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:23,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:23,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:23,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:23,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-28 18:15:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2020-07-28 18:15:23,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 41 [2020-07-28 18:15:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:23,479 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2020-07-28 18:15:23,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:15:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-07-28 18:15:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-28 18:15:23,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:15:23,481 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:15:23,481 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-28 18:15:23,481 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:15:23,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:15:23,482 INFO L82 PathProgramCache]: Analyzing trace with hash -743371514, now seen corresponding path program 1 times [2020-07-28 18:15:23,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:15:23,482 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431089390] [2020-07-28 18:15:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:15:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:15:23,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {2580#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~pre5, main_#t~pre6, main_#t~nondet7, main_#t~nondet8, main_#t~pre9, main_#t~pre10, main_~scheme~0, main_~urilen~0, main_~tokenlen~0, main_~cp~0, main_~c~0;havoc main_~scheme~0;havoc main_~urilen~0;havoc main_~tokenlen~0;havoc main_~cp~0;havoc main_~c~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~urilen~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~tokenlen~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~scheme~0 := main_#t~nondet2;havoc main_#t~nondet2; {2580#true} is VALID [2020-07-28 18:15:23,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {2580#true} assume !!(main_~urilen~0 <= 1000000 && main_~urilen~0 >= -1000000); {2580#true} is VALID [2020-07-28 18:15:23,608 INFO L280 TraceCheckUtils]: 2: Hoare triple {2580#true} assume !!(main_~tokenlen~0 <= 1000000 && main_~tokenlen~0 >= -1000000); {2580#true} is VALID [2020-07-28 18:15:23,608 INFO L280 TraceCheckUtils]: 3: Hoare triple {2580#true} assume !!(main_~scheme~0 <= 1000000 && main_~scheme~0 >= -1000000); {2580#true} is VALID [2020-07-28 18:15:23,608 INFO L280 TraceCheckUtils]: 4: Hoare triple {2580#true} assume main_~urilen~0 > 0; {2580#true} is VALID [2020-07-28 18:15:23,609 INFO L280 TraceCheckUtils]: 5: Hoare triple {2580#true} assume main_~tokenlen~0 > 0; {2580#true} is VALID [2020-07-28 18:15:23,609 INFO L280 TraceCheckUtils]: 6: Hoare triple {2580#true} assume main_~scheme~0 >= 0; {2580#true} is VALID [2020-07-28 18:15:23,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {2580#true} assume !(0 == main_~scheme~0 || main_~urilen~0 - 1 < main_~scheme~0);main_~cp~0 := main_~scheme~0;__VERIFIER_assert_#in~cond := (if main_~cp~0 - 1 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,609 INFO L280 TraceCheckUtils]: 9: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 - 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,610 INFO L280 TraceCheckUtils]: 10: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,610 INFO L280 TraceCheckUtils]: 11: Hoare triple {2580#true} assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; {2580#true} is VALID [2020-07-28 18:15:23,610 INFO L280 TraceCheckUtils]: 12: Hoare triple {2580#true} assume 0 != main_#t~nondet3;havoc main_#t~nondet3;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,610 INFO L280 TraceCheckUtils]: 13: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,610 INFO L280 TraceCheckUtils]: 14: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,611 INFO L280 TraceCheckUtils]: 15: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,611 INFO L280 TraceCheckUtils]: 16: Hoare triple {2580#true} assume !!(main_~cp~0 != main_~urilen~0 - 1);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647; {2580#true} is VALID [2020-07-28 18:15:23,611 INFO L280 TraceCheckUtils]: 17: Hoare triple {2580#true} assume 0 != main_#t~nondet4;havoc main_#t~nondet4; {2580#true} is VALID [2020-07-28 18:15:23,612 INFO L280 TraceCheckUtils]: 18: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,612 INFO L280 TraceCheckUtils]: 19: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,612 INFO L280 TraceCheckUtils]: 20: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,612 INFO L280 TraceCheckUtils]: 21: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,612 INFO L280 TraceCheckUtils]: 22: Hoare triple {2580#true} assume !(main_~cp~0 == main_~urilen~0 - 1);__VERIFIER_assert_#in~cond := (if 1 + main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,613 INFO L280 TraceCheckUtils]: 23: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,613 INFO L280 TraceCheckUtils]: 24: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if 0 <= 1 + main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,613 INFO L280 TraceCheckUtils]: 25: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,613 INFO L280 TraceCheckUtils]: 26: Hoare triple {2580#true} assume !(1 + main_~cp~0 == main_~urilen~0 - 1);main_#t~pre6 := 1 + main_~cp~0;main_~cp~0 := 1 + main_~cp~0;havoc main_#t~pre6;main_~scheme~0 := main_~cp~0;assume -2147483648 <= main_#t~nondet7 && main_#t~nondet7 <= 2147483647; {2580#true} is VALID [2020-07-28 18:15:23,613 INFO L280 TraceCheckUtils]: 27: Hoare triple {2580#true} assume 0 != main_#t~nondet7;havoc main_#t~nondet7;main_~c~0 := 0;__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,614 INFO L280 TraceCheckUtils]: 28: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,614 INFO L280 TraceCheckUtils]: 29: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,614 INFO L280 TraceCheckUtils]: 30: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,615 INFO L280 TraceCheckUtils]: 31: Hoare triple {2580#true} assume !!(main_~cp~0 != main_~urilen~0 - 1 && main_~c~0 < main_~tokenlen~0 - 1);__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,615 INFO L280 TraceCheckUtils]: 32: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,615 INFO L280 TraceCheckUtils]: 33: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,616 INFO L280 TraceCheckUtils]: 34: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,616 INFO L280 TraceCheckUtils]: 35: Hoare triple {2580#true} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {2580#true} is VALID [2020-07-28 18:15:23,616 INFO L280 TraceCheckUtils]: 36: Hoare triple {2580#true} assume 0 != main_#t~nondet8;havoc main_#t~nondet8;main_#t~pre9 := 1 + main_~c~0;main_~c~0 := 1 + main_~c~0;havoc main_#t~pre9;__VERIFIER_assert_#in~cond := (if main_~c~0 < main_~tokenlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,616 INFO L280 TraceCheckUtils]: 37: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,617 INFO L280 TraceCheckUtils]: 38: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~c~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,617 INFO L280 TraceCheckUtils]: 39: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,617 INFO L280 TraceCheckUtils]: 40: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,618 INFO L280 TraceCheckUtils]: 41: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,618 INFO L280 TraceCheckUtils]: 42: Hoare triple {2580#true} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2580#true} is VALID [2020-07-28 18:15:23,618 INFO L280 TraceCheckUtils]: 43: Hoare triple {2580#true} assume !(0 == __VERIFIER_assert_~cond); {2580#true} is VALID [2020-07-28 18:15:23,619 INFO L280 TraceCheckUtils]: 44: Hoare triple {2580#true} main_#t~pre10 := 1 + main_~cp~0;main_~cp~0 := 1 + main_~cp~0;havoc main_#t~pre10; {2580#true} is VALID [2020-07-28 18:15:23,620 INFO L280 TraceCheckUtils]: 45: Hoare triple {2580#true} assume !!(main_~cp~0 != main_~urilen~0 - 1 && main_~c~0 < main_~tokenlen~0 - 1);__VERIFIER_assert_#in~cond := (if main_~cp~0 < main_~urilen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} is VALID [2020-07-28 18:15:23,621 INFO L280 TraceCheckUtils]: 46: Hoare triple {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} assume !(0 == __VERIFIER_assert_~cond); {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} is VALID [2020-07-28 18:15:23,622 INFO L280 TraceCheckUtils]: 47: Hoare triple {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} __VERIFIER_assert_#in~cond := (if 0 <= main_~cp~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} is VALID [2020-07-28 18:15:23,623 INFO L280 TraceCheckUtils]: 48: Hoare triple {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} assume !(0 == __VERIFIER_assert_~cond); {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} is VALID [2020-07-28 18:15:23,624 INFO L280 TraceCheckUtils]: 49: Hoare triple {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} assume -2147483648 <= main_#t~nondet8 && main_#t~nondet8 <= 2147483647; {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} is VALID [2020-07-28 18:15:23,625 INFO L280 TraceCheckUtils]: 50: Hoare triple {2582#(<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0)} assume 0 != main_#t~nondet8;havoc main_#t~nondet8;main_#t~pre9 := 1 + main_~c~0;main_~c~0 := 1 + main_~c~0;havoc main_#t~pre9;__VERIFIER_assert_#in~cond := (if main_~c~0 < main_~tokenlen~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2583#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2020-07-28 18:15:23,626 INFO L280 TraceCheckUtils]: 51: Hoare triple {2583#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume 0 == __VERIFIER_assert_~cond; {2581#false} is VALID [2020-07-28 18:15:23,626 INFO L280 TraceCheckUtils]: 52: Hoare triple {2581#false} assume !false; {2581#false} is VALID [2020-07-28 18:15:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:15:23,629 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431089390] [2020-07-28 18:15:23,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:15:23,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:15:23,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374012709] [2020-07-28 18:15:23,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-07-28 18:15:23,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:15:23,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:15:23,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:23,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:15:23,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:15:23,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:15:23,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:15:23,686 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 4 states. [2020-07-28 18:15:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:23,927 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2020-07-28 18:15:23,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:15:23,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-07-28 18:15:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:15:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:23,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-28 18:15:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:15:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2020-07-28 18:15:23,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2020-07-28 18:15:23,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:15:23,978 INFO L225 Difference]: With dead ends: 62 [2020-07-28 18:15:23,978 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:15:23,979 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:15:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:15:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:15:23,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:15:23,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:23,980 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:23,980 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:23,980 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:15:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:23,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:23,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:23,981 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:23,981 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:15:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:15:23,981 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:15:23,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:23,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:23,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:15:23,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:15:23,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:15:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:15:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:15:23,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2020-07-28 18:15:23,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:15:23,984 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:15:23,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:15:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:15:23,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:15:23,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-28 18:15:23,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:15:24,534 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,534 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,534 INFO L264 CegarLoopResult]: At program point L36-1(lines 6 41) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,535 INFO L268 CegarLoopResult]: For program point L36-2(lines 36 41) no Hoare annotation was computed. [2020-07-28 18:15:24,535 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:15:24,535 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-07-28 18:15:24,535 INFO L268 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2020-07-28 18:15:24,535 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,536 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-28 18:15:24,536 INFO L264 CegarLoopResult]: At program point L54-1(lines 6 66) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,536 INFO L271 CegarLoopResult]: At program point L71(lines 13 72) the Hoare annotation is: true [2020-07-28 18:15:24,536 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,536 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-28 18:15:24,536 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,536 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-28 18:15:24,536 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,537 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,537 INFO L268 CegarLoopResult]: For program point L7-3(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,537 INFO L264 CegarLoopResult]: At program point L7-5(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,537 INFO L268 CegarLoopResult]: For program point L7-6(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,537 INFO L264 CegarLoopResult]: At program point L7-8(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,537 INFO L268 CegarLoopResult]: For program point L7-9(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,538 INFO L268 CegarLoopResult]: For program point L7-12(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,538 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,538 INFO L264 CegarLoopResult]: At program point L7-14(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,538 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-28 18:15:24,538 INFO L268 CegarLoopResult]: For program point L7-15(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,538 INFO L268 CegarLoopResult]: For program point L24-1(lines 14 72) no Hoare annotation was computed. [2020-07-28 18:15:24,538 INFO L264 CegarLoopResult]: At program point L7-17(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,539 INFO L268 CegarLoopResult]: For program point L7-18(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,539 INFO L264 CegarLoopResult]: At program point L7-20(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,539 INFO L268 CegarLoopResult]: For program point L7-21(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,539 INFO L264 CegarLoopResult]: At program point L7-23(line 44) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,539 INFO L268 CegarLoopResult]: For program point L7-24(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,539 INFO L264 CegarLoopResult]: At program point L7-26(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,539 INFO L268 CegarLoopResult]: For program point L7-27(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,539 INFO L264 CegarLoopResult]: At program point L7-29(line 47) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,539 INFO L268 CegarLoopResult]: For program point L7-30(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,540 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,540 INFO L268 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,540 INFO L264 CegarLoopResult]: At program point L7-32(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,540 INFO L268 CegarLoopResult]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,540 INFO L268 CegarLoopResult]: For program point L7-33(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,540 INFO L268 CegarLoopResult]: For program point L8-3(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,540 INFO L268 CegarLoopResult]: For program point L8-4(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,540 INFO L268 CegarLoopResult]: For program point L8-5(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,541 INFO L268 CegarLoopResult]: For program point L7-36(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,541 INFO L268 CegarLoopResult]: For program point L8-6(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,541 INFO L268 CegarLoopResult]: For program point L8-7(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,541 INFO L264 CegarLoopResult]: At program point L7-38(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,541 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:15:24,541 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,541 INFO L268 CegarLoopResult]: For program point L8-8(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,541 INFO L268 CegarLoopResult]: For program point L7-39(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,541 INFO L268 CegarLoopResult]: For program point L8-9(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,541 INFO L268 CegarLoopResult]: For program point L8-10(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,542 INFO L264 CegarLoopResult]: At program point L7-41(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= (+ ULTIMATE.start_main_~c~0 2) ULTIMATE.start_main_~tokenlen~0) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,542 INFO L268 CegarLoopResult]: For program point L8-11(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,542 INFO L268 CegarLoopResult]: For program point L7-42(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,542 INFO L268 CegarLoopResult]: For program point L8-12(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,542 INFO L268 CegarLoopResult]: For program point L8-13(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,542 INFO L264 CegarLoopResult]: At program point L7-44(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,542 INFO L268 CegarLoopResult]: For program point L58(lines 58 64) no Hoare annotation was computed. [2020-07-28 18:15:24,542 INFO L268 CegarLoopResult]: For program point L8-14(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,543 INFO L268 CegarLoopResult]: For program point L7-45(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,543 INFO L268 CegarLoopResult]: For program point L25(lines 14 72) no Hoare annotation was computed. [2020-07-28 18:15:24,543 INFO L268 CegarLoopResult]: For program point L8-15(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,543 INFO L264 CegarLoopResult]: At program point L58-1(lines 58 64) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,543 INFO L264 CegarLoopResult]: At program point L7-47(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,543 INFO L268 CegarLoopResult]: For program point L8-16(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,544 INFO L268 CegarLoopResult]: For program point L7-48(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,544 INFO L268 CegarLoopResult]: For program point L8-17(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,544 INFO L264 CegarLoopResult]: At program point L7-50(lines 6 11) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~cp~0) (<= 0 ULTIMATE.start_main_~c~0) (< 0 (+ ULTIMATE.start_main_~scheme~0 1)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (< (+ ULTIMATE.start_main_~cp~0 1) ULTIMATE.start_main_~urilen~0)) [2020-07-28 18:15:24,544 INFO L268 CegarLoopResult]: For program point L7-51(lines 7 9) no Hoare annotation was computed. [2020-07-28 18:15:24,544 INFO L268 CegarLoopResult]: For program point L26(lines 14 72) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,545 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,546 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,546 INFO L268 CegarLoopResult]: For program point L33(lines 33 69) no Hoare annotation was computed. [2020-07-28 18:15:24,546 INFO L268 CegarLoopResult]: For program point L50(lines 50 68) no Hoare annotation was computed. [2020-07-28 18:15:24,546 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-28 18:15:24,552 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:15:24,552 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 18:15:24,552 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-28 18:15:24,552 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:15:24,552 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 18:15:24,553 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-28 18:15:24,553 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:15:24,553 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 18:15:24,553 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 18:15:24,553 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-28 18:15:24,553 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-28 18:15:24,553 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 18:15:24,553 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-28 18:15:24,553 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L7-3 has no Hoare annotation [2020-07-28 18:15:24,554 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L8-1 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L7-6 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L7-6 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L7-9 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L7-9 has no Hoare annotation [2020-07-28 18:15:24,555 WARN L170 areAnnotationChecker]: L7-9 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L8-3 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L8-3 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L7-18 has no Hoare annotation [2020-07-28 18:15:24,556 WARN L170 areAnnotationChecker]: L7-18 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L7-12 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L7-12 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L8-6 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L7-21 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L8-4 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L7-15 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L7-21 has no Hoare annotation [2020-07-28 18:15:24,557 WARN L170 areAnnotationChecker]: L7-21 has no Hoare annotation [2020-07-28 18:15:24,558 WARN L170 areAnnotationChecker]: L7-15 has no Hoare annotation [2020-07-28 18:15:24,558 WARN L170 areAnnotationChecker]: L7-15 has no Hoare annotation [2020-07-28 18:15:24,558 WARN L170 areAnnotationChecker]: L8-7 has no Hoare annotation [2020-07-28 18:15:24,558 WARN L170 areAnnotationChecker]: L8-7 has no Hoare annotation [2020-07-28 18:15:24,558 WARN L170 areAnnotationChecker]: L7-24 has no Hoare annotation [2020-07-28 18:15:24,558 WARN L170 areAnnotationChecker]: L8-5 has no Hoare annotation [2020-07-28 18:15:24,558 WARN L170 areAnnotationChecker]: L8-5 has no Hoare annotation [2020-07-28 18:15:24,564 WARN L170 areAnnotationChecker]: L7-24 has no Hoare annotation [2020-07-28 18:15:24,564 WARN L170 areAnnotationChecker]: L7-24 has no Hoare annotation [2020-07-28 18:15:24,565 WARN L170 areAnnotationChecker]: L8-8 has no Hoare annotation [2020-07-28 18:15:24,565 WARN L170 areAnnotationChecker]: L8-8 has no Hoare annotation [2020-07-28 18:15:24,565 WARN L170 areAnnotationChecker]: L7-27 has no Hoare annotation [2020-07-28 18:15:24,565 WARN L170 areAnnotationChecker]: L7-27 has no Hoare annotation [2020-07-28 18:15:24,565 WARN L170 areAnnotationChecker]: L7-27 has no Hoare annotation [2020-07-28 18:15:24,565 WARN L170 areAnnotationChecker]: L8-9 has no Hoare annotation [2020-07-28 18:15:24,565 WARN L170 areAnnotationChecker]: L8-9 has no Hoare annotation [2020-07-28 18:15:24,565 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 18:15:24,565 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 18:15:24,566 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 18:15:24,566 WARN L170 areAnnotationChecker]: L7-30 has no Hoare annotation [2020-07-28 18:15:24,566 WARN L170 areAnnotationChecker]: L7-30 has no Hoare annotation [2020-07-28 18:15:24,566 WARN L170 areAnnotationChecker]: L8-10 has no Hoare annotation [2020-07-28 18:15:24,566 WARN L170 areAnnotationChecker]: L8-10 has no Hoare annotation [2020-07-28 18:15:24,566 WARN L170 areAnnotationChecker]: L7-33 has no Hoare annotation [2020-07-28 18:15:24,566 WARN L170 areAnnotationChecker]: L7-33 has no Hoare annotation [2020-07-28 18:15:24,566 WARN L170 areAnnotationChecker]: L7-33 has no Hoare annotation [2020-07-28 18:15:24,566 WARN L170 areAnnotationChecker]: L8-11 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L8-11 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L7-36 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L7-36 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L7-36 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L8-12 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L8-12 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L7-39 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L7-39 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L7-39 has no Hoare annotation [2020-07-28 18:15:24,567 WARN L170 areAnnotationChecker]: L8-13 has no Hoare annotation [2020-07-28 18:15:24,568 WARN L170 areAnnotationChecker]: L8-13 has no Hoare annotation [2020-07-28 18:15:24,568 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 18:15:24,568 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 18:15:24,568 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 18:15:24,568 WARN L170 areAnnotationChecker]: L7-42 has no Hoare annotation [2020-07-28 18:15:24,568 WARN L170 areAnnotationChecker]: L7-42 has no Hoare annotation [2020-07-28 18:15:24,569 WARN L170 areAnnotationChecker]: L8-14 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L8-14 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L7-45 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L7-45 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L7-45 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L8-15 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L8-15 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L7-48 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L7-48 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L7-48 has no Hoare annotation [2020-07-28 18:15:24,570 WARN L170 areAnnotationChecker]: L8-16 has no Hoare annotation [2020-07-28 18:15:24,571 WARN L170 areAnnotationChecker]: L8-16 has no Hoare annotation [2020-07-28 18:15:24,571 WARN L170 areAnnotationChecker]: L7-51 has no Hoare annotation [2020-07-28 18:15:24,571 WARN L170 areAnnotationChecker]: L7-51 has no Hoare annotation [2020-07-28 18:15:24,571 WARN L170 areAnnotationChecker]: L7-51 has no Hoare annotation [2020-07-28 18:15:24,571 WARN L170 areAnnotationChecker]: L8-17 has no Hoare annotation [2020-07-28 18:15:24,571 WARN L170 areAnnotationChecker]: L8-17 has no Hoare annotation [2020-07-28 18:15:24,571 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:15:24,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:15:24 BoogieIcfgContainer [2020-07-28 18:15:24,594 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:15:24,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:15:24,594 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:15:24,594 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:15:24,595 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:15:17" (3/4) ... [2020-07-28 18:15:24,599 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:15:24,615 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2020-07-28 18:15:24,615 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:15:24,706 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:15:24,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:15:24,709 INFO L168 Benchmark]: Toolchain (without parser) took 8387.76 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.6 MB). Free memory was 954.9 MB in the beginning and 961.6 MB in the end (delta: -6.8 MB). Peak memory consumption was 275.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:24,709 INFO L168 Benchmark]: CDTParser took 0.97 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:15:24,710 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.96 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:24,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:24,710 INFO L168 Benchmark]: Boogie Preprocessor took 32.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:15:24,711 INFO L168 Benchmark]: RCFGBuilder took 640.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:24,711 INFO L168 Benchmark]: TraceAbstraction took 7170.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 970.5 MB in the end (delta: 115.1 MB). Peak memory consumption was 256.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:24,712 INFO L168 Benchmark]: Witness Printer took 111.82 ms. Allocated memory is still 1.3 GB. Free memory was 970.5 MB in the beginning and 961.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2020-07-28 18:15:24,714 INFO L336 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.97 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.96 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 133.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -186.9 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 640.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7170.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 141.6 MB). Free memory was 1.1 GB in the beginning and 970.5 MB in the end (delta: 115.1 MB). Peak memory consumption was 256.6 MB. Max. memory is 11.5 GB. * Witness Printer took 111.82 ms. Allocated memory is still 1.3 GB. Free memory was 970.5 MB in the beginning and 961.6 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((1 <= cp && 0 < scheme + 1) && 1 <= cond) && cp + 1 <= urilen - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((1 <= cp && !(0 == cond)) && 0 < scheme + 1) && cp + 1 <= urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((1 <= cp && !(0 == cond)) && 0 <= c) && 0 < scheme + 1) && cp + 1 < urilen - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((1 <= cp && 0 == c) && 0 < scheme + 1) && 1 <= cond) && cp + 1 < urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((1 <= cp && 0 < scheme + 1) && 1 <= cond) && cp + 1 <= urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((1 <= cp && !(0 == cond)) && 0 <= c) && 0 < scheme + 1) && c + 2 <= tokenlen) && cp + 1 < urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((1 <= cp && 0 < scheme + 1) && 1 <= cond) && cp + 1 <= urilen - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((1 <= cp && !(0 == cond)) && 0 < scheme + 1) && cp + 1 < urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((1 <= cp && 0 <= c) && 0 < scheme + 1) && 1 <= cond) && cp + 1 < urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((1 <= cp && 0 <= c) && !(0 == cond)) && 0 < scheme + 1) && cp + 1 <= urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((1 <= cp && !(0 == cond)) && 0 < scheme + 1) && cp + 1 < urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((((1 <= cp && 0 <= c) && 0 < scheme + 1) && c + 2 <= tokenlen) && 1 <= cond) && cp + 1 < urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((1 <= cp && !(0 == cond)) && 0 < scheme + 1) && cp + 1 <= urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((1 <= cp && 0 < scheme + 1) && 1 <= cond) && cp + 1 < urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: (((1 <= cp && !(0 == cond)) && 0 <= c) && 0 < scheme + 1) && cp + 1 < urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((1 <= cp && !(0 == cond)) && 0 < scheme + 1) && cp + 1 <= urilen - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: ((1 <= cp && 0 < scheme + 1) && 1 <= cond) && cp + 1 < urilen - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: (((1 <= cp && !(0 == cond)) && 0 <= c) && 0 < scheme + 1) && cp + 1 < urilen - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 89 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 423 SDtfs, 277 SDslu, 358 SDs, 0 SdLazy, 352 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 51 NumberOfFragments, 352 HoareAnnotationTreeSize, 20 FomulaSimplifications, 369 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 400 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 17434 SizeOfPredicates, 5 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 9/13 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...