/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 02:29:21,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 02:29:21,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 02:29:21,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 02:29:21,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 02:29:21,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 02:29:21,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 02:29:21,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 02:29:21,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 02:29:21,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 02:29:21,927 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 02:29:21,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 02:29:21,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 02:29:21,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 02:29:21,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 02:29:21,932 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 02:29:21,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 02:29:21,934 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 02:29:21,936 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 02:29:21,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 02:29:21,939 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 02:29:21,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 02:29:21,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 02:29:21,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 02:29:21,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 02:29:21,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 02:29:21,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 02:29:21,947 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 02:29:21,947 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 02:29:21,948 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 02:29:21,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 02:29:21,949 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 02:29:21,950 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 02:29:21,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 02:29:21,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 02:29:21,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 02:29:21,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 02:29:21,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 02:29:21,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 02:29:21,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 02:29:21,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 02:29:21,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 02:29:21,967 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 02:29:21,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 02:29:21,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 02:29:21,969 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 02:29:21,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 02:29:21,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 02:29:21,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 02:29:21,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 02:29:21,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 02:29:21,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 02:29:21,970 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 02:29:21,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 02:29:21,971 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 02:29:21,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 02:29:21,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 02:29:21,972 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 02:29:21,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 02:29:21,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 02:29:21,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 02:29:21,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 02:29:21,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 02:29:21,973 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 02:29:21,973 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 02:29:22,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 02:29:22,293 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 02:29:22,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 02:29:22,298 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 02:29:22,299 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 02:29:22,299 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-07-11 02:29:22,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f407d84/af64f5c9d0624b31b1f78fc97108211a/FLAGafcf3bea2 [2020-07-11 02:29:22,897 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 02:29:22,898 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-07-11 02:29:22,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f407d84/af64f5c9d0624b31b1f78fc97108211a/FLAGafcf3bea2 [2020-07-11 02:29:23,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37f407d84/af64f5c9d0624b31b1f78fc97108211a [2020-07-11 02:29:23,269 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 02:29:23,271 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 02:29:23,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 02:29:23,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 02:29:23,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 02:29:23,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:29:23" (1/1) ... [2020-07-11 02:29:23,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763d2390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23, skipping insertion in model container [2020-07-11 02:29:23,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 02:29:23" (1/1) ... [2020-07-11 02:29:23,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 02:29:23,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 02:29:23,560 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:29:23,566 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 02:29:23,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 02:29:23,611 INFO L208 MainTranslator]: Completed translation [2020-07-11 02:29:23,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23 WrapperNode [2020-07-11 02:29:23,612 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 02:29:23,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 02:29:23,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 02:29:23,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 02:29:23,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23" (1/1) ... [2020-07-11 02:29:23,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23" (1/1) ... [2020-07-11 02:29:23,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23" (1/1) ... [2020-07-11 02:29:23,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23" (1/1) ... [2020-07-11 02:29:23,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23" (1/1) ... [2020-07-11 02:29:23,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23" (1/1) ... [2020-07-11 02:29:23,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23" (1/1) ... [2020-07-11 02:29:23,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 02:29:23,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 02:29:23,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 02:29:23,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 02:29:23,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23" (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-11 02:29:23,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 02:29:23,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 02:29:23,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-11 02:29:23,833 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-11 02:29:23,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 02:29:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 02:29:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 02:29:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-11 02:29:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-11 02:29:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 02:29:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 02:29:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 02:29:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 02:29:24,459 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 02:29:24,460 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-11 02:29:24,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:29:24 BoogieIcfgContainer [2020-07-11 02:29:24,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 02:29:24,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 02:29:24,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 02:29:24,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 02:29:24,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 02:29:23" (1/3) ... [2020-07-11 02:29:24,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79504cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:29:24, skipping insertion in model container [2020-07-11 02:29:24,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 02:29:23" (2/3) ... [2020-07-11 02:29:24,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79504cbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 02:29:24, skipping insertion in model container [2020-07-11 02:29:24,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 02:29:24" (3/3) ... [2020-07-11 02:29:24,476 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-07-11 02:29:24,489 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 02:29:24,499 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 02:29:24,515 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 02:29:24,543 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 02:29:24,543 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 02:29:24,543 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 02:29:24,543 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 02:29:24,544 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 02:29:24,544 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 02:29:24,544 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 02:29:24,545 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 02:29:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-07-11 02:29:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-11 02:29:24,579 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:24,581 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] [2020-07-11 02:29:24,581 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:24,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:24,590 INFO L82 PathProgramCache]: Analyzing trace with hash 60896664, now seen corresponding path program 1 times [2020-07-11 02:29:24,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:24,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1872357605] [2020-07-11 02:29:24,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:24,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-11 02:29:24,901 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {95#true} {95#true} #180#return; {95#true} is VALID [2020-07-11 02:29:24,904 INFO L263 TraceCheckUtils]: 0: Hoare triple {95#true} call ULTIMATE.init(); {95#true} is VALID [2020-07-11 02:29:24,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-11 02:29:24,905 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} #180#return; {95#true} is VALID [2020-07-11 02:29:24,905 INFO L263 TraceCheckUtils]: 3: Hoare triple {95#true} call #t~ret11 := main(); {95#true} is VALID [2020-07-11 02:29:24,905 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} havoc ~scheme~0; {95#true} is VALID [2020-07-11 02:29:24,906 INFO L280 TraceCheckUtils]: 5: Hoare triple {95#true} havoc ~urilen~0; {95#true} is VALID [2020-07-11 02:29:24,906 INFO L280 TraceCheckUtils]: 6: Hoare triple {95#true} havoc ~tokenlen~0; {95#true} is VALID [2020-07-11 02:29:24,906 INFO L280 TraceCheckUtils]: 7: Hoare triple {95#true} havoc ~cp~0; {95#true} is VALID [2020-07-11 02:29:24,906 INFO L280 TraceCheckUtils]: 8: Hoare triple {95#true} havoc ~c~0; {95#true} is VALID [2020-07-11 02:29:24,907 INFO L280 TraceCheckUtils]: 9: Hoare triple {95#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {95#true} is VALID [2020-07-11 02:29:24,907 INFO L280 TraceCheckUtils]: 10: Hoare triple {95#true} ~urilen~0 := #t~nondet0; {95#true} is VALID [2020-07-11 02:29:24,907 INFO L280 TraceCheckUtils]: 11: Hoare triple {95#true} havoc #t~nondet0; {95#true} is VALID [2020-07-11 02:29:24,907 INFO L280 TraceCheckUtils]: 12: Hoare triple {95#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {95#true} is VALID [2020-07-11 02:29:24,908 INFO L280 TraceCheckUtils]: 13: Hoare triple {95#true} ~tokenlen~0 := #t~nondet1; {95#true} is VALID [2020-07-11 02:29:24,908 INFO L280 TraceCheckUtils]: 14: Hoare triple {95#true} havoc #t~nondet1; {95#true} is VALID [2020-07-11 02:29:24,908 INFO L280 TraceCheckUtils]: 15: Hoare triple {95#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {95#true} is VALID [2020-07-11 02:29:24,908 INFO L280 TraceCheckUtils]: 16: Hoare triple {95#true} ~scheme~0 := #t~nondet2; {95#true} is VALID [2020-07-11 02:29:24,909 INFO L280 TraceCheckUtils]: 17: Hoare triple {95#true} havoc #t~nondet2; {95#true} is VALID [2020-07-11 02:29:24,909 INFO L280 TraceCheckUtils]: 18: Hoare triple {95#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {95#true} is VALID [2020-07-11 02:29:24,909 INFO L280 TraceCheckUtils]: 19: Hoare triple {95#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {95#true} is VALID [2020-07-11 02:29:24,910 INFO L280 TraceCheckUtils]: 20: Hoare triple {95#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {95#true} is VALID [2020-07-11 02:29:24,910 INFO L280 TraceCheckUtils]: 21: Hoare triple {95#true} assume ~urilen~0 > 0; {95#true} is VALID [2020-07-11 02:29:24,910 INFO L280 TraceCheckUtils]: 22: Hoare triple {95#true} assume ~tokenlen~0 > 0; {95#true} is VALID [2020-07-11 02:29:24,911 INFO L280 TraceCheckUtils]: 23: Hoare triple {95#true} assume ~scheme~0 >= 0; {95#true} is VALID [2020-07-11 02:29:24,912 INFO L280 TraceCheckUtils]: 24: Hoare triple {95#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {99#(<= (+ main_~scheme~0 1) main_~urilen~0)} is VALID [2020-07-11 02:29:24,916 INFO L280 TraceCheckUtils]: 25: Hoare triple {99#(<= (+ main_~scheme~0 1) main_~urilen~0)} ~cp~0 := ~scheme~0; {100#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-11 02:29:24,918 INFO L263 TraceCheckUtils]: 26: Hoare triple {100#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {101#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:24,919 INFO L280 TraceCheckUtils]: 27: Hoare triple {101#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {102#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:24,920 INFO L280 TraceCheckUtils]: 28: Hoare triple {102#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {96#false} is VALID [2020-07-11 02:29:24,920 INFO L280 TraceCheckUtils]: 29: Hoare triple {96#false} assume !false; {96#false} is VALID [2020-07-11 02:29:24,924 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-11 02:29:24,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1872357605] [2020-07-11 02:29:24,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:24,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:29:24,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123088276] [2020-07-11 02:29:24,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-11 02:29:24,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:24,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:29:24,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:24,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:29:24,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:25,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:29:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:29:25,009 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 6 states. [2020-07-11 02:29:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:26,398 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2020-07-11 02:29:26,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:29:26,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-11 02:29:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:29:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2020-07-11 02:29:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:29:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2020-07-11 02:29:26,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 273 transitions. [2020-07-11 02:29:26,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:26,823 INFO L225 Difference]: With dead ends: 178 [2020-07-11 02:29:26,823 INFO L226 Difference]: Without dead ends: 103 [2020-07-11 02:29:26,829 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:29:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-11 02:29:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2020-07-11 02:29:26,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:26,979 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 93 states. [2020-07-11 02:29:26,980 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 93 states. [2020-07-11 02:29:26,980 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 93 states. [2020-07-11 02:29:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:26,991 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2020-07-11 02:29:26,991 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2020-07-11 02:29:26,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:26,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:26,994 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 103 states. [2020-07-11 02:29:26,995 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 103 states. [2020-07-11 02:29:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:27,003 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2020-07-11 02:29:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2020-07-11 02:29:27,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:27,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:27,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:27,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-11 02:29:27,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2020-07-11 02:29:27,016 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 30 [2020-07-11 02:29:27,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:27,017 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2020-07-11 02:29:27,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:29:27,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 116 transitions. [2020-07-11 02:29:27,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2020-07-11 02:29:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-11 02:29:27,189 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:27,189 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:29:27,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 02:29:27,190 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:27,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:27,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1464371663, now seen corresponding path program 1 times [2020-07-11 02:29:27,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:27,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [349391775] [2020-07-11 02:29:27,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:27,333 INFO L280 TraceCheckUtils]: 0: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-11 02:29:27,334 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {857#true} {857#true} #180#return; {857#true} is VALID [2020-07-11 02:29:27,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:27,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {857#true} ~cond := #in~cond; {857#true} is VALID [2020-07-11 02:29:27,353 INFO L280 TraceCheckUtils]: 1: Hoare triple {857#true} assume !(0 == ~cond); {857#true} is VALID [2020-07-11 02:29:27,353 INFO L280 TraceCheckUtils]: 2: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-11 02:29:27,355 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {857#true} {863#(<= 1 main_~cp~0)} #184#return; {863#(<= 1 main_~cp~0)} is VALID [2020-07-11 02:29:27,355 INFO L263 TraceCheckUtils]: 0: Hoare triple {857#true} call ULTIMATE.init(); {857#true} is VALID [2020-07-11 02:29:27,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-11 02:29:27,356 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {857#true} {857#true} #180#return; {857#true} is VALID [2020-07-11 02:29:27,356 INFO L263 TraceCheckUtils]: 3: Hoare triple {857#true} call #t~ret11 := main(); {857#true} is VALID [2020-07-11 02:29:27,356 INFO L280 TraceCheckUtils]: 4: Hoare triple {857#true} havoc ~scheme~0; {857#true} is VALID [2020-07-11 02:29:27,357 INFO L280 TraceCheckUtils]: 5: Hoare triple {857#true} havoc ~urilen~0; {857#true} is VALID [2020-07-11 02:29:27,357 INFO L280 TraceCheckUtils]: 6: Hoare triple {857#true} havoc ~tokenlen~0; {857#true} is VALID [2020-07-11 02:29:27,357 INFO L280 TraceCheckUtils]: 7: Hoare triple {857#true} havoc ~cp~0; {857#true} is VALID [2020-07-11 02:29:27,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {857#true} havoc ~c~0; {857#true} is VALID [2020-07-11 02:29:27,358 INFO L280 TraceCheckUtils]: 9: Hoare triple {857#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {857#true} is VALID [2020-07-11 02:29:27,358 INFO L280 TraceCheckUtils]: 10: Hoare triple {857#true} ~urilen~0 := #t~nondet0; {857#true} is VALID [2020-07-11 02:29:27,358 INFO L280 TraceCheckUtils]: 11: Hoare triple {857#true} havoc #t~nondet0; {857#true} is VALID [2020-07-11 02:29:27,358 INFO L280 TraceCheckUtils]: 12: Hoare triple {857#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {857#true} is VALID [2020-07-11 02:29:27,359 INFO L280 TraceCheckUtils]: 13: Hoare triple {857#true} ~tokenlen~0 := #t~nondet1; {857#true} is VALID [2020-07-11 02:29:27,359 INFO L280 TraceCheckUtils]: 14: Hoare triple {857#true} havoc #t~nondet1; {857#true} is VALID [2020-07-11 02:29:27,359 INFO L280 TraceCheckUtils]: 15: Hoare triple {857#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {857#true} is VALID [2020-07-11 02:29:27,360 INFO L280 TraceCheckUtils]: 16: Hoare triple {857#true} ~scheme~0 := #t~nondet2; {857#true} is VALID [2020-07-11 02:29:27,360 INFO L280 TraceCheckUtils]: 17: Hoare triple {857#true} havoc #t~nondet2; {857#true} is VALID [2020-07-11 02:29:27,360 INFO L280 TraceCheckUtils]: 18: Hoare triple {857#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {857#true} is VALID [2020-07-11 02:29:27,361 INFO L280 TraceCheckUtils]: 19: Hoare triple {857#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {857#true} is VALID [2020-07-11 02:29:27,361 INFO L280 TraceCheckUtils]: 20: Hoare triple {857#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {857#true} is VALID [2020-07-11 02:29:27,361 INFO L280 TraceCheckUtils]: 21: Hoare triple {857#true} assume ~urilen~0 > 0; {857#true} is VALID [2020-07-11 02:29:27,361 INFO L280 TraceCheckUtils]: 22: Hoare triple {857#true} assume ~tokenlen~0 > 0; {857#true} is VALID [2020-07-11 02:29:27,364 INFO L280 TraceCheckUtils]: 23: Hoare triple {857#true} assume ~scheme~0 >= 0; {861#(< 0 (+ main_~scheme~0 1))} is VALID [2020-07-11 02:29:27,367 INFO L280 TraceCheckUtils]: 24: Hoare triple {861#(< 0 (+ main_~scheme~0 1))} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {862#(< 0 main_~scheme~0)} is VALID [2020-07-11 02:29:27,368 INFO L280 TraceCheckUtils]: 25: Hoare triple {862#(< 0 main_~scheme~0)} ~cp~0 := ~scheme~0; {863#(<= 1 main_~cp~0)} is VALID [2020-07-11 02:29:27,368 INFO L263 TraceCheckUtils]: 26: Hoare triple {863#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {857#true} is VALID [2020-07-11 02:29:27,368 INFO L280 TraceCheckUtils]: 27: Hoare triple {857#true} ~cond := #in~cond; {857#true} is VALID [2020-07-11 02:29:27,369 INFO L280 TraceCheckUtils]: 28: Hoare triple {857#true} assume !(0 == ~cond); {857#true} is VALID [2020-07-11 02:29:27,369 INFO L280 TraceCheckUtils]: 29: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-11 02:29:27,370 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {857#true} {863#(<= 1 main_~cp~0)} #184#return; {863#(<= 1 main_~cp~0)} is VALID [2020-07-11 02:29:27,370 INFO L263 TraceCheckUtils]: 31: Hoare triple {863#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {868#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:27,371 INFO L280 TraceCheckUtils]: 32: Hoare triple {868#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {869#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:27,372 INFO L280 TraceCheckUtils]: 33: Hoare triple {869#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {858#false} is VALID [2020-07-11 02:29:27,372 INFO L280 TraceCheckUtils]: 34: Hoare triple {858#false} assume !false; {858#false} is VALID [2020-07-11 02:29:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 02:29:27,375 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [349391775] [2020-07-11 02:29:27,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:27,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:29:27,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748981216] [2020-07-11 02:29:27,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-11 02:29:27,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:27,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:29:27,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:27,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:29:27,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:27,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:29:27,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:29:27,411 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 7 states. [2020-07-11 02:29:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:28,341 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2020-07-11 02:29:28,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:29:28,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-11 02:29:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-11 02:29:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-11 02:29:28,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2020-07-11 02:29:28,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:28,489 INFO L225 Difference]: With dead ends: 99 [2020-07-11 02:29:28,489 INFO L226 Difference]: Without dead ends: 97 [2020-07-11 02:29:28,493 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-11 02:29:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-11 02:29:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-07-11 02:29:28,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:28,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:28,631 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:28,631 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:28,638 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2020-07-11 02:29:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-07-11 02:29:28,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:28,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:28,641 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:28,641 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:28,648 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2020-07-11 02:29:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-07-11 02:29:28,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:28,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:28,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:28,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-11 02:29:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2020-07-11 02:29:28,655 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 35 [2020-07-11 02:29:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:28,656 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2020-07-11 02:29:28,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:29:28,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 119 transitions. [2020-07-11 02:29:28,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-07-11 02:29:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-11 02:29:28,822 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:28,823 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:29:28,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 02:29:28,823 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:28,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1188311592, now seen corresponding path program 1 times [2020-07-11 02:29:28,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:28,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [83927962] [2020-07-11 02:29:28,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:28,945 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,945 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1462#true} {1462#true} #180#return; {1462#true} is VALID [2020-07-11 02:29:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:28,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,950 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,951 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #184#return; {1462#true} is VALID [2020-07-11 02:29:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:28,955 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,956 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,956 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,956 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #186#return; {1462#true} is VALID [2020-07-11 02:29:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:28,961 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,962 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #188#return; {1462#true} is VALID [2020-07-11 02:29:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:28,967 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,967 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,968 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,968 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #190#return; {1462#true} is VALID [2020-07-11 02:29:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:28,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,976 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,977 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #196#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-11 02:29:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:28,984 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,984 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,984 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,985 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #198#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-11 02:29:28,986 INFO L263 TraceCheckUtils]: 0: Hoare triple {1462#true} call ULTIMATE.init(); {1462#true} is VALID [2020-07-11 02:29:28,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,986 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1462#true} {1462#true} #180#return; {1462#true} is VALID [2020-07-11 02:29:28,986 INFO L263 TraceCheckUtils]: 3: Hoare triple {1462#true} call #t~ret11 := main(); {1462#true} is VALID [2020-07-11 02:29:28,987 INFO L280 TraceCheckUtils]: 4: Hoare triple {1462#true} havoc ~scheme~0; {1462#true} is VALID [2020-07-11 02:29:28,987 INFO L280 TraceCheckUtils]: 5: Hoare triple {1462#true} havoc ~urilen~0; {1462#true} is VALID [2020-07-11 02:29:28,987 INFO L280 TraceCheckUtils]: 6: Hoare triple {1462#true} havoc ~tokenlen~0; {1462#true} is VALID [2020-07-11 02:29:28,987 INFO L280 TraceCheckUtils]: 7: Hoare triple {1462#true} havoc ~cp~0; {1462#true} is VALID [2020-07-11 02:29:28,988 INFO L280 TraceCheckUtils]: 8: Hoare triple {1462#true} havoc ~c~0; {1462#true} is VALID [2020-07-11 02:29:28,988 INFO L280 TraceCheckUtils]: 9: Hoare triple {1462#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1462#true} is VALID [2020-07-11 02:29:28,988 INFO L280 TraceCheckUtils]: 10: Hoare triple {1462#true} ~urilen~0 := #t~nondet0; {1462#true} is VALID [2020-07-11 02:29:28,988 INFO L280 TraceCheckUtils]: 11: Hoare triple {1462#true} havoc #t~nondet0; {1462#true} is VALID [2020-07-11 02:29:28,989 INFO L280 TraceCheckUtils]: 12: Hoare triple {1462#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1462#true} is VALID [2020-07-11 02:29:28,989 INFO L280 TraceCheckUtils]: 13: Hoare triple {1462#true} ~tokenlen~0 := #t~nondet1; {1462#true} is VALID [2020-07-11 02:29:28,989 INFO L280 TraceCheckUtils]: 14: Hoare triple {1462#true} havoc #t~nondet1; {1462#true} is VALID [2020-07-11 02:29:28,990 INFO L280 TraceCheckUtils]: 15: Hoare triple {1462#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1462#true} is VALID [2020-07-11 02:29:28,990 INFO L280 TraceCheckUtils]: 16: Hoare triple {1462#true} ~scheme~0 := #t~nondet2; {1462#true} is VALID [2020-07-11 02:29:28,990 INFO L280 TraceCheckUtils]: 17: Hoare triple {1462#true} havoc #t~nondet2; {1462#true} is VALID [2020-07-11 02:29:28,990 INFO L280 TraceCheckUtils]: 18: Hoare triple {1462#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1462#true} is VALID [2020-07-11 02:29:28,991 INFO L280 TraceCheckUtils]: 19: Hoare triple {1462#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1462#true} is VALID [2020-07-11 02:29:28,991 INFO L280 TraceCheckUtils]: 20: Hoare triple {1462#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1462#true} is VALID [2020-07-11 02:29:28,991 INFO L280 TraceCheckUtils]: 21: Hoare triple {1462#true} assume ~urilen~0 > 0; {1462#true} is VALID [2020-07-11 02:29:28,991 INFO L280 TraceCheckUtils]: 22: Hoare triple {1462#true} assume ~tokenlen~0 > 0; {1462#true} is VALID [2020-07-11 02:29:28,992 INFO L280 TraceCheckUtils]: 23: Hoare triple {1462#true} assume ~scheme~0 >= 0; {1462#true} is VALID [2020-07-11 02:29:28,992 INFO L280 TraceCheckUtils]: 24: Hoare triple {1462#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {1462#true} is VALID [2020-07-11 02:29:28,992 INFO L280 TraceCheckUtils]: 25: Hoare triple {1462#true} ~cp~0 := ~scheme~0; {1462#true} is VALID [2020-07-11 02:29:28,992 INFO L263 TraceCheckUtils]: 26: Hoare triple {1462#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1462#true} is VALID [2020-07-11 02:29:28,993 INFO L280 TraceCheckUtils]: 27: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,993 INFO L280 TraceCheckUtils]: 28: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,993 INFO L280 TraceCheckUtils]: 29: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,994 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1462#true} {1462#true} #184#return; {1462#true} is VALID [2020-07-11 02:29:28,994 INFO L263 TraceCheckUtils]: 31: Hoare triple {1462#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1462#true} is VALID [2020-07-11 02:29:28,994 INFO L280 TraceCheckUtils]: 32: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,994 INFO L280 TraceCheckUtils]: 33: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,995 INFO L280 TraceCheckUtils]: 34: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,995 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1462#true} {1462#true} #186#return; {1462#true} is VALID [2020-07-11 02:29:28,995 INFO L280 TraceCheckUtils]: 36: Hoare triple {1462#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1462#true} is VALID [2020-07-11 02:29:28,995 INFO L280 TraceCheckUtils]: 37: Hoare triple {1462#true} assume 0 != #t~nondet3; {1462#true} is VALID [2020-07-11 02:29:28,995 INFO L280 TraceCheckUtils]: 38: Hoare triple {1462#true} havoc #t~nondet3; {1462#true} is VALID [2020-07-11 02:29:28,996 INFO L263 TraceCheckUtils]: 39: Hoare triple {1462#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1462#true} is VALID [2020-07-11 02:29:28,996 INFO L280 TraceCheckUtils]: 40: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,996 INFO L280 TraceCheckUtils]: 41: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,996 INFO L280 TraceCheckUtils]: 42: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,996 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1462#true} {1462#true} #188#return; {1462#true} is VALID [2020-07-11 02:29:28,997 INFO L263 TraceCheckUtils]: 44: Hoare triple {1462#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1462#true} is VALID [2020-07-11 02:29:28,997 INFO L280 TraceCheckUtils]: 45: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,997 INFO L280 TraceCheckUtils]: 46: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:28,997 INFO L280 TraceCheckUtils]: 47: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:28,998 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1462#true} {1462#true} #190#return; {1462#true} is VALID [2020-07-11 02:29:28,998 INFO L280 TraceCheckUtils]: 49: Hoare triple {1462#true} assume !(~cp~0 != ~urilen~0 - 1); {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-11 02:29:28,999 INFO L263 TraceCheckUtils]: 50: Hoare triple {1482#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1462#true} is VALID [2020-07-11 02:29:28,999 INFO L280 TraceCheckUtils]: 51: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:28,999 INFO L280 TraceCheckUtils]: 52: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:29,000 INFO L280 TraceCheckUtils]: 53: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:29,000 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #196#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-11 02:29:29,001 INFO L263 TraceCheckUtils]: 55: Hoare triple {1482#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1462#true} is VALID [2020-07-11 02:29:29,001 INFO L280 TraceCheckUtils]: 56: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-11 02:29:29,001 INFO L280 TraceCheckUtils]: 57: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-11 02:29:29,002 INFO L280 TraceCheckUtils]: 58: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-11 02:29:29,002 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #198#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-11 02:29:29,003 INFO L280 TraceCheckUtils]: 60: Hoare triple {1482#(= (+ main_~cp~0 1) main_~urilen~0)} assume !(~cp~0 == ~urilen~0 - 1); {1463#false} is VALID [2020-07-11 02:29:29,003 INFO L263 TraceCheckUtils]: 61: Hoare triple {1463#false} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1463#false} is VALID [2020-07-11 02:29:29,003 INFO L280 TraceCheckUtils]: 62: Hoare triple {1463#false} ~cond := #in~cond; {1463#false} is VALID [2020-07-11 02:29:29,004 INFO L280 TraceCheckUtils]: 63: Hoare triple {1463#false} assume 0 == ~cond; {1463#false} is VALID [2020-07-11 02:29:29,004 INFO L280 TraceCheckUtils]: 64: Hoare triple {1463#false} assume !false; {1463#false} is VALID [2020-07-11 02:29:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-11 02:29:29,011 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [83927962] [2020-07-11 02:29:29,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:29,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 02:29:29,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674596554] [2020-07-11 02:29:29,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-11 02:29:29,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:29,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 02:29:29,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:29,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 02:29:29,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:29,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 02:29:29,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 02:29:29,068 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 3 states. [2020-07-11 02:29:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:29,420 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2020-07-11 02:29:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 02:29:29,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-11 02:29:29,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:29:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-11 02:29:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 02:29:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-11 02:29:29,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2020-07-11 02:29:29,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:29,601 INFO L225 Difference]: With dead ends: 140 [2020-07-11 02:29:29,601 INFO L226 Difference]: Without dead ends: 97 [2020-07-11 02:29:29,603 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-11 02:29:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-11 02:29:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-07-11 02:29:29,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:29,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:29,759 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:29,759 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:29,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:29,765 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2020-07-11 02:29:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-07-11 02:29:29,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:29,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:29,767 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:29,767 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-11 02:29:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:29,773 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2020-07-11 02:29:29,773 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-07-11 02:29:29,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:29,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:29,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:29,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-11 02:29:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2020-07-11 02:29:29,779 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 65 [2020-07-11 02:29:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:29,780 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2020-07-11 02:29:29,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 02:29:29,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 117 transitions. [2020-07-11 02:29:29,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-07-11 02:29:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-11 02:29:29,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:29,934 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 02:29:29,934 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 02:29:29,934 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:29,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:29,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2082475577, now seen corresponding path program 1 times [2020-07-11 02:29:29,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:29,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1791862372] [2020-07-11 02:29:29,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:30,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,118 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2161#true} {2161#true} #180#return; {2161#true} is VALID [2020-07-11 02:29:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:30,127 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,128 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,128 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,129 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #184#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:30,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,138 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,138 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,139 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #186#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:30,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,153 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,154 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #188#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:30,160 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,161 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,170 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #190#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:30,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,198 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #196#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-11 02:29:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:30,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,206 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #198#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-11 02:29:30,207 INFO L263 TraceCheckUtils]: 0: Hoare triple {2161#true} call ULTIMATE.init(); {2161#true} is VALID [2020-07-11 02:29:30,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,207 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2161#true} {2161#true} #180#return; {2161#true} is VALID [2020-07-11 02:29:30,208 INFO L263 TraceCheckUtils]: 3: Hoare triple {2161#true} call #t~ret11 := main(); {2161#true} is VALID [2020-07-11 02:29:30,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {2161#true} havoc ~scheme~0; {2161#true} is VALID [2020-07-11 02:29:30,208 INFO L280 TraceCheckUtils]: 5: Hoare triple {2161#true} havoc ~urilen~0; {2161#true} is VALID [2020-07-11 02:29:30,208 INFO L280 TraceCheckUtils]: 6: Hoare triple {2161#true} havoc ~tokenlen~0; {2161#true} is VALID [2020-07-11 02:29:30,209 INFO L280 TraceCheckUtils]: 7: Hoare triple {2161#true} havoc ~cp~0; {2161#true} is VALID [2020-07-11 02:29:30,209 INFO L280 TraceCheckUtils]: 8: Hoare triple {2161#true} havoc ~c~0; {2161#true} is VALID [2020-07-11 02:29:30,209 INFO L280 TraceCheckUtils]: 9: Hoare triple {2161#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2161#true} is VALID [2020-07-11 02:29:30,209 INFO L280 TraceCheckUtils]: 10: Hoare triple {2161#true} ~urilen~0 := #t~nondet0; {2161#true} is VALID [2020-07-11 02:29:30,210 INFO L280 TraceCheckUtils]: 11: Hoare triple {2161#true} havoc #t~nondet0; {2161#true} is VALID [2020-07-11 02:29:30,210 INFO L280 TraceCheckUtils]: 12: Hoare triple {2161#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2161#true} is VALID [2020-07-11 02:29:30,210 INFO L280 TraceCheckUtils]: 13: Hoare triple {2161#true} ~tokenlen~0 := #t~nondet1; {2161#true} is VALID [2020-07-11 02:29:30,210 INFO L280 TraceCheckUtils]: 14: Hoare triple {2161#true} havoc #t~nondet1; {2161#true} is VALID [2020-07-11 02:29:30,211 INFO L280 TraceCheckUtils]: 15: Hoare triple {2161#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2161#true} is VALID [2020-07-11 02:29:30,211 INFO L280 TraceCheckUtils]: 16: Hoare triple {2161#true} ~scheme~0 := #t~nondet2; {2161#true} is VALID [2020-07-11 02:29:30,211 INFO L280 TraceCheckUtils]: 17: Hoare triple {2161#true} havoc #t~nondet2; {2161#true} is VALID [2020-07-11 02:29:30,211 INFO L280 TraceCheckUtils]: 18: Hoare triple {2161#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2161#true} is VALID [2020-07-11 02:29:30,212 INFO L280 TraceCheckUtils]: 19: Hoare triple {2161#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2161#true} is VALID [2020-07-11 02:29:30,212 INFO L280 TraceCheckUtils]: 20: Hoare triple {2161#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2161#true} is VALID [2020-07-11 02:29:30,212 INFO L280 TraceCheckUtils]: 21: Hoare triple {2161#true} assume ~urilen~0 > 0; {2161#true} is VALID [2020-07-11 02:29:30,212 INFO L280 TraceCheckUtils]: 22: Hoare triple {2161#true} assume ~tokenlen~0 > 0; {2161#true} is VALID [2020-07-11 02:29:30,213 INFO L280 TraceCheckUtils]: 23: Hoare triple {2161#true} assume ~scheme~0 >= 0; {2161#true} is VALID [2020-07-11 02:29:30,213 INFO L280 TraceCheckUtils]: 24: Hoare triple {2161#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {2165#(<= (+ main_~scheme~0 1) main_~urilen~0)} is VALID [2020-07-11 02:29:30,214 INFO L280 TraceCheckUtils]: 25: Hoare triple {2165#(<= (+ main_~scheme~0 1) main_~urilen~0)} ~cp~0 := ~scheme~0; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,214 INFO L263 TraceCheckUtils]: 26: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2161#true} is VALID [2020-07-11 02:29:30,214 INFO L280 TraceCheckUtils]: 27: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,215 INFO L280 TraceCheckUtils]: 28: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,215 INFO L280 TraceCheckUtils]: 29: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,216 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #184#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,216 INFO L263 TraceCheckUtils]: 31: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2161#true} is VALID [2020-07-11 02:29:30,216 INFO L280 TraceCheckUtils]: 32: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,216 INFO L280 TraceCheckUtils]: 33: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,216 INFO L280 TraceCheckUtils]: 34: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,217 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #186#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,218 INFO L280 TraceCheckUtils]: 36: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,218 INFO L280 TraceCheckUtils]: 37: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} assume 0 != #t~nondet3; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,219 INFO L280 TraceCheckUtils]: 38: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} havoc #t~nondet3; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,219 INFO L263 TraceCheckUtils]: 39: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2161#true} is VALID [2020-07-11 02:29:30,219 INFO L280 TraceCheckUtils]: 40: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,220 INFO L280 TraceCheckUtils]: 41: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,220 INFO L280 TraceCheckUtils]: 42: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,221 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #188#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,221 INFO L263 TraceCheckUtils]: 44: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2161#true} is VALID [2020-07-11 02:29:30,221 INFO L280 TraceCheckUtils]: 45: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,221 INFO L280 TraceCheckUtils]: 46: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,221 INFO L280 TraceCheckUtils]: 47: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,222 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #190#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-11 02:29:30,223 INFO L280 TraceCheckUtils]: 49: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1); {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-11 02:29:30,224 INFO L280 TraceCheckUtils]: 50: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-11 02:29:30,224 INFO L280 TraceCheckUtils]: 51: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume 0 != #t~nondet4; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-11 02:29:30,225 INFO L280 TraceCheckUtils]: 52: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} havoc #t~nondet4; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-11 02:29:30,225 INFO L263 TraceCheckUtils]: 53: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2161#true} is VALID [2020-07-11 02:29:30,226 INFO L280 TraceCheckUtils]: 54: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,226 INFO L280 TraceCheckUtils]: 55: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,226 INFO L280 TraceCheckUtils]: 56: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,227 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #196#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-11 02:29:30,228 INFO L263 TraceCheckUtils]: 58: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2161#true} is VALID [2020-07-11 02:29:30,228 INFO L280 TraceCheckUtils]: 59: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-11 02:29:30,228 INFO L280 TraceCheckUtils]: 60: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-11 02:29:30,228 INFO L280 TraceCheckUtils]: 61: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-11 02:29:30,229 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #198#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-11 02:29:30,231 INFO L280 TraceCheckUtils]: 63: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume !(~cp~0 == ~urilen~0 - 1); {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-11 02:29:30,234 INFO L263 TraceCheckUtils]: 64: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2192#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:30,237 INFO L280 TraceCheckUtils]: 65: Hoare triple {2192#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2193#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:30,238 INFO L280 TraceCheckUtils]: 66: Hoare triple {2193#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2162#false} is VALID [2020-07-11 02:29:30,239 INFO L280 TraceCheckUtils]: 67: Hoare triple {2162#false} assume !false; {2162#false} is VALID [2020-07-11 02:29:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-11 02:29:30,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1791862372] [2020-07-11 02:29:30,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:30,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:29:30,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159530221] [2020-07-11 02:29:30,247 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-07-11 02:29:30,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:30,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:29:30,328 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-11 02:29:30,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:29:30,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:29:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:29:30,329 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 7 states. [2020-07-11 02:29:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:31,290 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2020-07-11 02:29:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:29:31,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-07-11 02:29:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:31,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2020-07-11 02:29:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:31,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2020-07-11 02:29:31,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 106 transitions. [2020-07-11 02:29:31,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:31,460 INFO L225 Difference]: With dead ends: 103 [2020-07-11 02:29:31,460 INFO L226 Difference]: Without dead ends: 101 [2020-07-11 02:29:31,461 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-11 02:29:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-11 02:29:31,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-07-11 02:29:31,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:31,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2020-07-11 02:29:31,652 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2020-07-11 02:29:31,653 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2020-07-11 02:29:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:31,658 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2020-07-11 02:29:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-07-11 02:29:31,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:31,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:31,660 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2020-07-11 02:29:31,660 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2020-07-11 02:29:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:31,665 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2020-07-11 02:29:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-07-11 02:29:31,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:31,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:31,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:31,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-11 02:29:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2020-07-11 02:29:31,671 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 68 [2020-07-11 02:29:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:31,672 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2020-07-11 02:29:31,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:29:31,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 101 states and 120 transitions. [2020-07-11 02:29:31,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-07-11 02:29:31,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-07-11 02:29:31,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:31,838 INFO L422 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:29:31,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 02:29:31,838 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:31,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1342891699, now seen corresponding path program 1 times [2020-07-11 02:29:31,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:31,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [174603794] [2020-07-11 02:29:31,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,001 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,001 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2812#true} {2812#true} #180#return; {2812#true} is VALID [2020-07-11 02:29:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,009 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,009 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,009 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #184#return; {2812#true} is VALID [2020-07-11 02:29:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,016 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,016 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #186#return; {2812#true} is VALID [2020-07-11 02:29:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,027 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #188#return; {2812#true} is VALID [2020-07-11 02:29:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,040 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,041 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #190#return; {2812#true} is VALID [2020-07-11 02:29:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,047 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,048 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,048 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #196#return; {2812#true} is VALID [2020-07-11 02:29:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,054 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,054 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,055 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #198#return; {2812#true} is VALID [2020-07-11 02:29:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,060 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,060 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,060 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,061 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #200#return; {2812#true} is VALID [2020-07-11 02:29:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,066 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #202#return; {2812#true} is VALID [2020-07-11 02:29:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,079 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,080 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,081 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #204#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,091 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,092 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,092 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,093 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #206#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,109 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #208#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-11 02:29:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:32,117 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,117 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,117 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,118 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #210#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-11 02:29:32,119 INFO L263 TraceCheckUtils]: 0: Hoare triple {2812#true} call ULTIMATE.init(); {2812#true} is VALID [2020-07-11 02:29:32,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,119 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2812#true} {2812#true} #180#return; {2812#true} is VALID [2020-07-11 02:29:32,120 INFO L263 TraceCheckUtils]: 3: Hoare triple {2812#true} call #t~ret11 := main(); {2812#true} is VALID [2020-07-11 02:29:32,120 INFO L280 TraceCheckUtils]: 4: Hoare triple {2812#true} havoc ~scheme~0; {2812#true} is VALID [2020-07-11 02:29:32,120 INFO L280 TraceCheckUtils]: 5: Hoare triple {2812#true} havoc ~urilen~0; {2812#true} is VALID [2020-07-11 02:29:32,124 INFO L280 TraceCheckUtils]: 6: Hoare triple {2812#true} havoc ~tokenlen~0; {2812#true} is VALID [2020-07-11 02:29:32,124 INFO L280 TraceCheckUtils]: 7: Hoare triple {2812#true} havoc ~cp~0; {2812#true} is VALID [2020-07-11 02:29:32,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {2812#true} havoc ~c~0; {2812#true} is VALID [2020-07-11 02:29:32,124 INFO L280 TraceCheckUtils]: 9: Hoare triple {2812#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2812#true} is VALID [2020-07-11 02:29:32,125 INFO L280 TraceCheckUtils]: 10: Hoare triple {2812#true} ~urilen~0 := #t~nondet0; {2812#true} is VALID [2020-07-11 02:29:32,125 INFO L280 TraceCheckUtils]: 11: Hoare triple {2812#true} havoc #t~nondet0; {2812#true} is VALID [2020-07-11 02:29:32,125 INFO L280 TraceCheckUtils]: 12: Hoare triple {2812#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2812#true} is VALID [2020-07-11 02:29:32,125 INFO L280 TraceCheckUtils]: 13: Hoare triple {2812#true} ~tokenlen~0 := #t~nondet1; {2812#true} is VALID [2020-07-11 02:29:32,126 INFO L280 TraceCheckUtils]: 14: Hoare triple {2812#true} havoc #t~nondet1; {2812#true} is VALID [2020-07-11 02:29:32,126 INFO L280 TraceCheckUtils]: 15: Hoare triple {2812#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2812#true} is VALID [2020-07-11 02:29:32,126 INFO L280 TraceCheckUtils]: 16: Hoare triple {2812#true} ~scheme~0 := #t~nondet2; {2812#true} is VALID [2020-07-11 02:29:32,126 INFO L280 TraceCheckUtils]: 17: Hoare triple {2812#true} havoc #t~nondet2; {2812#true} is VALID [2020-07-11 02:29:32,127 INFO L280 TraceCheckUtils]: 18: Hoare triple {2812#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2812#true} is VALID [2020-07-11 02:29:32,127 INFO L280 TraceCheckUtils]: 19: Hoare triple {2812#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2812#true} is VALID [2020-07-11 02:29:32,127 INFO L280 TraceCheckUtils]: 20: Hoare triple {2812#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2812#true} is VALID [2020-07-11 02:29:32,130 INFO L280 TraceCheckUtils]: 21: Hoare triple {2812#true} assume ~urilen~0 > 0; {2812#true} is VALID [2020-07-11 02:29:32,131 INFO L280 TraceCheckUtils]: 22: Hoare triple {2812#true} assume ~tokenlen~0 > 0; {2812#true} is VALID [2020-07-11 02:29:32,131 INFO L280 TraceCheckUtils]: 23: Hoare triple {2812#true} assume ~scheme~0 >= 0; {2812#true} is VALID [2020-07-11 02:29:32,131 INFO L280 TraceCheckUtils]: 24: Hoare triple {2812#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {2812#true} is VALID [2020-07-11 02:29:32,131 INFO L280 TraceCheckUtils]: 25: Hoare triple {2812#true} ~cp~0 := ~scheme~0; {2812#true} is VALID [2020-07-11 02:29:32,132 INFO L263 TraceCheckUtils]: 26: Hoare triple {2812#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,132 INFO L280 TraceCheckUtils]: 27: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,132 INFO L280 TraceCheckUtils]: 28: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,132 INFO L280 TraceCheckUtils]: 29: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,132 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2812#true} {2812#true} #184#return; {2812#true} is VALID [2020-07-11 02:29:32,133 INFO L263 TraceCheckUtils]: 31: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,133 INFO L280 TraceCheckUtils]: 32: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,133 INFO L280 TraceCheckUtils]: 33: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,136 INFO L280 TraceCheckUtils]: 34: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,136 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2812#true} {2812#true} #186#return; {2812#true} is VALID [2020-07-11 02:29:32,136 INFO L280 TraceCheckUtils]: 36: Hoare triple {2812#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2812#true} is VALID [2020-07-11 02:29:32,136 INFO L280 TraceCheckUtils]: 37: Hoare triple {2812#true} assume 0 != #t~nondet3; {2812#true} is VALID [2020-07-11 02:29:32,136 INFO L280 TraceCheckUtils]: 38: Hoare triple {2812#true} havoc #t~nondet3; {2812#true} is VALID [2020-07-11 02:29:32,137 INFO L263 TraceCheckUtils]: 39: Hoare triple {2812#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,137 INFO L280 TraceCheckUtils]: 40: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,137 INFO L280 TraceCheckUtils]: 41: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,137 INFO L280 TraceCheckUtils]: 42: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,137 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2812#true} {2812#true} #188#return; {2812#true} is VALID [2020-07-11 02:29:32,137 INFO L263 TraceCheckUtils]: 44: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,138 INFO L280 TraceCheckUtils]: 45: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,138 INFO L280 TraceCheckUtils]: 46: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,138 INFO L280 TraceCheckUtils]: 47: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,138 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2812#true} {2812#true} #190#return; {2812#true} is VALID [2020-07-11 02:29:32,138 INFO L280 TraceCheckUtils]: 49: Hoare triple {2812#true} assume !!(~cp~0 != ~urilen~0 - 1); {2812#true} is VALID [2020-07-11 02:29:32,138 INFO L280 TraceCheckUtils]: 50: Hoare triple {2812#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2812#true} is VALID [2020-07-11 02:29:32,138 INFO L280 TraceCheckUtils]: 51: Hoare triple {2812#true} assume 0 != #t~nondet4; {2812#true} is VALID [2020-07-11 02:29:32,139 INFO L280 TraceCheckUtils]: 52: Hoare triple {2812#true} havoc #t~nondet4; {2812#true} is VALID [2020-07-11 02:29:32,139 INFO L263 TraceCheckUtils]: 53: Hoare triple {2812#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,139 INFO L280 TraceCheckUtils]: 54: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,139 INFO L280 TraceCheckUtils]: 55: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,139 INFO L280 TraceCheckUtils]: 56: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,139 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2812#true} {2812#true} #196#return; {2812#true} is VALID [2020-07-11 02:29:32,139 INFO L263 TraceCheckUtils]: 58: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,140 INFO L280 TraceCheckUtils]: 59: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,140 INFO L280 TraceCheckUtils]: 60: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,140 INFO L280 TraceCheckUtils]: 61: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,140 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2812#true} {2812#true} #198#return; {2812#true} is VALID [2020-07-11 02:29:32,140 INFO L280 TraceCheckUtils]: 63: Hoare triple {2812#true} assume !(~cp~0 == ~urilen~0 - 1); {2812#true} is VALID [2020-07-11 02:29:32,140 INFO L263 TraceCheckUtils]: 64: Hoare triple {2812#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,140 INFO L280 TraceCheckUtils]: 65: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,141 INFO L280 TraceCheckUtils]: 66: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,141 INFO L280 TraceCheckUtils]: 67: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,141 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2812#true} {2812#true} #200#return; {2812#true} is VALID [2020-07-11 02:29:32,141 INFO L263 TraceCheckUtils]: 69: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,142 INFO L280 TraceCheckUtils]: 70: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,142 INFO L280 TraceCheckUtils]: 71: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,142 INFO L280 TraceCheckUtils]: 72: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,142 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2812#true} {2812#true} #202#return; {2812#true} is VALID [2020-07-11 02:29:32,143 INFO L280 TraceCheckUtils]: 74: Hoare triple {2812#true} assume !(1 + ~cp~0 == ~urilen~0 - 1); {2812#true} is VALID [2020-07-11 02:29:32,145 INFO L280 TraceCheckUtils]: 75: Hoare triple {2812#true} #t~pre6 := 1 + ~cp~0; {2812#true} is VALID [2020-07-11 02:29:32,145 INFO L280 TraceCheckUtils]: 76: Hoare triple {2812#true} ~cp~0 := 1 + ~cp~0; {2812#true} is VALID [2020-07-11 02:29:32,147 INFO L280 TraceCheckUtils]: 77: Hoare triple {2812#true} havoc #t~pre6; {2812#true} is VALID [2020-07-11 02:29:32,147 INFO L280 TraceCheckUtils]: 78: Hoare triple {2812#true} ~scheme~0 := ~cp~0; {2812#true} is VALID [2020-07-11 02:29:32,148 INFO L280 TraceCheckUtils]: 79: Hoare triple {2812#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2812#true} is VALID [2020-07-11 02:29:32,148 INFO L280 TraceCheckUtils]: 80: Hoare triple {2812#true} assume 0 != #t~nondet7; {2812#true} is VALID [2020-07-11 02:29:32,148 INFO L280 TraceCheckUtils]: 81: Hoare triple {2812#true} havoc #t~nondet7; {2812#true} is VALID [2020-07-11 02:29:32,150 INFO L280 TraceCheckUtils]: 82: Hoare triple {2812#true} ~c~0 := 0; {2848#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:32,150 INFO L263 TraceCheckUtils]: 83: Hoare triple {2848#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,150 INFO L280 TraceCheckUtils]: 84: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,150 INFO L280 TraceCheckUtils]: 85: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,150 INFO L280 TraceCheckUtils]: 86: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,151 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #204#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:32,151 INFO L263 TraceCheckUtils]: 88: Hoare triple {2848#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,151 INFO L280 TraceCheckUtils]: 89: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,152 INFO L280 TraceCheckUtils]: 90: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,152 INFO L280 TraceCheckUtils]: 91: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,153 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #206#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:32,154 INFO L280 TraceCheckUtils]: 93: Hoare triple {2848#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-11 02:29:32,154 INFO L263 TraceCheckUtils]: 94: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,154 INFO L280 TraceCheckUtils]: 95: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,155 INFO L280 TraceCheckUtils]: 96: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,155 INFO L280 TraceCheckUtils]: 97: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,156 INFO L275 TraceCheckUtils]: 98: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #208#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-11 02:29:32,156 INFO L263 TraceCheckUtils]: 99: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-11 02:29:32,156 INFO L280 TraceCheckUtils]: 100: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-11 02:29:32,157 INFO L280 TraceCheckUtils]: 101: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-11 02:29:32,157 INFO L280 TraceCheckUtils]: 102: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-11 02:29:32,157 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #210#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-11 02:29:32,158 INFO L280 TraceCheckUtils]: 104: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-11 02:29:32,158 INFO L280 TraceCheckUtils]: 105: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume 0 != #t~nondet8; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-11 02:29:32,159 INFO L280 TraceCheckUtils]: 106: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} havoc #t~nondet8; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-11 02:29:32,159 INFO L280 TraceCheckUtils]: 107: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #t~pre9 := 1 + ~c~0; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-11 02:29:32,160 INFO L280 TraceCheckUtils]: 108: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} ~c~0 := 1 + ~c~0; {2866#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-11 02:29:32,161 INFO L280 TraceCheckUtils]: 109: Hoare triple {2866#(< main_~c~0 main_~tokenlen~0)} havoc #t~pre9; {2866#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-11 02:29:32,163 INFO L263 TraceCheckUtils]: 110: Hoare triple {2866#(< main_~c~0 main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2867#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:32,164 INFO L280 TraceCheckUtils]: 111: Hoare triple {2867#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2868#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:32,164 INFO L280 TraceCheckUtils]: 112: Hoare triple {2868#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2813#false} is VALID [2020-07-11 02:29:32,164 INFO L280 TraceCheckUtils]: 113: Hoare triple {2813#false} assume !false; {2813#false} is VALID [2020-07-11 02:29:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2020-07-11 02:29:32,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [174603794] [2020-07-11 02:29:32,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:32,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-11 02:29:32,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436939269] [2020-07-11 02:29:32,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-07-11 02:29:32,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:32,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-11 02:29:32,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:32,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-11 02:29:32,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:32,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-11 02:29:32,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:29:32,269 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 7 states. [2020-07-11 02:29:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:33,046 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2020-07-11 02:29:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 02:29:33,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-07-11 02:29:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2020-07-11 02:29:33,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-11 02:29:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2020-07-11 02:29:33,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 135 transitions. [2020-07-11 02:29:33,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:33,205 INFO L225 Difference]: With dead ends: 129 [2020-07-11 02:29:33,206 INFO L226 Difference]: Without dead ends: 127 [2020-07-11 02:29:33,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-11 02:29:33,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-11 02:29:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-07-11 02:29:33,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:33,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 119 states. [2020-07-11 02:29:33,458 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 119 states. [2020-07-11 02:29:33,458 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 119 states. [2020-07-11 02:29:33,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:33,464 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2020-07-11 02:29:33,464 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2020-07-11 02:29:33,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:33,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:33,466 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 127 states. [2020-07-11 02:29:33,466 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 127 states. [2020-07-11 02:29:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:33,472 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2020-07-11 02:29:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2020-07-11 02:29:33,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:33,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:33,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:33,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:33,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-11 02:29:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2020-07-11 02:29:33,480 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 114 [2020-07-11 02:29:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:33,481 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2020-07-11 02:29:33,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-11 02:29:33,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 119 states and 141 transitions. [2020-07-11 02:29:33,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2020-07-11 02:29:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-07-11 02:29:33,698 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:33,698 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:29:33,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 02:29:33,699 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash -279016842, now seen corresponding path program 1 times [2020-07-11 02:29:33,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:33,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [345391341] [2020-07-11 02:29:33,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,812 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,812 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3623#true} {3623#true} #180#return; {3623#true} is VALID [2020-07-11 02:29:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,821 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,821 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,821 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #184#return; {3623#true} is VALID [2020-07-11 02:29:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,826 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #186#return; {3623#true} is VALID [2020-07-11 02:29:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,832 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #188#return; {3623#true} is VALID [2020-07-11 02:29:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,836 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,836 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #190#return; {3623#true} is VALID [2020-07-11 02:29:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,841 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,841 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #196#return; {3623#true} is VALID [2020-07-11 02:29:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,845 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,846 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #198#return; {3623#true} is VALID [2020-07-11 02:29:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,861 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,861 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #200#return; {3623#true} is VALID [2020-07-11 02:29:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,870 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,870 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,871 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #202#return; {3623#true} is VALID [2020-07-11 02:29:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,879 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,882 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #204#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,887 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,888 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #206#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,901 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,902 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #208#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,907 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,907 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #210#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:33,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,920 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,921 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3676#(<= 0 main_~c~0)} #212#return; {3676#(<= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,921 INFO L263 TraceCheckUtils]: 0: Hoare triple {3623#true} call ULTIMATE.init(); {3623#true} is VALID [2020-07-11 02:29:33,922 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,922 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3623#true} {3623#true} #180#return; {3623#true} is VALID [2020-07-11 02:29:33,922 INFO L263 TraceCheckUtils]: 3: Hoare triple {3623#true} call #t~ret11 := main(); {3623#true} is VALID [2020-07-11 02:29:33,922 INFO L280 TraceCheckUtils]: 4: Hoare triple {3623#true} havoc ~scheme~0; {3623#true} is VALID [2020-07-11 02:29:33,923 INFO L280 TraceCheckUtils]: 5: Hoare triple {3623#true} havoc ~urilen~0; {3623#true} is VALID [2020-07-11 02:29:33,923 INFO L280 TraceCheckUtils]: 6: Hoare triple {3623#true} havoc ~tokenlen~0; {3623#true} is VALID [2020-07-11 02:29:33,923 INFO L280 TraceCheckUtils]: 7: Hoare triple {3623#true} havoc ~cp~0; {3623#true} is VALID [2020-07-11 02:29:33,923 INFO L280 TraceCheckUtils]: 8: Hoare triple {3623#true} havoc ~c~0; {3623#true} is VALID [2020-07-11 02:29:33,923 INFO L280 TraceCheckUtils]: 9: Hoare triple {3623#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3623#true} is VALID [2020-07-11 02:29:33,924 INFO L280 TraceCheckUtils]: 10: Hoare triple {3623#true} ~urilen~0 := #t~nondet0; {3623#true} is VALID [2020-07-11 02:29:33,924 INFO L280 TraceCheckUtils]: 11: Hoare triple {3623#true} havoc #t~nondet0; {3623#true} is VALID [2020-07-11 02:29:33,924 INFO L280 TraceCheckUtils]: 12: Hoare triple {3623#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3623#true} is VALID [2020-07-11 02:29:33,924 INFO L280 TraceCheckUtils]: 13: Hoare triple {3623#true} ~tokenlen~0 := #t~nondet1; {3623#true} is VALID [2020-07-11 02:29:33,924 INFO L280 TraceCheckUtils]: 14: Hoare triple {3623#true} havoc #t~nondet1; {3623#true} is VALID [2020-07-11 02:29:33,925 INFO L280 TraceCheckUtils]: 15: Hoare triple {3623#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3623#true} is VALID [2020-07-11 02:29:33,925 INFO L280 TraceCheckUtils]: 16: Hoare triple {3623#true} ~scheme~0 := #t~nondet2; {3623#true} is VALID [2020-07-11 02:29:33,925 INFO L280 TraceCheckUtils]: 17: Hoare triple {3623#true} havoc #t~nondet2; {3623#true} is VALID [2020-07-11 02:29:33,925 INFO L280 TraceCheckUtils]: 18: Hoare triple {3623#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {3623#true} is VALID [2020-07-11 02:29:33,925 INFO L280 TraceCheckUtils]: 19: Hoare triple {3623#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {3623#true} is VALID [2020-07-11 02:29:33,926 INFO L280 TraceCheckUtils]: 20: Hoare triple {3623#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {3623#true} is VALID [2020-07-11 02:29:33,926 INFO L280 TraceCheckUtils]: 21: Hoare triple {3623#true} assume ~urilen~0 > 0; {3623#true} is VALID [2020-07-11 02:29:33,926 INFO L280 TraceCheckUtils]: 22: Hoare triple {3623#true} assume ~tokenlen~0 > 0; {3623#true} is VALID [2020-07-11 02:29:33,926 INFO L280 TraceCheckUtils]: 23: Hoare triple {3623#true} assume ~scheme~0 >= 0; {3623#true} is VALID [2020-07-11 02:29:33,927 INFO L280 TraceCheckUtils]: 24: Hoare triple {3623#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {3623#true} is VALID [2020-07-11 02:29:33,927 INFO L280 TraceCheckUtils]: 25: Hoare triple {3623#true} ~cp~0 := ~scheme~0; {3623#true} is VALID [2020-07-11 02:29:33,927 INFO L263 TraceCheckUtils]: 26: Hoare triple {3623#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,927 INFO L280 TraceCheckUtils]: 27: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,928 INFO L280 TraceCheckUtils]: 28: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,928 INFO L280 TraceCheckUtils]: 29: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,928 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3623#true} {3623#true} #184#return; {3623#true} is VALID [2020-07-11 02:29:33,928 INFO L263 TraceCheckUtils]: 31: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,929 INFO L280 TraceCheckUtils]: 32: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,929 INFO L280 TraceCheckUtils]: 33: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,929 INFO L280 TraceCheckUtils]: 34: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,931 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {3623#true} {3623#true} #186#return; {3623#true} is VALID [2020-07-11 02:29:33,931 INFO L280 TraceCheckUtils]: 36: Hoare triple {3623#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3623#true} is VALID [2020-07-11 02:29:33,931 INFO L280 TraceCheckUtils]: 37: Hoare triple {3623#true} assume 0 != #t~nondet3; {3623#true} is VALID [2020-07-11 02:29:33,932 INFO L280 TraceCheckUtils]: 38: Hoare triple {3623#true} havoc #t~nondet3; {3623#true} is VALID [2020-07-11 02:29:33,932 INFO L263 TraceCheckUtils]: 39: Hoare triple {3623#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,932 INFO L280 TraceCheckUtils]: 40: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,932 INFO L280 TraceCheckUtils]: 41: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,932 INFO L280 TraceCheckUtils]: 42: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,933 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3623#true} {3623#true} #188#return; {3623#true} is VALID [2020-07-11 02:29:33,933 INFO L263 TraceCheckUtils]: 44: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,933 INFO L280 TraceCheckUtils]: 45: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,933 INFO L280 TraceCheckUtils]: 46: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,933 INFO L280 TraceCheckUtils]: 47: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,934 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3623#true} {3623#true} #190#return; {3623#true} is VALID [2020-07-11 02:29:33,934 INFO L280 TraceCheckUtils]: 49: Hoare triple {3623#true} assume !!(~cp~0 != ~urilen~0 - 1); {3623#true} is VALID [2020-07-11 02:29:33,934 INFO L280 TraceCheckUtils]: 50: Hoare triple {3623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3623#true} is VALID [2020-07-11 02:29:33,934 INFO L280 TraceCheckUtils]: 51: Hoare triple {3623#true} assume 0 != #t~nondet4; {3623#true} is VALID [2020-07-11 02:29:33,934 INFO L280 TraceCheckUtils]: 52: Hoare triple {3623#true} havoc #t~nondet4; {3623#true} is VALID [2020-07-11 02:29:33,935 INFO L263 TraceCheckUtils]: 53: Hoare triple {3623#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,935 INFO L280 TraceCheckUtils]: 54: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,935 INFO L280 TraceCheckUtils]: 55: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,935 INFO L280 TraceCheckUtils]: 56: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,935 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {3623#true} {3623#true} #196#return; {3623#true} is VALID [2020-07-11 02:29:33,936 INFO L263 TraceCheckUtils]: 58: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,936 INFO L280 TraceCheckUtils]: 59: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,936 INFO L280 TraceCheckUtils]: 60: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,936 INFO L280 TraceCheckUtils]: 61: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,937 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {3623#true} {3623#true} #198#return; {3623#true} is VALID [2020-07-11 02:29:33,937 INFO L280 TraceCheckUtils]: 63: Hoare triple {3623#true} assume !(~cp~0 == ~urilen~0 - 1); {3623#true} is VALID [2020-07-11 02:29:33,937 INFO L263 TraceCheckUtils]: 64: Hoare triple {3623#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,937 INFO L280 TraceCheckUtils]: 65: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,938 INFO L280 TraceCheckUtils]: 66: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,938 INFO L280 TraceCheckUtils]: 67: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,938 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3623#true} {3623#true} #200#return; {3623#true} is VALID [2020-07-11 02:29:33,938 INFO L263 TraceCheckUtils]: 69: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,938 INFO L280 TraceCheckUtils]: 70: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,939 INFO L280 TraceCheckUtils]: 71: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,939 INFO L280 TraceCheckUtils]: 72: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,939 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3623#true} {3623#true} #202#return; {3623#true} is VALID [2020-07-11 02:29:33,939 INFO L280 TraceCheckUtils]: 74: Hoare triple {3623#true} assume !(1 + ~cp~0 == ~urilen~0 - 1); {3623#true} is VALID [2020-07-11 02:29:33,940 INFO L280 TraceCheckUtils]: 75: Hoare triple {3623#true} #t~pre6 := 1 + ~cp~0; {3623#true} is VALID [2020-07-11 02:29:33,940 INFO L280 TraceCheckUtils]: 76: Hoare triple {3623#true} ~cp~0 := 1 + ~cp~0; {3623#true} is VALID [2020-07-11 02:29:33,940 INFO L280 TraceCheckUtils]: 77: Hoare triple {3623#true} havoc #t~pre6; {3623#true} is VALID [2020-07-11 02:29:33,940 INFO L280 TraceCheckUtils]: 78: Hoare triple {3623#true} ~scheme~0 := ~cp~0; {3623#true} is VALID [2020-07-11 02:29:33,940 INFO L280 TraceCheckUtils]: 79: Hoare triple {3623#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3623#true} is VALID [2020-07-11 02:29:33,941 INFO L280 TraceCheckUtils]: 80: Hoare triple {3623#true} assume 0 != #t~nondet7; {3623#true} is VALID [2020-07-11 02:29:33,941 INFO L280 TraceCheckUtils]: 81: Hoare triple {3623#true} havoc #t~nondet7; {3623#true} is VALID [2020-07-11 02:29:33,943 INFO L280 TraceCheckUtils]: 82: Hoare triple {3623#true} ~c~0 := 0; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,944 INFO L263 TraceCheckUtils]: 83: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,944 INFO L280 TraceCheckUtils]: 84: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,944 INFO L280 TraceCheckUtils]: 85: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,945 INFO L280 TraceCheckUtils]: 86: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,945 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #204#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,946 INFO L263 TraceCheckUtils]: 88: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,946 INFO L280 TraceCheckUtils]: 89: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,946 INFO L280 TraceCheckUtils]: 90: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,946 INFO L280 TraceCheckUtils]: 91: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,947 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #206#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,948 INFO L280 TraceCheckUtils]: 93: Hoare triple {3659#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,948 INFO L263 TraceCheckUtils]: 94: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,948 INFO L280 TraceCheckUtils]: 95: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,948 INFO L280 TraceCheckUtils]: 96: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,949 INFO L280 TraceCheckUtils]: 97: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,950 INFO L275 TraceCheckUtils]: 98: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #208#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,950 INFO L263 TraceCheckUtils]: 99: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,950 INFO L280 TraceCheckUtils]: 100: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,950 INFO L280 TraceCheckUtils]: 101: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,951 INFO L280 TraceCheckUtils]: 102: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,951 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #210#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,952 INFO L280 TraceCheckUtils]: 104: Hoare triple {3659#(= 0 main_~c~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,952 INFO L280 TraceCheckUtils]: 105: Hoare triple {3659#(= 0 main_~c~0)} assume 0 != #t~nondet8; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,953 INFO L280 TraceCheckUtils]: 106: Hoare triple {3659#(= 0 main_~c~0)} havoc #t~nondet8; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,954 INFO L280 TraceCheckUtils]: 107: Hoare triple {3659#(= 0 main_~c~0)} #t~pre9 := 1 + ~c~0; {3659#(= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,954 INFO L280 TraceCheckUtils]: 108: Hoare triple {3659#(= 0 main_~c~0)} ~c~0 := 1 + ~c~0; {3676#(<= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,955 INFO L280 TraceCheckUtils]: 109: Hoare triple {3676#(<= 0 main_~c~0)} havoc #t~pre9; {3676#(<= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,955 INFO L263 TraceCheckUtils]: 110: Hoare triple {3676#(<= 0 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {3623#true} is VALID [2020-07-11 02:29:33,955 INFO L280 TraceCheckUtils]: 111: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-11 02:29:33,956 INFO L280 TraceCheckUtils]: 112: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-11 02:29:33,956 INFO L280 TraceCheckUtils]: 113: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-11 02:29:33,957 INFO L275 TraceCheckUtils]: 114: Hoare quadruple {3623#true} {3676#(<= 0 main_~c~0)} #212#return; {3676#(<= 0 main_~c~0)} is VALID [2020-07-11 02:29:33,958 INFO L263 TraceCheckUtils]: 115: Hoare triple {3676#(<= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {3681#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:33,958 INFO L280 TraceCheckUtils]: 116: Hoare triple {3681#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3682#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:33,959 INFO L280 TraceCheckUtils]: 117: Hoare triple {3682#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3624#false} is VALID [2020-07-11 02:29:33,959 INFO L280 TraceCheckUtils]: 118: Hoare triple {3624#false} assume !false; {3624#false} is VALID [2020-07-11 02:29:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-07-11 02:29:33,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [345391341] [2020-07-11 02:29:33,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:33,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:29:33,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631874666] [2020-07-11 02:29:33,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-07-11 02:29:33,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:33,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:29:34,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:34,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:29:34,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:29:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:29:34,051 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 6 states. [2020-07-11 02:29:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:34,698 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2020-07-11 02:29:34,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:29:34,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-07-11 02:29:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:29:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2020-07-11 02:29:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:29:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2020-07-11 02:29:34,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 121 transitions. [2020-07-11 02:29:34,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:34,842 INFO L225 Difference]: With dead ends: 125 [2020-07-11 02:29:34,842 INFO L226 Difference]: Without dead ends: 123 [2020-07-11 02:29:34,842 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:29:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-11 02:29:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-07-11 02:29:35,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:35,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 123 states. [2020-07-11 02:29:35,104 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-11 02:29:35,104 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-11 02:29:35,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:35,110 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2020-07-11 02:29:35,110 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-07-11 02:29:35,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:35,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:35,111 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-11 02:29:35,111 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-11 02:29:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:35,117 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2020-07-11 02:29:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-07-11 02:29:35,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:35,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:35,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:35,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-11 02:29:35,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2020-07-11 02:29:35,123 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 119 [2020-07-11 02:29:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:35,123 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2020-07-11 02:29:35,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:29:35,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states and 144 transitions. [2020-07-11 02:29:35,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-07-11 02:29:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-11 02:29:35,344 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 02:29:35,345 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:29:35,345 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 02:29:35,345 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 02:29:35,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 02:29:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash 486899888, now seen corresponding path program 1 times [2020-07-11 02:29:35,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 02:29:35,346 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [793852891] [2020-07-11 02:29:35,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 02:29:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,464 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,465 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4429#true} {4429#true} #180#return; {4429#true} is VALID [2020-07-11 02:29:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,469 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,469 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,470 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #184#return; {4429#true} is VALID [2020-07-11 02:29:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,476 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,476 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #186#return; {4429#true} is VALID [2020-07-11 02:29:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,481 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,481 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #188#return; {4429#true} is VALID [2020-07-11 02:29:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,485 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,485 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,486 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #190#return; {4429#true} is VALID [2020-07-11 02:29:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,491 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #196#return; {4429#true} is VALID [2020-07-11 02:29:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,500 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #198#return; {4429#true} is VALID [2020-07-11 02:29:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,505 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #200#return; {4429#true} is VALID [2020-07-11 02:29:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,510 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,511 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #202#return; {4429#true} is VALID [2020-07-11 02:29:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,516 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #204#return; {4429#true} is VALID [2020-07-11 02:29:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,520 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,520 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #206#return; {4429#true} is VALID [2020-07-11 02:29:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,524 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,525 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,525 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #208#return; {4429#true} is VALID [2020-07-11 02:29:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,529 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,529 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,530 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #210#return; {4429#true} is VALID [2020-07-11 02:29:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,533 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,534 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,534 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #212#return; {4429#true} is VALID [2020-07-11 02:29:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,538 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #214#return; {4429#true} is VALID [2020-07-11 02:29:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,542 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,542 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,543 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,543 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #216#return; {4429#true} is VALID [2020-07-11 02:29:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,548 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,548 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,548 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #218#return; {4429#true} is VALID [2020-07-11 02:29:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,553 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,554 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,555 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #208#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 02:29:35,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,562 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,563 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #210#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,563 INFO L263 TraceCheckUtils]: 0: Hoare triple {4429#true} call ULTIMATE.init(); {4429#true} is VALID [2020-07-11 02:29:35,564 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,564 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4429#true} {4429#true} #180#return; {4429#true} is VALID [2020-07-11 02:29:35,564 INFO L263 TraceCheckUtils]: 3: Hoare triple {4429#true} call #t~ret11 := main(); {4429#true} is VALID [2020-07-11 02:29:35,564 INFO L280 TraceCheckUtils]: 4: Hoare triple {4429#true} havoc ~scheme~0; {4429#true} is VALID [2020-07-11 02:29:35,565 INFO L280 TraceCheckUtils]: 5: Hoare triple {4429#true} havoc ~urilen~0; {4429#true} is VALID [2020-07-11 02:29:35,565 INFO L280 TraceCheckUtils]: 6: Hoare triple {4429#true} havoc ~tokenlen~0; {4429#true} is VALID [2020-07-11 02:29:35,565 INFO L280 TraceCheckUtils]: 7: Hoare triple {4429#true} havoc ~cp~0; {4429#true} is VALID [2020-07-11 02:29:35,565 INFO L280 TraceCheckUtils]: 8: Hoare triple {4429#true} havoc ~c~0; {4429#true} is VALID [2020-07-11 02:29:35,565 INFO L280 TraceCheckUtils]: 9: Hoare triple {4429#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4429#true} is VALID [2020-07-11 02:29:35,566 INFO L280 TraceCheckUtils]: 10: Hoare triple {4429#true} ~urilen~0 := #t~nondet0; {4429#true} is VALID [2020-07-11 02:29:35,566 INFO L280 TraceCheckUtils]: 11: Hoare triple {4429#true} havoc #t~nondet0; {4429#true} is VALID [2020-07-11 02:29:35,566 INFO L280 TraceCheckUtils]: 12: Hoare triple {4429#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4429#true} is VALID [2020-07-11 02:29:35,566 INFO L280 TraceCheckUtils]: 13: Hoare triple {4429#true} ~tokenlen~0 := #t~nondet1; {4429#true} is VALID [2020-07-11 02:29:35,566 INFO L280 TraceCheckUtils]: 14: Hoare triple {4429#true} havoc #t~nondet1; {4429#true} is VALID [2020-07-11 02:29:35,567 INFO L280 TraceCheckUtils]: 15: Hoare triple {4429#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4429#true} is VALID [2020-07-11 02:29:35,567 INFO L280 TraceCheckUtils]: 16: Hoare triple {4429#true} ~scheme~0 := #t~nondet2; {4429#true} is VALID [2020-07-11 02:29:35,567 INFO L280 TraceCheckUtils]: 17: Hoare triple {4429#true} havoc #t~nondet2; {4429#true} is VALID [2020-07-11 02:29:35,568 INFO L280 TraceCheckUtils]: 18: Hoare triple {4429#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {4429#true} is VALID [2020-07-11 02:29:35,568 INFO L280 TraceCheckUtils]: 19: Hoare triple {4429#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {4429#true} is VALID [2020-07-11 02:29:35,568 INFO L280 TraceCheckUtils]: 20: Hoare triple {4429#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {4429#true} is VALID [2020-07-11 02:29:35,568 INFO L280 TraceCheckUtils]: 21: Hoare triple {4429#true} assume ~urilen~0 > 0; {4429#true} is VALID [2020-07-11 02:29:35,569 INFO L280 TraceCheckUtils]: 22: Hoare triple {4429#true} assume ~tokenlen~0 > 0; {4429#true} is VALID [2020-07-11 02:29:35,569 INFO L280 TraceCheckUtils]: 23: Hoare triple {4429#true} assume ~scheme~0 >= 0; {4429#true} is VALID [2020-07-11 02:29:35,569 INFO L280 TraceCheckUtils]: 24: Hoare triple {4429#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {4429#true} is VALID [2020-07-11 02:29:35,570 INFO L280 TraceCheckUtils]: 25: Hoare triple {4429#true} ~cp~0 := ~scheme~0; {4429#true} is VALID [2020-07-11 02:29:35,570 INFO L263 TraceCheckUtils]: 26: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,570 INFO L280 TraceCheckUtils]: 27: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,570 INFO L280 TraceCheckUtils]: 28: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,571 INFO L280 TraceCheckUtils]: 29: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,571 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4429#true} {4429#true} #184#return; {4429#true} is VALID [2020-07-11 02:29:35,571 INFO L263 TraceCheckUtils]: 31: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,571 INFO L280 TraceCheckUtils]: 32: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,572 INFO L280 TraceCheckUtils]: 33: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,572 INFO L280 TraceCheckUtils]: 34: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,572 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {4429#true} {4429#true} #186#return; {4429#true} is VALID [2020-07-11 02:29:35,572 INFO L280 TraceCheckUtils]: 36: Hoare triple {4429#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4429#true} is VALID [2020-07-11 02:29:35,572 INFO L280 TraceCheckUtils]: 37: Hoare triple {4429#true} assume 0 != #t~nondet3; {4429#true} is VALID [2020-07-11 02:29:35,573 INFO L280 TraceCheckUtils]: 38: Hoare triple {4429#true} havoc #t~nondet3; {4429#true} is VALID [2020-07-11 02:29:35,573 INFO L263 TraceCheckUtils]: 39: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,573 INFO L280 TraceCheckUtils]: 40: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,573 INFO L280 TraceCheckUtils]: 41: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,573 INFO L280 TraceCheckUtils]: 42: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,574 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4429#true} {4429#true} #188#return; {4429#true} is VALID [2020-07-11 02:29:35,574 INFO L263 TraceCheckUtils]: 44: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,574 INFO L280 TraceCheckUtils]: 45: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,574 INFO L280 TraceCheckUtils]: 46: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,574 INFO L280 TraceCheckUtils]: 47: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,574 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4429#true} {4429#true} #190#return; {4429#true} is VALID [2020-07-11 02:29:35,575 INFO L280 TraceCheckUtils]: 49: Hoare triple {4429#true} assume !!(~cp~0 != ~urilen~0 - 1); {4429#true} is VALID [2020-07-11 02:29:35,575 INFO L280 TraceCheckUtils]: 50: Hoare triple {4429#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4429#true} is VALID [2020-07-11 02:29:35,575 INFO L280 TraceCheckUtils]: 51: Hoare triple {4429#true} assume 0 != #t~nondet4; {4429#true} is VALID [2020-07-11 02:29:35,575 INFO L280 TraceCheckUtils]: 52: Hoare triple {4429#true} havoc #t~nondet4; {4429#true} is VALID [2020-07-11 02:29:35,575 INFO L263 TraceCheckUtils]: 53: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,576 INFO L280 TraceCheckUtils]: 54: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,576 INFO L280 TraceCheckUtils]: 55: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,576 INFO L280 TraceCheckUtils]: 56: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,576 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {4429#true} {4429#true} #196#return; {4429#true} is VALID [2020-07-11 02:29:35,576 INFO L263 TraceCheckUtils]: 58: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,577 INFO L280 TraceCheckUtils]: 59: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,577 INFO L280 TraceCheckUtils]: 60: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,577 INFO L280 TraceCheckUtils]: 61: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,577 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4429#true} {4429#true} #198#return; {4429#true} is VALID [2020-07-11 02:29:35,577 INFO L280 TraceCheckUtils]: 63: Hoare triple {4429#true} assume !(~cp~0 == ~urilen~0 - 1); {4429#true} is VALID [2020-07-11 02:29:35,578 INFO L263 TraceCheckUtils]: 64: Hoare triple {4429#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,578 INFO L280 TraceCheckUtils]: 65: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,578 INFO L280 TraceCheckUtils]: 66: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,578 INFO L280 TraceCheckUtils]: 67: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,578 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {4429#true} {4429#true} #200#return; {4429#true} is VALID [2020-07-11 02:29:35,578 INFO L263 TraceCheckUtils]: 69: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,579 INFO L280 TraceCheckUtils]: 70: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,579 INFO L280 TraceCheckUtils]: 71: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,579 INFO L280 TraceCheckUtils]: 72: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,579 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {4429#true} {4429#true} #202#return; {4429#true} is VALID [2020-07-11 02:29:35,579 INFO L280 TraceCheckUtils]: 74: Hoare triple {4429#true} assume !(1 + ~cp~0 == ~urilen~0 - 1); {4429#true} is VALID [2020-07-11 02:29:35,580 INFO L280 TraceCheckUtils]: 75: Hoare triple {4429#true} #t~pre6 := 1 + ~cp~0; {4429#true} is VALID [2020-07-11 02:29:35,580 INFO L280 TraceCheckUtils]: 76: Hoare triple {4429#true} ~cp~0 := 1 + ~cp~0; {4429#true} is VALID [2020-07-11 02:29:35,580 INFO L280 TraceCheckUtils]: 77: Hoare triple {4429#true} havoc #t~pre6; {4429#true} is VALID [2020-07-11 02:29:35,581 INFO L280 TraceCheckUtils]: 78: Hoare triple {4429#true} ~scheme~0 := ~cp~0; {4429#true} is VALID [2020-07-11 02:29:35,581 INFO L280 TraceCheckUtils]: 79: Hoare triple {4429#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {4429#true} is VALID [2020-07-11 02:29:35,581 INFO L280 TraceCheckUtils]: 80: Hoare triple {4429#true} assume 0 != #t~nondet7; {4429#true} is VALID [2020-07-11 02:29:35,581 INFO L280 TraceCheckUtils]: 81: Hoare triple {4429#true} havoc #t~nondet7; {4429#true} is VALID [2020-07-11 02:29:35,582 INFO L280 TraceCheckUtils]: 82: Hoare triple {4429#true} ~c~0 := 0; {4429#true} is VALID [2020-07-11 02:29:35,582 INFO L263 TraceCheckUtils]: 83: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,582 INFO L280 TraceCheckUtils]: 84: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,583 INFO L280 TraceCheckUtils]: 85: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,583 INFO L280 TraceCheckUtils]: 86: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,583 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {4429#true} {4429#true} #204#return; {4429#true} is VALID [2020-07-11 02:29:35,583 INFO L263 TraceCheckUtils]: 88: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,584 INFO L280 TraceCheckUtils]: 89: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,584 INFO L280 TraceCheckUtils]: 90: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,584 INFO L280 TraceCheckUtils]: 91: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,584 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {4429#true} {4429#true} #206#return; {4429#true} is VALID [2020-07-11 02:29:35,585 INFO L280 TraceCheckUtils]: 93: Hoare triple {4429#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {4429#true} is VALID [2020-07-11 02:29:35,585 INFO L263 TraceCheckUtils]: 94: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,585 INFO L280 TraceCheckUtils]: 95: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,585 INFO L280 TraceCheckUtils]: 96: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,586 INFO L280 TraceCheckUtils]: 97: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,586 INFO L275 TraceCheckUtils]: 98: Hoare quadruple {4429#true} {4429#true} #208#return; {4429#true} is VALID [2020-07-11 02:29:35,586 INFO L263 TraceCheckUtils]: 99: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,587 INFO L280 TraceCheckUtils]: 100: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,587 INFO L280 TraceCheckUtils]: 101: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,587 INFO L280 TraceCheckUtils]: 102: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,587 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {4429#true} {4429#true} #210#return; {4429#true} is VALID [2020-07-11 02:29:35,588 INFO L280 TraceCheckUtils]: 104: Hoare triple {4429#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4429#true} is VALID [2020-07-11 02:29:35,588 INFO L280 TraceCheckUtils]: 105: Hoare triple {4429#true} assume 0 != #t~nondet8; {4429#true} is VALID [2020-07-11 02:29:35,588 INFO L280 TraceCheckUtils]: 106: Hoare triple {4429#true} havoc #t~nondet8; {4429#true} is VALID [2020-07-11 02:29:35,588 INFO L280 TraceCheckUtils]: 107: Hoare triple {4429#true} #t~pre9 := 1 + ~c~0; {4429#true} is VALID [2020-07-11 02:29:35,589 INFO L280 TraceCheckUtils]: 108: Hoare triple {4429#true} ~c~0 := 1 + ~c~0; {4429#true} is VALID [2020-07-11 02:29:35,589 INFO L280 TraceCheckUtils]: 109: Hoare triple {4429#true} havoc #t~pre9; {4429#true} is VALID [2020-07-11 02:29:35,589 INFO L263 TraceCheckUtils]: 110: Hoare triple {4429#true} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,590 INFO L280 TraceCheckUtils]: 111: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,590 INFO L280 TraceCheckUtils]: 112: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,590 INFO L280 TraceCheckUtils]: 113: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,590 INFO L275 TraceCheckUtils]: 114: Hoare quadruple {4429#true} {4429#true} #212#return; {4429#true} is VALID [2020-07-11 02:29:35,591 INFO L263 TraceCheckUtils]: 115: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,591 INFO L280 TraceCheckUtils]: 116: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,591 INFO L280 TraceCheckUtils]: 117: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,592 INFO L280 TraceCheckUtils]: 118: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,592 INFO L275 TraceCheckUtils]: 119: Hoare quadruple {4429#true} {4429#true} #214#return; {4429#true} is VALID [2020-07-11 02:29:35,592 INFO L263 TraceCheckUtils]: 120: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,592 INFO L280 TraceCheckUtils]: 121: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,593 INFO L280 TraceCheckUtils]: 122: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,593 INFO L280 TraceCheckUtils]: 123: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,593 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {4429#true} {4429#true} #216#return; {4429#true} is VALID [2020-07-11 02:29:35,594 INFO L263 TraceCheckUtils]: 125: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,594 INFO L280 TraceCheckUtils]: 126: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,594 INFO L280 TraceCheckUtils]: 127: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,594 INFO L280 TraceCheckUtils]: 128: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,595 INFO L275 TraceCheckUtils]: 129: Hoare quadruple {4429#true} {4429#true} #218#return; {4429#true} is VALID [2020-07-11 02:29:35,595 INFO L280 TraceCheckUtils]: 130: Hoare triple {4429#true} #t~pre10 := 1 + ~cp~0; {4429#true} is VALID [2020-07-11 02:29:35,595 INFO L280 TraceCheckUtils]: 131: Hoare triple {4429#true} ~cp~0 := 1 + ~cp~0; {4429#true} is VALID [2020-07-11 02:29:35,596 INFO L280 TraceCheckUtils]: 132: Hoare triple {4429#true} havoc #t~pre10; {4429#true} is VALID [2020-07-11 02:29:35,599 INFO L280 TraceCheckUtils]: 133: Hoare triple {4429#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,600 INFO L263 TraceCheckUtils]: 134: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,600 INFO L280 TraceCheckUtils]: 135: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,600 INFO L280 TraceCheckUtils]: 136: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,600 INFO L280 TraceCheckUtils]: 137: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,601 INFO L275 TraceCheckUtils]: 138: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #208#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,601 INFO L263 TraceCheckUtils]: 139: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-11 02:29:35,602 INFO L280 TraceCheckUtils]: 140: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-11 02:29:35,602 INFO L280 TraceCheckUtils]: 141: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-11 02:29:35,602 INFO L280 TraceCheckUtils]: 142: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-11 02:29:35,603 INFO L275 TraceCheckUtils]: 143: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #210#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,604 INFO L280 TraceCheckUtils]: 144: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,604 INFO L280 TraceCheckUtils]: 145: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet8; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,605 INFO L280 TraceCheckUtils]: 146: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} havoc #t~nondet8; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,605 INFO L280 TraceCheckUtils]: 147: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #t~pre9 := 1 + ~c~0; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,607 INFO L280 TraceCheckUtils]: 148: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} ~c~0 := 1 + ~c~0; {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,608 INFO L280 TraceCheckUtils]: 149: Hoare triple {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} havoc #t~pre9; {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2020-07-11 02:29:35,609 INFO L263 TraceCheckUtils]: 150: Hoare triple {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {4507#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-11 02:29:35,610 INFO L280 TraceCheckUtils]: 151: Hoare triple {4507#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4508#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-11 02:29:35,611 INFO L280 TraceCheckUtils]: 152: Hoare triple {4508#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4430#false} is VALID [2020-07-11 02:29:35,611 INFO L280 TraceCheckUtils]: 153: Hoare triple {4430#false} assume !false; {4430#false} is VALID [2020-07-11 02:29:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2020-07-11 02:29:35,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [793852891] [2020-07-11 02:29:35,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 02:29:35,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 02:29:35,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191237364] [2020-07-11 02:29:35,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2020-07-11 02:29:35,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 02:29:35,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 02:29:35,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:35,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 02:29:35,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 02:29:35,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 02:29:35,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-11 02:29:35,780 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 6 states. [2020-07-11 02:29:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:36,424 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2020-07-11 02:29:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 02:29:36,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2020-07-11 02:29:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 02:29:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:29:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-11 02:29:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 02:29:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-11 02:29:36,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 109 transitions. [2020-07-11 02:29:36,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:36,560 INFO L225 Difference]: With dead ends: 128 [2020-07-11 02:29:36,560 INFO L226 Difference]: Without dead ends: 0 [2020-07-11 02:29:36,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-11 02:29:36,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-11 02:29:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-11 02:29:36,562 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 02:29:36,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:36,562 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:36,563 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:36,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:36,563 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:29:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:29:36,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:36,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:36,564 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:36,564 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-11 02:29:36,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 02:29:36,564 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-11 02:29:36,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:29:36,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:36,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 02:29:36,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 02:29:36,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 02:29:36,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-11 02:29:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-11 02:29:36,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2020-07-11 02:29:36,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 02:29:36,566 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-11 02:29:36,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 02:29:36,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-11 02:29:36,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 02:29:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-11 02:29:36,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 02:29:36,566 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 02:29:36,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-11 02:29:38,406 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:29:38,406 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:29:38,406 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-11 02:29:38,406 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-11 02:29:38,407 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-11 02:29:38,407 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-11 02:29:38,407 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:29:38,407 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:29:38,407 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-11 02:29:38,407 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-11 02:29:38,407 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-11 02:29:38,408 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,408 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,408 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 72) the Hoare annotation is: true [2020-07-11 02:29:38,409 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (= 0 main_~c~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,409 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-11 02:29:38,409 INFO L264 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (= 0 main_~c~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,410 INFO L271 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-07-11 02:29:38,410 INFO L271 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: true [2020-07-11 02:29:38,410 INFO L264 CegarLoopResult]: At program point L36-1(lines 35 41) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,410 INFO L264 CegarLoopResult]: At program point L36-2(lines 36 41) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2020-07-11 02:29:38,410 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,410 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-11 02:29:38,411 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-07-11 02:29:38,411 INFO L271 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-07-11 02:29:38,411 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,411 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,411 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-07-11 02:29:38,412 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,412 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,412 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,412 INFO L264 CegarLoopResult]: At program point L37-4(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,412 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,412 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-11 02:29:38,413 INFO L264 CegarLoopResult]: At program point L54-1(lines 53 66) the Hoare annotation is: (let ((.cse0 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse1 (< 0 main_~scheme~0)) (.cse2 (<= 1 main_~cp~0)) (.cse3 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 .cse1 .cse2 (= 0 main_~c~0) .cse3) (and .cse0 (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) .cse1 .cse2 .cse3))) [2020-07-11 02:29:38,413 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-11 02:29:38,413 INFO L264 CegarLoopResult]: At program point L46(lines 33 69) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,413 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 72) the Hoare annotation is: true [2020-07-11 02:29:38,414 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,414 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,414 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0)) [2020-07-11 02:29:38,414 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 72) the Hoare annotation is: true [2020-07-11 02:29:38,414 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-11 02:29:38,414 INFO L271 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: true [2020-07-11 02:29:38,414 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,415 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,415 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,415 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,415 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-11 02:29:38,415 INFO L264 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,415 INFO L271 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-07-11 02:29:38,416 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,416 INFO L264 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,416 INFO L264 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,416 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,416 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,416 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,417 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,417 INFO L264 CegarLoopResult]: At program point L65-1(line 65) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,417 INFO L264 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,417 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-11 02:29:38,417 INFO L271 CegarLoopResult]: At program point L24-1(lines 14 72) the Hoare annotation is: true [2020-07-11 02:29:38,417 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,417 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-11 02:29:38,418 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-11 02:29:38,418 INFO L264 CegarLoopResult]: At program point L33(lines 33 69) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,418 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,418 INFO L264 CegarLoopResult]: At program point L33-3(line 33) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~cp~0 1) main_~urilen~0)) [2020-07-11 02:29:38,418 INFO L264 CegarLoopResult]: At program point L58(lines 58 64) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,418 INFO L271 CegarLoopResult]: At program point L25(lines 14 72) the Hoare annotation is: true [2020-07-11 02:29:38,418 INFO L264 CegarLoopResult]: At program point L58-1(line 58) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,419 INFO L264 CegarLoopResult]: At program point L58-2(line 58) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,419 INFO L264 CegarLoopResult]: At program point L58-3(lines 58 64) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,419 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,419 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-11 02:29:38,419 INFO L264 CegarLoopResult]: At program point L50-1(lines 50 68) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,419 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-11 02:29:38,419 INFO L264 CegarLoopResult]: At program point L50-2(line 50) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,420 INFO L271 CegarLoopResult]: At program point L50-3(line 50) the Hoare annotation is: true [2020-07-11 02:29:38,420 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,420 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,420 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,420 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,420 INFO L264 CegarLoopResult]: At program point L26(lines 14 72) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2020-07-11 02:29:38,420 INFO L264 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,421 INFO L264 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,421 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,421 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-11 02:29:38,421 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-11 02:29:38,421 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-11 02:29:38,421 INFO L264 CegarLoopResult]: At program point L43(lines 33 69) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-11 02:29:38,422 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-11 02:29:38,422 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:29:38,422 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:29:38,422 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:29:38,422 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-11 02:29:38,423 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-11 02:29:38,428 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-11 02:29:38,429 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:29:38,429 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-11 02:29:38,430 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-11 02:29:38,430 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-11 02:29:38,477 INFO L163 areAnnotationChecker]: CFG has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 02:29:38,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 02:29:38 BoogieIcfgContainer [2020-07-11 02:29:38,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 02:29:38,499 INFO L168 Benchmark]: Toolchain (without parser) took 15227.20 ms. Allocated memory was 145.2 MB in the beginning and 382.7 MB in the end (delta: 237.5 MB). Free memory was 103.4 MB in the beginning and 126.7 MB in the end (delta: -23.2 MB). Peak memory consumption was 214.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:38,500 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-11 02:29:38,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.39 ms. Allocated memory is still 145.2 MB. Free memory was 103.2 MB in the beginning and 92.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:38,501 INFO L168 Benchmark]: Boogie Preprocessor took 148.46 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 181.4 MB in the end (delta: -89.4 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:38,502 INFO L168 Benchmark]: RCFGBuilder took 704.34 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 138.3 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:38,503 INFO L168 Benchmark]: TraceAbstraction took 14028.94 ms. Allocated memory was 202.4 MB in the beginning and 382.7 MB in the end (delta: 180.4 MB). Free memory was 137.7 MB in the beginning and 126.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 191.3 MB. Max. memory is 7.1 GB. [2020-07-11 02:29:38,506 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 339.39 ms. Allocated memory is still 145.2 MB. Free memory was 103.2 MB in the beginning and 92.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.46 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 92.1 MB in the beginning and 181.4 MB in the end (delta: -89.4 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 704.34 ms. Allocated memory is still 202.4 MB. Free memory was 181.4 MB in the beginning and 138.3 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14028.94 ms. Allocated memory was 202.4 MB in the beginning and 382.7 MB in the end (delta: 180.4 MB). Free memory was 137.7 MB in the beginning and 126.7 MB in the end (delta: 11.0 MB). Peak memory consumption was 191.3 MB. Max. memory is 7.1 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((scheme + 1 <= urilen && 0 < scheme) && 1 <= cp) && cp < urilen - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((scheme + 1 <= urilen && 0 < scheme) && 1 <= cp) && 0 == c) && cp < urilen) || (((((scheme + 1 <= urilen && c + 1 <= tokenlen) && 0 <= c) && 0 < scheme) && 1 <= cp) && cp < urilen) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.0s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 681 SDtfs, 320 SDslu, 1933 SDs, 0 SdLazy, 490 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 92 LocationsWithAnnotation, 398 PreInvPairs, 536 NumberOfFragments, 1170 HoareAnnotationTreeSize, 398 FomulaSimplifications, 795 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 92 FomulaSimplificationsInter, 565 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 585 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 86703 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 1430/1430 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...